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-178021499300411.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300411
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME FileSystem-PT-N02I10B08-LTLCardinality-01
FORMULA_NAME FileSystem-PT-N02I10B08-LTLCardinality-02
FORMULA_NAME FileSystem-PT-N02I10B08-LTLCardinality-03
FORMULA_NAME FileSystem-PT-N02I10B08-LTLCardinality-04
FORMULA_NAME FileSystem-PT-N02I10B08-LTLCardinality-05
FORMULA_NAME FileSystem-PT-N02I10B08-LTLCardinality-06
FORMULA_NAME FileSystem-PT-N02I10B08-LTLCardinality-07
FORMULA_NAME FileSystem-PT-N02I10B08-LTLCardinality-08
FORMULA_NAME FileSystem-PT-N02I10B08-LTLCardinality-09
FORMULA_NAME FileSystem-PT-N02I10B08-LTLCardinality-10
FORMULA_NAME FileSystem-PT-N02I10B08-LTLCardinality-11
FORMULA_NAME FileSystem-PT-N02I10B08-LTLCardinality-12
FORMULA_NAME FileSystem-PT-N02I10B08-LTLCardinality-13
FORMULA_NAME FileSystem-PT-N02I10B08-LTLCardinality-14
FORMULA_NAME FileSystem-PT-N02I10B08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1781614823755

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202604301425
[2026-06-16 13:00:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-16 13:00:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 13:00:26] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2026-06-16 13:00:26] [INFO ] Transformed 455 places.
[2026-06-16 13:00:26] [INFO ] Transformed 420 transitions.
[2026-06-16 13:00:26] [INFO ] Parsed PT model containing 455 places and 420 transitions and 1490 arcs in 434 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 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-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 445 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 420/420 transitions.
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 373 transition count 420
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 128 place count 317 transition count 364
Iterating global reduction 1 with 56 rules applied. Total rules applied 184 place count 317 transition count 364
Applied a total of 184 rules in 80 ms. Remains 317 /445 variables (removed 128) and now considering 364/420 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-391754387055736257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-395864055775801632.kers'
[2026-06-16 13:00:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-391754387055736257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-395864055775801632.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 364 rows 309 cols 1010 entries
Finished phase 1 with 299 SingleSign rule and 0 generalized
[2026-06-16 13:00:27] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-395864055775801632.kers
Total runtime 6 ms.
[2026-06-16 13:00:28] [INFO ] Implicit Places using invariants in 1690 ms returned []
[2026-06-16 13:00:28] [INFO ] Invariant cache hit.
[2026-06-16 13:00:29] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:00:30] [INFO ] Implicit Places using invariants and state equation in 1863 ms returned []
Implicit Place search using SMT with State Equation took 3606 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2026-06-16 13:00:30] [INFO ] Invariant cache hit.
[2026-06-16 13:00:30] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 11/309 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 309/681 variables, and 51 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/317 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 354 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (OVERLAPS) 11/309 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 309/681 variables, and 69 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/317 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 0/354 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60400ms problems are : Problem set: 0 solved, 354 unsolved
Search for dead transitions found 0 dead transitions in 60433ms
Starting structural reductions in LTL mode, iteration 1 : 317/445 places, 364/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64198 ms. Remains : 317/445 places, 364/420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 364/364 transitions.
Applied a total of 0 rules in 15 ms. Remains 317 /317 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2026-06-16 13:01:31] [INFO ] Invariant cache hit.
[2026-06-16 13:01:32] [INFO ] Implicit Places using invariants in 930 ms returned []
[2026-06-16 13:01:32] [INFO ] Invariant cache hit.
[2026-06-16 13:01:32] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:01:33] [INFO ] Implicit Places using invariants and state equation in 1637 ms returned []
Implicit Place search using SMT with State Equation took 2571 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2588 ms. Remains : 317/317 places, 364/364 transitions.
Support contains 48 out of 317 places after structural reductions.
[2026-06-16 13:01:34] [INFO ] Flatten gal took : 103 ms
[2026-06-16 13:01:34] [INFO ] Flatten gal took : 50 ms
[2026-06-16 13:01:34] [INFO ] Input system was already deterministic with 364 transitions.
RANDOM walk for 40000 steps (8 resets) in 3175 ms. (12 steps per ms) remains 13/35 properties
BEST_FIRST walk for 40002 steps (8 resets) in 299 ms. (133 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 218 ms. (182 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 217 ms. (183 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 191 ms. (208 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 189 ms. (210 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
[2026-06-16 13:01:36] [INFO ] Invariant cache hit.
[2026-06-16 13:01:36] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 288/302 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 11/313 variables, 11/18 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 5 (OVERLAPS) 364/677 variables, 313/331 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/677 variables, 80/411 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/677 variables, 0/411 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/681 variables, 4/415 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 0/415 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/681 variables, 0/415 constraints. Problems are: Problem set: 9 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 681/681 variables, and 415 constraints, problems are : Problem set: 9 solved, 3 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 317/317 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 293/298 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 11/15 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/15 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 14/312 variables, 14/29 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/29 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 364/676 variables, 312/341 constraints. Problems are: Problem set: 9 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 80/421 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 1/422 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 0/422 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/681 variables, 5/427 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/681 variables, 1/428 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/681 variables, 0/428 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/681 variables, 0/428 constraints. Problems are: Problem set: 10 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 681/681 variables, and 428 constraints, problems are : Problem set: 10 solved, 2 unsolved in 4392 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 317/317 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 2/12 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5300ms problems are : Problem set: 10 solved, 2 unsolved
Parikh walk visited 0 properties in 342 ms.
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 364/364 transitions.
Graph (complete) has 758 edges and 317 vertex of which 311 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output 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 11 place count 311 transition count 354
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 301 transition count 354
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 34 place count 288 transition count 341
Iterating global reduction 2 with 13 rules applied. Total rules applied 47 place count 288 transition count 341
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 223 place count 200 transition count 253
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 303 place count 200 transition count 173
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 2 with 85 rules applied. Total rules applied 388 place count 115 transition count 173
Applied a total of 388 rules in 166 ms. Remains 115 /317 variables (removed 202) and now considering 173/364 (removed 191) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 115/317 places, 173/364 transitions.
RANDOM walk for 40000 steps (8 resets) in 457 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Probably explored full state space saw : 60714 states, properties seen :1
Probabilistic random walk after 218865 steps, saw 60714 distinct states, run finished after 991 ms. (steps per millisecond=220 ) properties seen :1
Explored full state space saw : 60714 states, properties seen :0
Exhaustive walk after 218865 steps, saw 60714 distinct states, run finished after 326 ms. (steps per millisecond=671 ) properties seen :0
FORMULA FileSystem-PT-N02I10B08-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
FORMULA FileSystem-PT-N02I10B08-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I10B08-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 69 stabilizing places and 124 stable transitions
Graph (complete) has 766 edges and 317 vertex of which 309 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 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 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 364/364 transitions.
Graph (complete) has 766 edges and 317 vertex of which 309 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 0 output 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 11 place count 309 transition count 354
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 299 transition count 354
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 36 place count 284 transition count 339
Iterating global reduction 2 with 15 rules applied. Total rules applied 51 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 227 place count 196 transition count 251
Applied a total of 227 rules in 139 ms. Remains 196 /317 variables (removed 121) and now considering 251/364 (removed 113) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10281683471050194528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5749376269829706504.kers'
[2026-06-16 13:01:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10281683471050194528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5749376269829706504.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:01:44] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5749376269829706504.kers
Total runtime 4 ms.
[2026-06-16 13:01:44] [INFO ] Implicit Places using invariants in 511 ms returned []
[2026-06-16 13:01:44] [INFO ] Invariant cache hit.
[2026-06-16 13:01:45] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:01:46] [INFO ] Implicit Places using invariants and state equation in 1531 ms returned []
Implicit Place search using SMT with State Equation took 2052 ms to find 0 implicit places.
[2026-06-16 13:01:46] [INFO ] Redundant transitions in 21 ms returned []
Running 241 sub problems to find dead transitions.
[2026-06-16 13:01:46] [INFO ] Invariant cache hit.
[2026-06-16 13:01:46] [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, 13/31 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 251/447 variables, 196/227 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 80/307 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/307 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 307 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30016 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: 13/13 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, 12/31 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 251/447 variables, 196/230 constraints. Problems are: Problem set: 0 solved, 241 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 9 (INCLUDED_ONLY) 0/447 variables, 80/310 constraints. Problems are: Problem set: 12 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 229/539 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 539 constraints, problems are : Problem set: 12 solved, 229 unsolved in 30020 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: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 12 solved, 229 unsolved
Search for dead transitions found 12 dead transitions in 60138ms
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/317 places, 239/364 transitions.
Applied a total of 0 rules in 17 ms. Remains 196 /196 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2026-06-16 13:02:46] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 62413 ms. Remains : 196/317 places, 239/364 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 366 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 549 ms.
Stack based approach found an accepted trace after 111 steps with 0 reset with depth 112 and stack size 112 in 2 ms.
FORMULA FileSystem-PT-N02I10B08-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N02I10B08-LTLCardinality-04 finished in 63475 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 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 364/364 transitions.
Graph (complete) has 766 edges and 317 vertex of which 310 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 0 output 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 11 place count 310 transition count 354
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 300 transition count 354
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 36 place count 285 transition count 339
Iterating global reduction 2 with 15 rules applied. Total rules applied 51 place count 285 transition count 339
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 227 place count 197 transition count 251
Applied a total of 227 rules in 68 ms. Remains 197 /317 variables (removed 120) and now considering 251/364 (removed 113) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16408398232899571631.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1069086388890956629.kers'
[2026-06-16 13:02:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16408398232899571631.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1069086388890956629.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 1 ms.
// Phase 1: matrix 251 rows 189 cols 833 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-06-16 13:02:47] [INFO ] Computed 18 invariants in 4 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1069086388890956629.kers
Total runtime 6 ms.
[2026-06-16 13:02:48] [INFO ] Implicit Places using invariants in 517 ms returned []
[2026-06-16 13:02:48] [INFO ] Invariant cache hit.
[2026-06-16 13:02:48] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:02:49] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1790 ms to find 0 implicit places.
[2026-06-16 13:02:49] [INFO ] Redundant transitions in 5 ms returned []
Running 241 sub problems to find dead transitions.
[2026-06-16 13:02:49] [INFO ] Invariant cache hit.
[2026-06-16 13:02:49] [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, 20/38 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 251/447 variables, 196/243 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 80/323 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/448 variables, and 323 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/197 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 29/29 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, 28/47 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 251/447 variables, 196/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD149 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 80/338 constraints. Problems are: Problem set: 12 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 218/556 constraints. Problems are: Problem set: 12 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/448 variables, and 556 constraints, problems are : Problem set: 12 solved, 229 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/197 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 218/241 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 12 solved, 229 unsolved
Search for dead transitions found 12 dead transitions in 60110ms
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 : 197/317 places, 239/364 transitions.
Applied a total of 0 rules in 12 ms. Remains 197 /197 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2026-06-16 13:03:49] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 62017 ms. Remains : 197/317 places, 239/364 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 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLCardinality-05
Product exploration explored 100000 steps with 3213 reset in 534 ms.
Product exploration explored 100000 steps with 3198 reset in 560 ms.
Computed a total of 29 stabilizing places and 79 stable transitions
Graph (complete) has 612 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 29 stabilizing places and 79 stable transitions
Detected a total of 29/197 stabilizing places and 79/239 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 149 steps (0 resets) in 7 ms. (18 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3170552904808951001.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1744137447894835002.kers'
[2026-06-16 13:03:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3170552904808951001.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1744137447894835002.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 239 rows 189 cols 785 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-06-16 13:03:51] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1744137447894835002.kers
Total runtime 4 ms.
[2026-06-16 13:03:51] [INFO ] [Real]Absence check using 18 positive place invariants in 425 ms returned sat
[2026-06-16 13:03:53] [INFO ] [Real]Absence check using state equation in 1982 ms returned sat
[2026-06-16 13:03:53] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 13:03:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 267 ms returned sat
[2026-06-16 13:03:56] [INFO ] [Nat]Absence check using state equation in 1857 ms returned sat
[2026-06-16 13:03:56] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:03:56] [INFO ] [Nat]Added 80 Read/Feed constraints in 105 ms returned sat
[2026-06-16 13:03:56] [INFO ] Computed and/alt/rep : 189/479/189 causal constraints (skipped 40 transitions) in 28 ms.
[2026-06-16 13:03:57] [INFO ] Added : 32 causal constraints over 7 iterations in 837 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 6440 ms.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 239/239 transitions.
Applied a total of 0 rules in 17 ms. Remains 197 /197 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2026-06-16 13:03:57] [INFO ] Invariant cache hit.
[2026-06-16 13:03:57] [INFO ] Implicit Places using invariants in 423 ms returned []
[2026-06-16 13:03:57] [INFO ] Invariant cache hit.
[2026-06-16 13:03:57] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:03:58] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
[2026-06-16 13:03:58] [INFO ] Redundant transitions in 3 ms returned []
Running 229 sub problems to find dead transitions.
[2026-06-16 13:03:58] [INFO ] Invariant cache hit.
[2026-06-16 13:03:58] [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, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 11/196 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/436 variables, and 76 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/197 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 11/196 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 239/435 variables, 196/287 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 80/367 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 218/585 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/436 variables, and 585 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 196/197 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 218/229 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61456 ms. Remains : 197/197 places, 239/239 transitions.
Computed a total of 29 stabilizing places and 79 stable transitions
Graph (complete) has 612 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 29 stabilizing places and 79 stable transitions
Detected a total of 29/197 stabilizing places and 79/239 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 101 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
[2026-06-16 13:04:59] [INFO ] Invariant cache hit.
[2026-06-16 13:04:59] [INFO ] [Real]Absence check using 18 positive place invariants in 456 ms returned sat
[2026-06-16 13:05:01] [INFO ] [Real]Absence check using state equation in 1967 ms returned sat
[2026-06-16 13:05:01] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 13:05:02] [INFO ] [Nat]Absence check using 18 positive place invariants in 262 ms returned sat
[2026-06-16 13:05:03] [INFO ] [Nat]Absence check using state equation in 1570 ms returned sat
[2026-06-16 13:05:03] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:05:03] [INFO ] [Nat]Added 80 Read/Feed constraints in 72 ms returned sat
[2026-06-16 13:05:04] [INFO ] Computed and/alt/rep : 189/479/189 causal constraints (skipped 40 transitions) in 17 ms.
[2026-06-16 13:05:04] [INFO ] Added : 32 causal constraints over 7 iterations in 687 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 5914 ms.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3225 reset in 310 ms.
Product exploration explored 100000 steps with 3230 reset in 343 ms.
Built C files in :
/tmp/ltsmin7595104180388115811
[2026-06-16 13:05:05] [INFO ] Computing symmetric may disable matrix : 239 transitions.
[2026-06-16 13:05:05] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:05:05] [INFO ] Computing symmetric may enable matrix : 239 transitions.
[2026-06-16 13:05:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:05:05] [INFO ] Computing Do-Not-Accords matrix : 239 transitions.
[2026-06-16 13:05:05] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:05:05] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7595104180388115811
Running compilation step : cd /tmp/ltsmin7595104180388115811;'/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 1514 ms.
Running link step : cd /tmp/ltsmin7595104180388115811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin7595104180388115811;'/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/stateBased8333712062535239718.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 239/239 transitions.
Applied a total of 0 rules in 16 ms. Remains 197 /197 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2026-06-16 13:05:20] [INFO ] Invariant cache hit.
[2026-06-16 13:05:21] [INFO ] Implicit Places using invariants in 454 ms returned []
[2026-06-16 13:05:21] [INFO ] Invariant cache hit.
[2026-06-16 13:05:21] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:05:21] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1391 ms to find 0 implicit places.
[2026-06-16 13:05:22] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1417 ms. Remains : 197/197 places, 239/239 transitions.
Built C files in :
/tmp/ltsmin9623025610017707130
[2026-06-16 13:05:22] [INFO ] Computing symmetric may disable matrix : 239 transitions.
[2026-06-16 13:05:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:05:22] [INFO ] Computing symmetric may enable matrix : 239 transitions.
[2026-06-16 13:05:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:05:22] [INFO ] Computing Do-Not-Accords matrix : 239 transitions.
[2026-06-16 13:05:22] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:05:22] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9623025610017707130
Running compilation step : cd /tmp/ltsmin9623025610017707130;'/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 1056 ms.
Running link step : cd /tmp/ltsmin9623025610017707130;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin9623025610017707130;'/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/stateBased10443948989632939554.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-16 13:05:37] [INFO ] Flatten gal took : 22 ms
[2026-06-16 13:05:37] [INFO ] Flatten gal took : 22 ms
[2026-06-16 13:05:37] [INFO ] Time to serialize gal into /tmp/LTL8380292343253012100.gal : 7 ms
[2026-06-16 13:05:37] [INFO ] Time to serialize properties into /tmp/LTL7319917956767338944.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8380292343253012100.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10379115965233423181.hoa' '-atoms' '/tmp/LTL7319917956767338944.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7319917956767338944.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10379115965233423181.hoa
Reverse transition relation is NOT exact ! Due to transitions t355, t180.t340, t181.t340, t182.t340, t183.t340, t184.t340, t185.t340, t186.t340, t187.t340,...1015
Detected timeout of ITS tools.
[2026-06-16 13:05:52] [INFO ] Flatten gal took : 34 ms
[2026-06-16 13:05:52] [INFO ] Flatten gal took : 29 ms
[2026-06-16 13:05:52] [INFO ] Time to serialize gal into /tmp/LTL779345140242724516.gal : 6 ms
[2026-06-16 13:05:52] [INFO ] Time to serialize properties into /tmp/LTL14470901202658295925.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL779345140242724516.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14470901202658295925.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(busy_18_20<=inode_5_12)"))))
Formula 0 simplified : FG!"(busy_18_20<=inode_5_12)"
Reverse transition relation is NOT exact ! Due to transitions t355, t180.t340, t181.t340, t182.t340, t183.t340, t184.t340, t185.t340, t186.t340, t187.t340,...1015
Detected timeout of ITS tools.
[2026-06-16 13:06:07] [INFO ] Flatten gal took : 16 ms
[2026-06-16 13:06:07] [INFO ] Applying decomposition
[2026-06-16 13:06:07] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3690634735224359042.txt' '-o' '/tmp/graph3690634735224359042.bin' '-w' '/tmp/graph3690634735224359042.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3690634735224359042.bin' '-l' '-1' '-v' '-w' '/tmp/graph3690634735224359042.weights' '-q' '0' '-e' '0.001'
[2026-06-16 13:06:07] [INFO ] Decomposing Gal with order
[2026-06-16 13:06:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 13:06:07] [INFO ] Removed a total of 72 redundant transitions.
[2026-06-16 13:06:07] [INFO ] Flatten gal took : 229 ms
[2026-06-16 13:06:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 12 ms.
[2026-06-16 13:06:07] [INFO ] Time to serialize gal into /tmp/LTL14761655345550024295.gal : 6 ms
[2026-06-16 13:06:07] [INFO ] Time to serialize properties into /tmp/LTL13287893420588263625.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14761655345550024295.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13287893420588263625.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu6.busy_18_20<=gu6.inode_5_12)"))))
Formula 0 simplified : FG!"(gu6.busy_18_20<=gu6.inode_5_12)"
Detected timeout of ITS tools.
Treatment of property FileSystem-PT-N02I10B08-LTLCardinality-05 finished in 215516 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&&G(F(p1))))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 364/364 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 309 transition count 364
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 24 place count 293 transition count 348
Iterating global reduction 1 with 16 rules applied. Total rules applied 40 place count 293 transition count 348
Applied a total of 40 rules in 13 ms. Remains 293 /317 variables (removed 24) and now considering 348/364 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11599677539450316756.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4771913215304916301.kers'
[2026-06-16 13:06:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11599677539450316756.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4771913215304916301.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:06:23] [INFO ] Computed 18 invariants in 7 ms
Computed 18 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-4771913215304916301.kers
Total runtime 8 ms.
[2026-06-16 13:06:23] [INFO ] Implicit Places using invariants in 536 ms returned []
[2026-06-16 13:06:23] [INFO ] Invariant cache hit.
[2026-06-16 13:06:23] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:06:24] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1592 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-06-16 13:06:24] [INFO ] Invariant cache hit.
[2026-06-16 13:06:24] [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 58 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: 40/40 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, 5/21 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 11/293 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 35/58 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 3/86 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 86 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30029 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: 68/68 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 293/317 places, 348/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61730 ms. Remains : 293/317 places, 348/364 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&&G(F(p1))))))'
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 210 ms.
Product exploration explored 100000 steps with 0 reset in 246 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 5 factoid took 85 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 379 ms. (105 steps per ms) remains 1/6 properties
BEST_FIRST walk for 30494 steps (7 resets) in 133 ms. (227 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 9 states, 22 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0), false, false]
[2026-06-16 13:07:26] [INFO ] Invariant cache hit.
[2026-06-16 13:07:27] [INFO ] [Real]Absence check using 18 positive place invariants in 808 ms returned sat
[2026-06-16 13:07:32] [INFO ] [Real]Absence check using state equation in 5101 ms returned unsat
Proved EG (NOT p0) asserting that LTL formula F !(NOT p0) is false.
Negative knowledge disproves property using: (F p0)
Knowledge-based reduction took 7158 ms.
FORMULA FileSystem-PT-N02I10B08-LTLCardinality-06 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property FileSystem-PT-N02I10B08-LTLCardinality-06 finished in 69718 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&&F(p1)))))'
Support contains 6 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 364/364 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 310 transition count 364
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 20 place count 297 transition count 351
Iterating global reduction 1 with 13 rules applied. Total rules applied 33 place count 297 transition count 351
Applied a total of 33 rules in 8 ms. Remains 297 /317 variables (removed 20) and now considering 351/364 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4958235924041404683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3197265143473189327.kers'
[2026-06-16 13:07:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4958235924041404683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3197265143473189327.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 351 rows 289 cols 964 entries
Finished phase 1 with 279 SingleSign rule and 0 generalized
[2026-06-16 13:07:32] [INFO ] Computed 18 invariants in 6 ms
Computed 18 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3197265143473189327.kers
Total runtime 7 ms.
[2026-06-16 13:07:33] [INFO ] Implicit Places using invariants in 799 ms returned []
[2026-06-16 13:07:33] [INFO ] Invariant cache hit.
[2026-06-16 13:07:33] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:07:35] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 2281 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2026-06-16 13:07:35] [INFO ] Invariant cache hit.
[2026-06-16 13:07:35] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 11/296 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 341 unsolved
SMT process timed out in 30309ms, After SMT, problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 30312ms
Starting structural reductions in LTL mode, iteration 1 : 297/317 places, 351/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32607 ms. Remains : 297/317 places, 351/364 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&&F(p1)))))'
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 227 ms.
Stack based approach found an accepted trace after 181 steps with 0 reset with depth 182 and stack size 182 in 1 ms.
FORMULA FileSystem-PT-N02I10B08-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N02I10B08-LTLCardinality-07 finished in 33047 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)||(!p0&&F(p1)))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 364/364 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 309 transition count 364
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 23 place count 294 transition count 349
Iterating global reduction 1 with 15 rules applied. Total rules applied 38 place count 294 transition count 349
Applied a total of 38 rules in 11 ms. Remains 294 /317 variables (removed 23) and now considering 349/364 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6141836149209942277.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15239258608863377823.kers'
[2026-06-16 13:08:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6141836149209942277.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15239258608863377823.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:08:05] [INFO ] Computed 18 invariants in 4 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15239258608863377823.kers
Total runtime 5 ms.
[2026-06-16 13:08:06] [INFO ] Implicit Places using invariants in 677 ms returned []
[2026-06-16 13:08:06] [INFO ] Invariant cache hit.
[2026-06-16 13:08:06] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:08:08] [INFO ] Implicit Places using invariants and state equation in 1848 ms returned []
Implicit Place search using SMT with State Equation took 2546 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-06-16 13:08:08] [INFO ] Invariant cache hit.
[2026-06-16 13:08:08] [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 30241ms, After SMT, problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 30243ms
Starting structural reductions in LTL mode, iteration 1 : 294/317 places, 349/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32803 ms. Remains : 294/317 places, 349/364 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)||(!p0&&F(p1)))))'
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 395 ms.
Product exploration explored 100000 steps with 50000 reset in 432 ms.
Computed a total of 46 stabilizing places and 109 stable transitions
Computed a total of 46 stabilizing places and 109 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 20 ms. Proved property starting from automaton with 5 states, 7 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 34 ms.
FORMULA FileSystem-PT-N02I10B08-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FileSystem-PT-N02I10B08-LTLCardinality-09 finished in 33933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 364/364 transitions.
Graph (complete) has 766 edges and 317 vertex of which 310 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 0 output 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 11 place count 310 transition count 354
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 300 transition count 354
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 36 place count 285 transition count 339
Iterating global reduction 2 with 15 rules applied. Total rules applied 51 place count 285 transition count 339
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 225 place count 198 transition count 252
Applied a total of 225 rules in 53 ms. Remains 198 /317 variables (removed 119) and now considering 252/364 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15260698710032088678.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3221710822301483446.kers'
[2026-06-16 13:08:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15260698710032088678.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3221710822301483446.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 252 rows 190 cols 835 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-06-16 13:08:39] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3221710822301483446.kers
Total runtime 4 ms.
[2026-06-16 13:08:40] [INFO ] Implicit Places using invariants in 526 ms returned []
[2026-06-16 13:08:40] [INFO ] Invariant cache hit.
[2026-06-16 13:08:40] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:08:41] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
[2026-06-16 13:08:41] [INFO ] Redundant transitions in 0 ms returned []
Running 242 sub problems to find dead transitions.
[2026-06-16 13:08:41] [INFO ] Invariant cache hit.
[2026-06-16 13:08:41] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 11/197 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 252/449 variables, 197/235 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 80/315 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 449/450 variables, and 315 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 197/198 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 11/197 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (OVERLAPS) 252/449 variables, 197/246 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 80/326 constraints. Problems are: Problem set: 12 solved, 230 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 219/545 constraints. Problems are: Problem set: 12 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/450 variables, and 545 constraints, problems are : Problem set: 12 solved, 230 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 197/198 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 219/242 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60076ms problems are : Problem set: 12 solved, 230 unsolved
Search for dead transitions found 12 dead transitions in 60078ms
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 : 198/317 places, 240/364 transitions.
Applied a total of 0 rules in 17 ms. Remains 198 /198 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2026-06-16 13:09:41] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61453 ms. Remains : 198/317 places, 240/364 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||p1)))))'
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 156 ms.
Product exploration explored 100000 steps with 0 reset in 272 ms.
Computed a total of 29 stabilizing places and 79 stable transitions
Graph (complete) has 614 edges and 198 vertex of which 197 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 29 stabilizing places and 79 stable transitions
Detected a total of 29/198 stabilizing places and 79/240 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 10 factoid took 84 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 284 ms. (140 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2970466800208827125.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13871692739031544090.kers'
[2026-06-16 13:09:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2970466800208827125.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13871692739031544090.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 240 rows 190 cols 787 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-06-16 13:09:41] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13871692739031544090.kers
Total runtime 5 ms.
[2026-06-16 13:09:41] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 180/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/198 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 438/438 variables, and 224 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 198/198 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1422ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 11 factoid took 110 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1)]
Knowledge-based reduction took 1870 ms.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2026-06-16 13:09:43] [INFO ] Invariant cache hit.
[2026-06-16 13:09:44] [INFO ] Implicit Places using invariants in 513 ms returned []
[2026-06-16 13:09:44] [INFO ] Invariant cache hit.
[2026-06-16 13:09:44] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:09:44] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
[2026-06-16 13:09:44] [INFO ] Redundant transitions in 1 ms returned []
Running 230 sub problems to find dead transitions.
[2026-06-16 13:09:44] [INFO ] Invariant cache hit.
[2026-06-16 13:09:44] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 11/197 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 240/437 variables, 197/231 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 80/311 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (OVERLAPS) 1/438 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 312 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 198/198 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 11/197 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 240/437 variables, 197/231 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 80/311 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 219/530 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/438 variables, and 530 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 197/198 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 219/230 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61304 ms. Remains : 198/198 places, 240/240 transitions.
Computed a total of 29 stabilizing places and 79 stable transitions
Graph (complete) has 614 edges and 198 vertex of which 197 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 29 stabilizing places and 79 stable transitions
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 23356 steps (5 resets) in 40 ms. (569 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Knowledge-based reduction took 213 ms.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 230 ms.
Product exploration explored 100000 steps with 0 reset in 272 ms.
Built C files in :
/tmp/ltsmin17871002411673087285
[2026-06-16 13:10:45] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2026-06-16 13:10:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:10:45] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2026-06-16 13:10:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:10:45] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2026-06-16 13:10:45] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:10:45] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17871002411673087285
Running compilation step : cd /tmp/ltsmin17871002411673087285;'/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 963 ms.
Running link step : cd /tmp/ltsmin17871002411673087285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin17871002411673087285;'/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/stateBased18311064766027966780.hoa' '--buchi-type=spotba'
LTSmin run took 440 ms.
FORMULA FileSystem-PT-N02I10B08-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FileSystem-PT-N02I10B08-LTLCardinality-10 finished in 127711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p0))&&F(G(p1))))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 364/364 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 309 transition count 364
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 23 place count 294 transition count 349
Iterating global reduction 1 with 15 rules applied. Total rules applied 38 place count 294 transition count 349
Applied a total of 38 rules in 11 ms. Remains 294 /317 variables (removed 23) and now considering 349/364 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16394198344654546224.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3890660748887187341.kers'
[2026-06-16 13:10:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16394198344654546224.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3890660748887187341.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:10:47] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3890660748887187341.kers
Total runtime 4 ms.
[2026-06-16 13:10:48] [INFO ] Implicit Places using invariants in 668 ms returned []
[2026-06-16 13:10:48] [INFO ] Invariant cache hit.
[2026-06-16 13:10:48] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:10:49] [INFO ] Implicit Places using invariants and state equation in 1312 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-06-16 13:10:49] [INFO ] Invariant cache hit.
[2026-06-16 13:10: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
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 294/643 variables, and 60 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/294 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
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, 7/23 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (OVERLAPS) 11/294 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 35/60 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 294/643 variables, and 97 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/294 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 0/339 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in LTL mode, iteration 1 : 294/317 places, 349/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62088 ms. Remains : 294/317 places, 349/364 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p0))&&F(G(p1))))'
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 209 ms.
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FileSystem-PT-N02I10B08-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FileSystem-PT-N02I10B08-LTLCardinality-12 finished in 62563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U ((p1&&X(X(p0))&&F(p2))||X(X(G(p0)))))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 364/364 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 310 transition count 364
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 20 place count 297 transition count 351
Iterating global reduction 1 with 13 rules applied. Total rules applied 33 place count 297 transition count 351
Applied a total of 33 rules in 11 ms. Remains 297 /317 variables (removed 20) and now considering 351/364 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9431352207226446513.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11033918819638696572.kers'
[2026-06-16 13:11:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9431352207226446513.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11033918819638696572.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 351 rows 289 cols 964 entries
Finished phase 1 with 279 SingleSign rule and 0 generalized
[2026-06-16 13:11:50] [INFO ] Computed 18 invariants in 5 ms
Computed 18 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11033918819638696572.kers
Total runtime 7 ms.
[2026-06-16 13:11:50] [INFO ] Implicit Places using invariants in 640 ms returned []
[2026-06-16 13:11:50] [INFO ] Invariant cache hit.
[2026-06-16 13:11:51] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:11:52] [INFO ] Implicit Places using invariants and state equation in 1526 ms returned []
Implicit Place search using SMT with State Equation took 2169 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2026-06-16 13:11:52] [INFO ] Invariant cache hit.
[2026-06-16 13:11:52] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 11/296 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/648 variables, and 56 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/297 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (OVERLAPS) 11/296 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 31/56 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 341 unsolved
SMT process timed out in 60147ms, After SMT, problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 297/317 places, 351/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62330 ms. Remains : 297/317 places, 351/364 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U (X(X(G(p0)))||(p1&&X(X(p0))&&F(p2))))))'
Stuttering acceptance computed with spot in 448 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 316 ms.
Stack based approach found an accepted trace after 131 steps with 0 reset with depth 132 and stack size 132 in 1 ms.
FORMULA FileSystem-PT-N02I10B08-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N02I10B08-LTLCardinality-13 finished in 63189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 364/364 transitions.
Graph (complete) has 766 edges and 317 vertex of which 309 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output 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 11 place count 309 transition count 354
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 299 transition count 354
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 37 place count 283 transition count 338
Iterating global reduction 2 with 16 rules applied. Total rules applied 53 place count 283 transition count 338
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 223 place count 198 transition count 253
Applied a total of 223 rules in 44 ms. Remains 198 /317 variables (removed 119) and now considering 253/364 (removed 111) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14631617147163842811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14172978585522369182.kers'
[2026-06-16 13:12:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14631617147163842811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14172978585522369182.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 253 rows 190 cols 836 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-06-16 13:12:53] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14172978585522369182.kers
Total runtime 4 ms.
[2026-06-16 13:12:53] [INFO ] Implicit Places using invariants in 543 ms returned []
[2026-06-16 13:12:53] [INFO ] Invariant cache hit.
[2026-06-16 13:12:54] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:12:54] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 1625 ms to find 0 implicit places.
[2026-06-16 13:12:54] [INFO ] Redundant transitions in 0 ms returned []
Running 243 sub problems to find dead transitions.
[2026-06-16 13:12:54] [INFO ] Invariant cache hit.
[2026-06-16 13:12:54] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 11/198 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 253/451 variables, 198/236 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 80/316 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 451/451 variables, and 316 constraints, problems are : Problem set: 0 solved, 243 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 198/198 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 243/243 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 11/198 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 253/451 variables, 198/236 constraints. Problems are: Problem set: 0 solved, 243 unsolved
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 80/316 constraints. Problems are: Problem set: 12 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 231/547 constraints. Problems are: Problem set: 12 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 547 constraints, problems are : Problem set: 12 solved, 231 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 198/198 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 231/243 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 12 solved, 231 unsolved
Search for dead transitions found 12 dead transitions in 60090ms
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 : 198/317 places, 241/364 transitions.
Applied a total of 0 rules in 11 ms. Remains 198 /198 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2026-06-16 13:13:54] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61807 ms. Remains : 198/317 places, 241/364 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : FileSystem-PT-N02I10B08-LTLCardinality-14
Product exploration explored 100000 steps with 0 reset in 304 ms.
Stack based approach found an accepted trace after 109 steps with 0 reset with depth 110 and stack size 110 in 1 ms.
FORMULA FileSystem-PT-N02I10B08-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N02I10B08-LTLCardinality-14 finished in 62292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(X(X(X(G(p0)))))||G(p1))))))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 364/364 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 309 transition count 364
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 24 place count 293 transition count 348
Iterating global reduction 1 with 16 rules applied. Total rules applied 40 place count 293 transition count 348
Applied a total of 40 rules in 11 ms. Remains 293 /317 variables (removed 24) and now considering 348/364 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5075088844668692300.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18273411941371410107.kers'
[2026-06-16 13:13:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5075088844668692300.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18273411941371410107.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:13:55] [INFO ] Computed 18 invariants in 4 ms
Computed 18 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-18273411941371410107.kers
Total runtime 6 ms.
[2026-06-16 13:13:56] [INFO ] Implicit Places using invariants in 583 ms returned []
[2026-06-16 13:13:56] [INFO ] Invariant cache hit.
[2026-06-16 13:13:56] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:13:57] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 1972 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-06-16 13:13:57] [INFO ] Invariant cache hit.
[2026-06-16 13:13:57] [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
SMT process timed out in 30213ms, After SMT, problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 30215ms
Starting structural reductions in LTL mode, iteration 1 : 293/317 places, 348/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32200 ms. Remains : 293/317 places, 348/364 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(X(X(X(G(p0)))))||G(p1))))))'
Stuttering acceptance computed with spot in 696 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (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-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 214 ms.
Product exploration explored 100000 steps with 0 reset in 242 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 1 factoid took 89 ms. Reduced automaton from 14 states, 23 edges and 2 AP (stutter sensitive) to 14 states, 23 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 362 ms. (110 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
[2026-06-16 13:14:29] [INFO ] Invariant cache hit.
[2026-06-16 13:14:29] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 275/278 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/293 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 348/641 variables, 293/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 80/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/641 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 391 constraints, problems are : Problem set: 0 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 293/293 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 275/278 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/293 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 348/641 variables, 293/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 80/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/641 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2768 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 293/293 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3225ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 3 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 348/348 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 293 transition count 338
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 283 transition count 338
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 190 place count 198 transition count 253
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 268 place count 198 transition count 175
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 2 with 83 rules applied. Total rules applied 351 place count 115 transition count 175
Applied a total of 351 rules in 48 ms. Remains 115 /293 variables (removed 178) and now considering 175/348 (removed 173) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 115/293 places, 175/348 transitions.
RANDOM walk for 40000 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17033 steps, run visited all 1 properties in 59 ms. (steps per millisecond=288 )
Probabilistic random walk after 17033 steps, saw 5416 distinct states, run finished after 68 ms. (steps per millisecond=250 ) properties seen :1
Knowledge based reduction with 1 factoid took 186 ms. Reduced automaton from 14 states, 23 edges and 2 AP (stutter sensitive) to 14 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 713 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (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))]
Knowledge-based reduction took 4615 ms.
Stuttering acceptance computed with spot in 685 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (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))]
Support contains 3 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 10 ms. Remains 293 /293 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2026-06-16 13:14:34] [INFO ] Invariant cache hit.
[2026-06-16 13:14:34] [INFO ] Implicit Places using invariants in 655 ms returned []
[2026-06-16 13:14:34] [INFO ] Invariant cache hit.
[2026-06-16 13:14:35] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:14:36] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 2102 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2112 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 1 factoid took 97 ms. Reduced automaton from 14 states, 23 edges and 2 AP (stutter sensitive) to 14 states, 23 edges and 2 AP (stutter sensitive).
RANDOM walk for 37196 steps (8 resets) in 204 ms. (181 steps per ms) remains 0/6 properties
Knowledge based reduction with 1 factoid took 182 ms. Reduced automaton from 14 states, 23 edges and 2 AP (stutter sensitive) to 14 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 719 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (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))]
Knowledge-based reduction took 1091 ms.
Stuttering acceptance computed with spot in 687 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (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))]
Stuttering acceptance computed with spot in 699 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (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))]
Product exploration explored 100000 steps with 0 reset in 219 ms.
Product exploration explored 100000 steps with 0 reset in 243 ms.
Spot run failed in 294 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14086414789086439937
[2026-06-16 13:14:39] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14086414789086439937
Running compilation step : cd /tmp/ltsmin14086414789086439937;'/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 970 ms.
Running link step : cd /tmp/ltsmin14086414789086439937;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14086414789086439937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased9054459504292011924.hoa' '--buchi-type=spotba'
LTSmin run took 2494 ms.
FORMULA FileSystem-PT-N02I10B08-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FileSystem-PT-N02I10B08-LTLCardinality-15 finished in 47639 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)))'
Spot run failed in 79 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-06-16 13:14:43] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11773629952627641636
[2026-06-16 13:14:43] [INFO ] Computing symmetric may disable matrix : 364 transitions.
[2026-06-16 13:14:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:14:43] [INFO ] Computing symmetric may enable matrix : 364 transitions.
[2026-06-16 13:14:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:14:43] [INFO ] Applying decomposition
[2026-06-16 13:14:43] [INFO ] Computing Do-Not-Accords matrix : 364 transitions.
[2026-06-16 13:14:43] [INFO ] Flatten gal took : 25 ms
[2026-06-16 13:14:43] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 13:14:43] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11773629952627641636
Running compilation step : cd /tmp/ltsmin11773629952627641636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17511753596875839140.txt' '-o' '/tmp/graph17511753596875839140.bin' '-w' '/tmp/graph17511753596875839140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17511753596875839140.bin' '-l' '-1' '-v' '-w' '/tmp/graph17511753596875839140.weights' '-q' '0' '-e' '0.001'
[2026-06-16 13:14:43] [INFO ] Decomposing Gal with order
[2026-06-16 13:14:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 13:14:43] [INFO ] Removed a total of 311 redundant transitions.
[2026-06-16 13:14:43] [INFO ] Flatten gal took : 107 ms
[2026-06-16 13:14:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 52 ms.
[2026-06-16 13:14:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality7821520790971817773.gal : 19 ms
[2026-06-16 13:14:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality16649027819203674432.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7821520790971817773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16649027819203674432.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu55.busy_18_20<=gu55.inode_5_12)"))))
Formula 0 simplified : FG!"(gu55.busy_18_20<=gu55.inode_5_12)"
Compilation finished in 1475 ms.
Running link step : cd /tmp/ltsmin11773629952627641636;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11773629952627641636;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gi0.t189, gi0.gi0.gi0.t187, gi0.gi0.gi0.t186, gi0.gi0.gi0.t185, gi0.gi0.gi0.t184, gi0...1382
174 unique states visited
0 strongly connected components in search stack
174 transitions explored
88 items max in DFS search stack
15525 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,155.357,2223832,1,0,645,6.04361e+06,23,322,5085,6.35869e+06,1306
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FileSystem-PT-N02I10B08-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
LTSmin run took 157279 ms.
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1015905 ms.

BK_STOP 1781615842308

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FileSystem-PT-N02I10B08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r338-smll-178021499300411"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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