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.r338-smll-178021499300412.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 FileSystem-PT-N02I10B08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 5.8K May 27 10:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 27 10:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 27 10:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 21K May 27 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K May 27 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 27 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K May 27 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 191K Jun 10 11:57 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 FileSystem-PT-N02I10B08-LTLFireability-00
FORMULA_NAME FileSystem-PT-N02I10B08-LTLFireability-01
FORMULA_NAME FileSystem-PT-N02I10B08-LTLFireability-02
FORMULA_NAME FileSystem-PT-N02I10B08-LTLFireability-03
FORMULA_NAME FileSystem-PT-N02I10B08-LTLFireability-04
FORMULA_NAME FileSystem-PT-N02I10B08-LTLFireability-05
FORMULA_NAME FileSystem-PT-N02I10B08-LTLFireability-06
FORMULA_NAME FileSystem-PT-N02I10B08-LTLFireability-07
FORMULA_NAME FileSystem-PT-N02I10B08-LTLFireability-08
FORMULA_NAME FileSystem-PT-N02I10B08-LTLFireability-09
FORMULA_NAME FileSystem-PT-N02I10B08-LTLFireability-10
FORMULA_NAME FileSystem-PT-N02I10B08-LTLFireability-11
FORMULA_NAME FileSystem-PT-N02I10B08-LTLFireability-12
FORMULA_NAME FileSystem-PT-N02I10B08-LTLFireability-13
FORMULA_NAME FileSystem-PT-N02I10B08-LTLFireability-14
FORMULA_NAME FileSystem-PT-N02I10B08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1781617037938

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N02I10B08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-16 13:37:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-16 13:37:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 13:37:20] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2026-06-16 13:37:20] [INFO ] Transformed 455 places.
[2026-06-16 13:37:20] [INFO ] Transformed 420 transitions.
[2026-06-16 13:37:20] [INFO ] Parsed PT model containing 455 places and 420 transitions and 1490 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA FileSystem-PT-N02I10B08-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B08-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 445 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 420/420 transitions.
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 365 transition count 420
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 146 place count 299 transition count 354
Iterating global reduction 1 with 66 rules applied. Total rules applied 212 place count 299 transition count 354
Applied a total of 212 rules in 125 ms. Remains 299 /445 variables (removed 146) and now considering 354/420 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-732229365516567460.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13528962296242947414.kers'
[2026-06-16 13:37:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-732229365516567460.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13528962296242947414.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 354 rows 291 cols 972 entries
Finished phase 1 with 281 SingleSign rule and 0 generalized
[2026-06-16 13:37:21] [INFO ] Computed 18 invariants in 5 ms
Computed 18 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-13528962296242947414.kers
Total runtime 8 ms.
[2026-06-16 13:37:22] [INFO ] Implicit Places using invariants in 1178 ms returned []
[2026-06-16 13:37:22] [INFO ] Invariant cache hit.
[2026-06-16 13:37:23] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:37:23] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 2669 ms to find 0 implicit places.
Running 344 sub problems to find dead transitions.
[2026-06-16 13:37:24] [INFO ] Invariant cache hit.
[2026-06-16 13:37:24] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 11/299 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 299/653 variables, and 46 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/299 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (OVERLAPS) 11/299 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 21/46 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 344 unsolved
SMT process timed out in 60372ms, After SMT, problems are : Problem set: 0 solved, 344 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Starting structural reductions in LTL mode, iteration 1 : 299/445 places, 354/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63294 ms. Remains : 299/445 places, 354/420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 354/354 transitions.
Applied a total of 0 rules in 13 ms. Remains 299 /299 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2026-06-16 13:38:24] [INFO ] Invariant cache hit.
[2026-06-16 13:38:25] [INFO ] Implicit Places using invariants in 590 ms returned []
[2026-06-16 13:38:25] [INFO ] Invariant cache hit.
[2026-06-16 13:38:25] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:38:25] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1501 ms. Remains : 299/299 places, 354/354 transitions.
Support contains 45 out of 299 places after structural reductions.
[2026-06-16 13:38:26] [INFO ] Flatten gal took : 112 ms
[2026-06-16 13:38:26] [INFO ] Flatten gal took : 56 ms
[2026-06-16 13:38:26] [INFO ] Input system was already deterministic with 354 transitions.
Support contains 43 out of 299 places (down from 45) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (8 resets) in 2561 ms. (15 steps per ms) remains 5/28 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 122 ms. (325 steps per ms) remains 2/3 properties
[2026-06-16 13:38:27] [INFO ] Invariant cache hit.
[2026-06-16 13:38:27] [INFO ] State equation strengthened by 80 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) 265/267 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/291 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 8/299 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 354/653 variables, 299/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 80/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/653 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 653/653 variables, and 407 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3098 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 299/299 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 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) 265/267 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/291 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/299 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 354/653 variables, 299/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 80/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/653 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/653 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/653 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 653/653 variables, and 412 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1432 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 299/299 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4542ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 394 ms.
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 299 transition count 344
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 289 transition count 344
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 24 place count 285 transition count 340
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 285 transition count 340
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 204 place count 197 transition count 252
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 284 place count 197 transition count 172
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 2 with 86 rules applied. Total rules applied 370 place count 111 transition count 172
Applied a total of 370 rules in 140 ms. Remains 111 /299 variables (removed 188) and now considering 172/354 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 111/299 places, 172/354 transitions.
RANDOM walk for 40000 steps (8 resets) in 268 ms. (148 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 78 ms. (506 steps per ms) remains 1/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7296807176518191392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3051003730306876077.kers'
[2026-06-16 13:38:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7296807176518191392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3051003730306876077.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 172 rows 101 cols 434 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-06-16 13:38:32] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3051003730306876077.kers
Total runtime 3 ms.
[2026-06-16 13:38:32] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/111 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 172/283 variables, 111/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 80/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/283 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 770 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 111/111 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/111 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 172/283 variables, 111/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 80/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/283 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 111/111 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1158ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 172/172 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 109 transition count 171
Applied a total of 3 rules in 31 ms. Remains 109 /111 variables (removed 2) and now considering 171/172 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 109/111 places, 171/172 transitions.
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Probably explored full state space saw : 59608 states, properties seen :0
Probabilistic random walk after 215502 steps, saw 59608 distinct states, run finished after 510 ms. (steps per millisecond=422 ) properties seen :0
Explored full state space saw : 59608 states, properties seen :0
Exhaustive walk after 215502 steps, saw 59608 distinct states, run finished after 331 ms. (steps per millisecond=651 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 51 stabilizing places and 114 stable transitions
FORMULA FileSystem-PT-N02I10B08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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||(G(p2)&&p1)))))'
Support contains 5 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 354/354 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 299 transition count 345
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 290 transition count 345
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 284 transition count 339
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 284 transition count 339
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 190 place count 204 transition count 259
Applied a total of 190 rules in 41 ms. Remains 204 /299 variables (removed 95) and now considering 259/354 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17190566075677219104.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2196770584194594763.kers'
[2026-06-16 13:38:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17190566075677219104.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2196770584194594763.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 259 rows 196 cols 776 entries
Finished phase 1 with 186 SingleSign rule and 0 generalized
[2026-06-16 13:38:35] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2196770584194594763.kers
Total runtime 3 ms.
[2026-06-16 13:38:35] [INFO ] Implicit Places using invariants in 390 ms returned []
[2026-06-16 13:38:35] [INFO ] Invariant cache hit.
[2026-06-16 13:38:35] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:38:36] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1369 ms to find 0 implicit places.
[2026-06-16 13:38:36] [INFO ] Redundant transitions in 23 ms returned []
Running 249 sub problems to find dead transitions.
[2026-06-16 13:38:36] [INFO ] Invariant cache hit.
[2026-06-16 13:38:36] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 11/204 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 10 (OVERLAPS) 259/463 variables, 204/245 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 80/325 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 325 constraints, problems are : Problem set: 0 solved, 249 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 204/204 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (OVERLAPS) 11/204 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 259/463 variables, 204/246 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD140 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 80/326 constraints. Problems are: Problem set: 12 solved, 237 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 237/563 constraints. Problems are: Problem set: 12 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 563 constraints, problems are : Problem set: 12 solved, 237 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 204/204 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 237/249 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 12 solved, 237 unsolved
Search for dead transitions found 12 dead transitions in 60164ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 204/299 places, 247/354 transitions.
Applied a total of 0 rules in 22 ms. Remains 204 /204 variables (removed 0) and now considering 247/247 (removed 0) transitions.
[2026-06-16 13:39:36] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61643 ms. Remains : 204/299 places, 247/354 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||(G(p2)&&p1)))))'
Stuttering acceptance computed with spot in 380 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLFireability-00
Product exploration explored 100000 steps with 2 reset in 658 ms.
Product exploration explored 100000 steps with 6 reset in 274 ms.
Computed a total of 36 stabilizing places and 87 stable transitions
Computed a total of 36 stabilizing places and 87 stable transitions
Detected a total of 36/204 stabilizing places and 87/247 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 8 factoid took 311 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 401 ms. (99 steps per ms) remains 1/7 properties
BEST_FIRST walk for 23840 steps (6 resets) in 94 ms. (250 steps per ms) remains 0/1 properties
Knowledge based reduction with 8 factoid took 382 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 1023 ms.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 247/247 transitions.
Applied a total of 0 rules in 20 ms. Remains 204 /204 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8308414771248016843.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13364681812535858502.kers'
[2026-06-16 13:39:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8308414771248016843.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13364681812535858502.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 247 rows 196 cols 740 entries
Finished phase 1 with 186 SingleSign rule and 0 generalized
[2026-06-16 13:39:39] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13364681812535858502.kers
Total runtime 3 ms.
[2026-06-16 13:39:39] [INFO ] Implicit Places using invariants in 420 ms returned []
[2026-06-16 13:39:39] [INFO ] Invariant cache hit.
[2026-06-16 13:39:40] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:39:40] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2026-06-16 13:39:40] [INFO ] Redundant transitions in 5 ms returned []
Running 237 sub problems to find dead transitions.
[2026-06-16 13:39:40] [INFO ] Invariant cache hit.
[2026-06-16 13:39:40] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 11/204 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 247/451 variables, 204/242 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 80/322 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 451/451 variables, and 322 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 204/204 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (OVERLAPS) 11/204 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (OVERLAPS) 247/451 variables, 204/242 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 80/322 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 237/559 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 559 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 204/204 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61489 ms. Remains : 204/204 places, 247/247 transitions.
Computed a total of 36 stabilizing places and 87 stable transitions
Computed a total of 36 stabilizing places and 87 stable transitions
Detected a total of 36/204 stabilizing places and 87/247 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 8 factoid took 344 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 1/7 properties
BEST_FIRST walk for 7352 steps (2 resets) in 18 ms. (386 steps per ms) remains 0/1 properties
Knowledge based reduction with 8 factoid took 369 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 1027 ms.
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 249 ms.
Product exploration explored 100000 steps with 1 reset in 350 ms.
Built C files in :
/tmp/ltsmin12613795103221191298
[2026-06-16 13:40:42] [INFO ] Computing symmetric may disable matrix : 247 transitions.
[2026-06-16 13:40:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:40:42] [INFO ] Computing symmetric may enable matrix : 247 transitions.
[2026-06-16 13:40:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:40:43] [INFO ] Computing Do-Not-Accords matrix : 247 transitions.
[2026-06-16 13:40:43] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:40:43] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12613795103221191298
Running compilation step : cd /tmp/ltsmin12613795103221191298;'/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 1145 ms.
Running link step : cd /tmp/ltsmin12613795103221191298;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin12613795103221191298;'/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/stateBased14998101868568782242.hoa' '--buchi-type=spotba'
LTSmin run took 619 ms.
FORMULA FileSystem-PT-N02I10B08-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FileSystem-PT-N02I10B08-LTLFireability-00 finished in 129735 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 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 299 transition count 344
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 289 transition count 344
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 26 place count 283 transition count 338
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 283 transition count 338
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 208 place count 195 transition count 250
Applied a total of 208 rules in 57 ms. Remains 195 /299 variables (removed 104) and now considering 250/354 (removed 104) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3559224931960986920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10274517520226876749.kers'
[2026-06-16 13:40:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3559224931960986920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10274517520226876749.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 250 rows 187 cols 830 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-06-16 13:40:44] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10274517520226876749.kers
Total runtime 5 ms.
[2026-06-16 13:40:45] [INFO ] Implicit Places using invariants in 620 ms returned []
[2026-06-16 13:40:45] [INFO ] Invariant cache hit.
[2026-06-16 13:40:45] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:40:47] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 2226 ms to find 0 implicit places.
[2026-06-16 13:40:47] [INFO ] Redundant transitions in 3 ms returned []
Running 240 sub problems to find dead transitions.
[2026-06-16 13:40:47] [INFO ] Invariant cache hit.
[2026-06-16 13:40:47] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 11/195 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 250/445 variables, 195/228 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 80/308 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/445 variables, and 308 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 11/195 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 250/445 variables, 195/228 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 80/308 constraints. Problems are: Problem set: 12 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 228/536 constraints. Problems are: Problem set: 12 solved, 228 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/445 variables, and 536 constraints, problems are : Problem set: 12 solved, 228 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 228/240 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 12 solved, 228 unsolved
Search for dead transitions found 12 dead transitions in 60089ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 195/299 places, 238/354 transitions.
Applied a total of 0 rules in 17 ms. Remains 195 /195 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2026-06-16 13:41:47] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 62414 ms. Remains : 195/299 places, 238/354 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 168 ms.
Stack based approach found an accepted trace after 110 steps with 0 reset with depth 111 and stack size 111 in 1 ms.
FORMULA FileSystem-PT-N02I10B08-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N02I10B08-LTLFireability-02 finished in 62707 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&&F((X((F(G(p3))&&p2))&&p1)))))'
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 354/354 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 294 transition count 349
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 294 transition count 349
Applied a total of 10 rules in 10 ms. Remains 294 /299 variables (removed 5) and now considering 349/354 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15255342798161137984.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5651976092484088068.kers'
[2026-06-16 13:41:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15255342798161137984.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5651976092484088068.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 349 rows 286 cols 957 entries
Finished phase 1 with 276 SingleSign rule and 0 generalized
[2026-06-16 13:41:47] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5651976092484088068.kers
Total runtime 4 ms.
[2026-06-16 13:41:48] [INFO ] Implicit Places using invariants in 608 ms returned []
[2026-06-16 13:41:48] [INFO ] Invariant cache hit.
[2026-06-16 13:41:48] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:41:49] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1652 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-06-16 13:41:49] [INFO ] Invariant cache hit.
[2026-06-16 13:41:49] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 11/294 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 339 unsolved
SMT process timed out in 30139ms, After SMT, problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 30142ms
Starting structural reductions in LTL mode, iteration 1 : 294/299 places, 349/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31808 ms. Remains : 294/299 places, 349/354 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&&F((X((F(G(p3))&&p2))&&p1)))))'
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 201 ms.
Stack based approach found an accepted trace after 195 steps with 0 reset with depth 196 and stack size 196 in 1 ms.
FORMULA FileSystem-PT-N02I10B08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N02I10B08-LTLFireability-03 finished in 32287 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 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 299 transition count 344
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 289 transition count 344
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 284 transition count 339
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 284 transition count 339
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 206 place count 196 transition count 251
Applied a total of 206 rules in 31 ms. Remains 196 /299 variables (removed 103) and now considering 251/354 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8311956060027267237.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12641155161255334164.kers'
[2026-06-16 13:42:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8311956060027267237.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12641155161255334164.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 251 rows 188 cols 832 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-06-16 13:42:19] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12641155161255334164.kers
Total runtime 3 ms.
[2026-06-16 13:42:20] [INFO ] Implicit Places using invariants in 428 ms returned []
[2026-06-16 13:42:20] [INFO ] Invariant cache hit.
[2026-06-16 13:42:20] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:42:21] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
[2026-06-16 13:42:21] [INFO ] Redundant transitions in 0 ms returned []
Running 241 sub problems to find dead transitions.
[2026-06-16 13:42:21] [INFO ] Invariant cache hit.
[2026-06-16 13:42:21] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 11/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 251/447 variables, 196/234 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 80/314 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/447 variables, and 314 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 11/196 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 251/447 variables, 196/249 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 80/329 constraints. Problems are: Problem set: 12 solved, 229 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 229/558 constraints. Problems are: Problem set: 12 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 558 constraints, problems are : Problem set: 12 solved, 229 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 229/241 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60061ms problems are : Problem set: 12 solved, 229 unsolved
Search for dead transitions found 12 dead transitions in 60062ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 196/299 places, 239/354 transitions.
Applied a total of 0 rules in 9 ms. Remains 196 /196 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2026-06-16 13:43:21] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61340 ms. Remains : 196/299 places, 239/354 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 39 ms :[(NOT p0)]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 142 ms.
Stack based approach found an accepted trace after 73 steps with 0 reset with depth 74 and stack size 74 in 0 ms.
FORMULA FileSystem-PT-N02I10B08-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N02I10B08-LTLFireability-04 finished in 61558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1)))&&X(G((X(p3)&&p2)))))'
Support contains 5 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 354/354 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 294 transition count 349
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 294 transition count 349
Applied a total of 10 rules in 6 ms. Remains 294 /299 variables (removed 5) and now considering 349/354 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15594114822094090389.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-627567048725351258.kers'
[2026-06-16 13:43:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15594114822094090389.kers, --Pflows, --basisKERS=/tmp/petrispot-output-627567048725351258.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 349 rows 286 cols 957 entries
Finished phase 1 with 276 SingleSign rule and 0 generalized
[2026-06-16 13:43:21] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-627567048725351258.kers
Total runtime 4 ms.
[2026-06-16 13:43:22] [INFO ] Implicit Places using invariants in 659 ms returned []
[2026-06-16 13:43:22] [INFO ] Invariant cache hit.
[2026-06-16 13:43:22] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:43:23] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 294/299 places, 349/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1915 ms. Remains : 294/299 places, 349/354 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(G((X(p3)&&p2)))))'
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p3) (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p3)), true, (AND p2 (NOT p3))]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 198 ms.
Stack based approach found an accepted trace after 145 steps with 0 reset with depth 146 and stack size 146 in 1 ms.
FORMULA FileSystem-PT-N02I10B08-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N02I10B08-LTLFireability-05 finished in 2454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 354/354 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 293 transition count 348
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 293 transition count 348
Applied a total of 12 rules in 9 ms. Remains 293 /299 variables (removed 6) and now considering 348/354 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-753686252791598797.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10952319343051610008.kers'
[2026-06-16 13:43:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-753686252791598797.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10952319343051610008.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 348 rows 285 cols 954 entries
Finished phase 1 with 275 SingleSign rule and 0 generalized
[2026-06-16 13:43:23] [INFO ] Computed 18 invariants in 4 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10952319343051610008.kers
Total runtime 5 ms.
[2026-06-16 13:43:24] [INFO ] Implicit Places using invariants in 677 ms returned []
[2026-06-16 13:43:24] [INFO ] Invariant cache hit.
[2026-06-16 13:43:24] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:43:26] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 2205 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-06-16 13:43:26] [INFO ] Invariant cache hit.
[2026-06-16 13:43:26] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 11/293 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 293/641 variables, and 70 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/293 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 11/293 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 46/70 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/641 variables, and 93 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/293 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 0/338 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 293/299 places, 348/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62295 ms. Remains : 293/299 places, 348/354 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FileSystem-PT-N02I10B08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FileSystem-PT-N02I10B08-LTLFireability-06 finished in 62458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(G(p0))))&&(!p1 U (G(!p1)||(!p1&&G(!p2)))))))'
Support contains 5 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 354/354 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 293 transition count 348
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 293 transition count 348
Applied a total of 12 rules in 6 ms. Remains 293 /299 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2026-06-16 13:44:26] [INFO ] Invariant cache hit.
[2026-06-16 13:44:27] [INFO ] Implicit Places using invariants in 707 ms returned []
[2026-06-16 13:44:27] [INFO ] Invariant cache hit.
[2026-06-16 13:44:27] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:44:29] [INFO ] Implicit Places using invariants and state equation in 2094 ms returned []
Implicit Place search using SMT with State Equation took 2802 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 293/299 places, 348/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2808 ms. Remains : 293/299 places, 348/354 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(G(p0))))&&(!p1 U (G(!p1)||(!p1&&G(!p2)))))))'
Stuttering acceptance computed with spot in 1478 ms :[(OR (NOT p0) p1), (NOT p0), (AND p1 p2), p1, (NOT p0), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 346 ms.
Product exploration explored 100000 steps with 0 reset in 350 ms.
Computed a total of 45 stabilizing places and 108 stable transitions
Computed a total of 45 stabilizing places and 108 stable transitions
Knowledge based reduction with 13 factoid took 2189 ms. Reduced automaton from 24 states, 162 edges and 3 AP (stutter sensitive) to 24 states, 162 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 371 ms. (107 steps per ms) remains 6/19 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 212 ms. (187 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/6 properties
[2026-06-16 13:44:34] [INFO ] Invariant cache hit.
[2026-06-16 13:44:34] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf17 is UNSAT
At refinement iteration 1 (OVERLAPS) 277/282 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 5/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 11/293 variables, 11/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem apf3 is UNSAT
Problem apf15 is UNSAT
After SMT solving in domain Real declared 641/641 variables, and 316 constraints, problems are : Problem set: 3 solved, 0 unsolved in 1599 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 293/293 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1607ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge based reduction with 16 factoid took 15791 ms. Reduced automaton from 24 states, 162 edges and 3 AP (stutter sensitive) to 24 states, 144 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1390 ms :[(OR (NOT p0) p1), (NOT p0), (AND p1 p2), p1, (NOT p0), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
[2026-06-16 13:44:52] [INFO ] Invariant cache hit.
[2026-06-16 13:44:53] [INFO ] [Real]Absence check using 18 positive place invariants in 544 ms returned sat
[2026-06-16 13:44:56] [INFO ] [Real]Absence check using state equation in 2149 ms returned sat
[2026-06-16 13:44:56] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 13:44:56] [INFO ] [Nat]Absence check using 18 positive place invariants in 315 ms returned sat
[2026-06-16 13:44:59] [INFO ] [Nat]Absence check using state equation in 3207 ms returned sat
[2026-06-16 13:44:59] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:45:00] [INFO ] [Nat]Added 80 Read/Feed constraints in 113 ms returned sat
[2026-06-16 13:45:00] [INFO ] Computed and/alt/rep : 250/260/250 causal constraints (skipped 88 transitions) in 31 ms.
[2026-06-16 13:45:02] [INFO ] Added : 75 causal constraints over 15 iterations in 2684 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 31319 ms.
Stuttering acceptance computed with spot in 1289 ms :[(OR (NOT p0) p1), (NOT p0), (AND p1 p2), p1, (NOT p0), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 5 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 348/348 transitions.
Applied a total of 0 rules in 5 ms. Remains 293 /293 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2026-06-16 13:45:04] [INFO ] Invariant cache hit.
[2026-06-16 13:45:04] [INFO ] Implicit Places using invariants in 721 ms returned []
[2026-06-16 13:45:04] [INFO ] Invariant cache hit.
[2026-06-16 13:45:05] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:45:06] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned []
Implicit Place search using SMT with State Equation took 2403 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2408 ms. Remains : 293/293 places, 348/348 transitions.
Computed a total of 45 stabilizing places and 108 stable transitions
Computed a total of 45 stabilizing places and 108 stable transitions
Knowledge based reduction with 9 factoid took 18381 ms. Reduced automaton from 24 states, 144 edges and 3 AP (stutter sensitive) to 24 states, 144 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 315 ms. (126 steps per ms) remains 3/15 properties
BEST_FIRST walk for 20842 steps (4 resets) in 53 ms. (385 steps per ms) remains 0/3 properties
Knowledge based reduction with 9 factoid took 19401 ms. Reduced automaton from 24 states, 144 edges and 3 AP (stutter sensitive) to 24 states, 144 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1467 ms :[(OR (NOT p0) p1), (NOT p0), (AND p1 p2), p1, (NOT p0), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
[2026-06-16 13:45:45] [INFO ] Invariant cache hit.
[2026-06-16 13:45:46] [INFO ] [Real]Absence check using 18 positive place invariants in 581 ms returned sat
[2026-06-16 13:45:48] [INFO ] [Real]Absence check using state equation in 1786 ms returned sat
[2026-06-16 13:45:48] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 13:45:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 313 ms returned sat
[2026-06-16 13:45:52] [INFO ] [Nat]Absence check using state equation in 2857 ms returned sat
[2026-06-16 13:45:52] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:45:52] [INFO ] [Nat]Added 80 Read/Feed constraints in 117 ms returned sat
[2026-06-16 13:45:52] [INFO ] Computed and/alt/rep : 250/260/250 causal constraints (skipped 88 transitions) in 24 ms.
[2026-06-16 13:45:54] [INFO ] Added : 75 causal constraints over 15 iterations in 2621 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 48418 ms.
Stuttering acceptance computed with spot in 1382 ms :[(OR (NOT p0) p1), (NOT p0), (AND p1 p2), p1, (NOT p0), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 1429 ms :[(OR (NOT p0) p1), (NOT p0), (AND p1 p2), p1, (NOT p0), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (OR (AND (NOT p0) p2) (AND p1 p2)), (NOT p0), (AND p1 p2 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (AND p1 p2 (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 0 reset in 179 ms.
Stack based approach found an accepted trace after 113 steps with 0 reset with depth 114 and stack size 114 in 0 ms.
FORMULA FileSystem-PT-N02I10B08-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N02I10B08-LTLFireability-07 finished in 91526 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(((F(!p0) U !p1)&&X(F(p2)))))'
Support contains 5 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 354/354 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 293 transition count 348
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 293 transition count 348
Applied a total of 12 rules in 6 ms. Remains 293 /299 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2026-06-16 13:45:57] [INFO ] Invariant cache hit.
[2026-06-16 13:45:58] [INFO ] Implicit Places using invariants in 445 ms returned []
[2026-06-16 13:45:58] [INFO ] Invariant cache hit.
[2026-06-16 13:45:58] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:46:00] [INFO ] Implicit Places using invariants and state equation in 1716 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 293/299 places, 348/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2171 ms. Remains : 293/299 places, 348/354 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(((F(!p0) U !p1)&&X(F(p2)))))'
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p0, p1, (NOT p2)]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 231 ms.
Product exploration explored 100000 steps with 33333 reset in 263 ms.
Computed a total of 45 stabilizing places and 108 stable transitions
Computed a total of 45 stabilizing places and 108 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 17 ms. Proved property starting from automaton with 5 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA FileSystem-PT-N02I10B08-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FileSystem-PT-N02I10B08-LTLFireability-08 finished in 2951 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 1 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 299 transition count 344
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 289 transition count 344
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 284 transition count 339
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 284 transition count 339
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 206 place count 196 transition count 251
Applied a total of 206 rules in 25 ms. Remains 196 /299 variables (removed 103) and now considering 251/354 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18021512759719069175.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6413745276791978423.kers'
[2026-06-16 13:46:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18021512759719069175.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6413745276791978423.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 251 rows 188 cols 832 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-06-16 13:46:00] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6413745276791978423.kers
Total runtime 3 ms.
[2026-06-16 13:46:01] [INFO ] Implicit Places using invariants in 465 ms returned []
[2026-06-16 13:46:01] [INFO ] Invariant cache hit.
[2026-06-16 13:46:01] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:46:02] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
[2026-06-16 13:46:02] [INFO ] Redundant transitions in 1 ms returned []
Running 241 sub problems to find dead transitions.
[2026-06-16 13:46:02] [INFO ] Invariant cache hit.
[2026-06-16 13:46:02] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 11/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 251/447 variables, 196/230 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 80/310 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/447 variables, and 310 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 11/196 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 251/447 variables, 196/231 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD149 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 80/311 constraints. Problems are: Problem set: 12 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 229/540 constraints. Problems are: Problem set: 12 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 540 constraints, problems are : Problem set: 12 solved, 229 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/196 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 229/241 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 12 solved, 229 unsolved
Search for dead transitions found 12 dead transitions in 60093ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 196/299 places, 239/354 transitions.
Applied a total of 0 rules in 7 ms. Remains 196 /196 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2026-06-16 13:47:02] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61445 ms. Remains : 196/299 places, 239/354 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 51 ms :[(NOT p0)]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 223 ms.
Stack based approach found an accepted trace after 169 steps with 3 reset with depth 86 and stack size 86 in 1 ms.
FORMULA FileSystem-PT-N02I10B08-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N02I10B08-LTLFireability-09 finished in 61756 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) U p1)&&G(F(!p1))) U p2))'
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 354/354 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 299 transition count 345
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 290 transition count 345
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 285 transition count 340
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 285 transition count 340
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 180 place count 209 transition count 264
Applied a total of 180 rules in 36 ms. Remains 209 /299 variables (removed 90) and now considering 264/354 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5141298375334835586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6048726123979907909.kers'
[2026-06-16 13:47:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5141298375334835586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6048726123979907909.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 264 rows 201 cols 849 entries
Finished phase 1 with 191 SingleSign rule and 0 generalized
[2026-06-16 13:47:02] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6048726123979907909.kers
Total runtime 4 ms.
[2026-06-16 13:47:03] [INFO ] Implicit Places using invariants in 434 ms returned []
[2026-06-16 13:47:03] [INFO ] Invariant cache hit.
[2026-06-16 13:47:03] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:47:03] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
[2026-06-16 13:47:03] [INFO ] Redundant transitions in 1 ms returned []
Running 254 sub problems to find dead transitions.
[2026-06-16 13:47:03] [INFO ] Invariant cache hit.
[2026-06-16 13:47:03] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 11/209 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 209/473 variables, and 80 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/209 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 62/62 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/198 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 11/209 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 60/80 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 264/473 variables, 209/290 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 80/370 constraints. Problems are: Problem set: 12 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 242/612 constraints. Problems are: Problem set: 12 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/473 variables, and 612 constraints, problems are : Problem set: 12 solved, 242 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 242/254 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 12 solved, 242 unsolved
Search for dead transitions found 12 dead transitions in 60084ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 209/299 places, 252/354 transitions.
Applied a total of 0 rules in 12 ms. Remains 209 /209 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2026-06-16 13:48:03] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61355 ms. Remains : 209/299 places, 252/354 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) U p1)&&G(F(!p1))) U p2))'
Stuttering acceptance computed with spot in 242 ms :[(NOT p2), (NOT p0), (NOT p1), p1, p1]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 221 ms.
Stack based approach found an accepted trace after 79 steps with 0 reset with depth 80 and stack size 80 in 1 ms.
FORMULA FileSystem-PT-N02I10B08-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N02I10B08-LTLFireability-10 finished in 61856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U ((!p0 U G(p0))||X(X(p1)))))))'
Support contains 5 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 354/354 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 293 transition count 348
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 293 transition count 348
Applied a total of 12 rules in 9 ms. Remains 293 /299 variables (removed 6) and now considering 348/354 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1261197468530146770.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13684844933060970444.kers'
[2026-06-16 13:48:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1261197468530146770.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13684844933060970444.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 348 rows 285 cols 954 entries
Finished phase 1 with 275 SingleSign rule and 0 generalized
[2026-06-16 13:48:04] [INFO ] Computed 18 invariants in 4 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13684844933060970444.kers
Total runtime 6 ms.
[2026-06-16 13:48:04] [INFO ] Implicit Places using invariants in 483 ms returned []
[2026-06-16 13:48:04] [INFO ] Invariant cache hit.
[2026-06-16 13:48:05] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:48:05] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 293/299 places, 348/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1255 ms. Remains : 293/299 places, 348/354 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U ((!p0 U G(p0))||X(X(p1)))))))'
Stuttering acceptance computed with spot in 472 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLFireability-12
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 0 ms.
FORMULA FileSystem-PT-N02I10B08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FileSystem-PT-N02I10B08-LTLFireability-12 finished in 1773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((X(p1)||p0)))))))'
Support contains 5 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 354/354 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 293 transition count 348
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 293 transition count 348
Applied a total of 12 rules in 10 ms. Remains 293 /299 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2026-06-16 13:48:06] [INFO ] Invariant cache hit.
[2026-06-16 13:48:06] [INFO ] Implicit Places using invariants in 642 ms returned []
[2026-06-16 13:48:06] [INFO ] Invariant cache hit.
[2026-06-16 13:48:07] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:48:07] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1665 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 293/299 places, 348/354 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1677 ms. Remains : 293/299 places, 348/354 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((X(p1)||p0)))))))'
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLFireability-13
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA FileSystem-PT-N02I10B08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FileSystem-PT-N02I10B08-LTLFireability-13 finished in 1971 ms.
All properties solved by simple procedures.
Total runtime 647907 ms.

BK_STOP 1781617688257

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FileSystem-PT-N02I10B08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r338-smll-178021499300412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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