Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961073900084.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 FunctionPointer-PT-b016, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961073900084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 6.0K Mar 7 07:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 7 07:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 07:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 07:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 07:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 7 07:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 07:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Mar 7 07:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 391K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779672221228

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 01:23:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 01:23:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 01:23:42] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2026-05-25 01:23:42] [INFO ] Transformed 306 places.
[2026-05-25 01:23:42] [INFO ] Transformed 840 transitions.
[2026-05-25 01:23:42] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b016-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 36 place count 186 transition count 508
Iterating global reduction 1 with 26 rules applied. Total rules applied 62 place count 186 transition count 508
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 98 place count 186 transition count 472
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 110 place count 174 transition count 448
Iterating global reduction 2 with 12 rules applied. Total rules applied 122 place count 174 transition count 448
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 128 place count 168 transition count 436
Iterating global reduction 2 with 6 rules applied. Total rules applied 134 place count 168 transition count 436
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 138 place count 164 transition count 420
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 164 transition count 420
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 146 place count 160 transition count 412
Iterating global reduction 2 with 4 rules applied. Total rules applied 150 place count 160 transition count 412
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 152 place count 158 transition count 404
Iterating global reduction 2 with 2 rules applied. Total rules applied 154 place count 158 transition count 404
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 156 place count 156 transition count 396
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 156 transition count 396
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 160 place count 154 transition count 392
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 154 transition count 392
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 164 place count 152 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 152 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 168 place count 150 transition count 384
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 150 transition count 384
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 172 place count 148 transition count 380
Iterating global reduction 2 with 2 rules applied. Total rules applied 174 place count 148 transition count 380
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 176 place count 146 transition count 376
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 146 transition count 376
Applied a total of 178 rules in 118 ms. Remains 146 /222 variables (removed 76) and now considering 376/648 (removed 272) transitions.
[2026-05-25 01:23:42] [INFO ] Flow matrix only has 253 transitions (discarded 123 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8021896851109404192.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17119473382822687753.kers'
[2026-05-25 01:23:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8021896851109404192.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17119473382822687753.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 253 rows 146 cols 694 entries
Finished phase 1 with 143 SingleSign rule and 1 generalized
[2026-05-25 01:23:42] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17119473382822687753.kers
Total runtime 1 ms.
[2026-05-25 01:23:43] [INFO ] Implicit Places using invariants in 246 ms returned []
[2026-05-25 01:23:43] [INFO ] Flow matrix only has 253 transitions (discarded 123 similar events)
[2026-05-25 01:23:43] [INFO ] Invariant cache hit.
[2026-05-25 01:23:43] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 01:23:43] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2026-05-25 01:23:43] [INFO ] Flow matrix only has 253 transitions (discarded 123 similar events)
[2026-05-25 01:23:43] [INFO ] Invariant cache hit.
[2026-05-25 01:23:43] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (OVERLAPS) 253/399 variables, 146/148 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 53/201 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 374 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/399 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 374 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 201 constraints, problems are : Problem set: 0 solved, 374 unsolved in 13217 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (OVERLAPS) 253/399 variables, 146/148 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 53/201 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 374/575 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 3/578 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 579 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 43545ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 43558ms
Starting structural reductions in LTL mode, iteration 1 : 146/222 places, 376/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44233 ms. Remains : 146/222 places, 376/648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 376/376 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2026-05-25 01:24:26] [INFO ] Flow matrix only has 253 transitions (discarded 123 similar events)
[2026-05-25 01:24:26] [INFO ] Invariant cache hit.
[2026-05-25 01:24:26] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 01:24:26] [INFO ] Flow matrix only has 253 transitions (discarded 123 similar events)
[2026-05-25 01:24:26] [INFO ] Invariant cache hit.
[2026-05-25 01:24:27] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 01:24:27] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 279 ms. Remains : 146/146 places, 376/376 transitions.
Support contains 21 out of 146 places after structural reductions.
[2026-05-25 01:24:27] [INFO ] Flatten gal took : 44 ms
[2026-05-25 01:24:27] [INFO ] Flatten gal took : 23 ms
[2026-05-25 01:24:27] [INFO ] Input system was already deterministic with 376 transitions.
RANDOM walk for 40022 steps (35 resets) in 935 ms. (42 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40004 steps (9 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
[2026-05-25 01:24:27] [INFO ] Flow matrix only has 253 transitions (discarded 123 similar events)
[2026-05-25 01:24:27] [INFO ] Invariant cache hit.
[2026-05-25 01:24:27] [INFO ] State equation strengthened by 53 read => feed constraints.
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) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/181 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 175/356 variables, 65/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 39/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/357 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 42/399 variables, 30/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/399 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, ReadFeed: 53/53 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) 47/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/181 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 175/356 variables, 65/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 39/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/357 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 42/399 variables, 30/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/399 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/399 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/399 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 146/146 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 597ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 376/376 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 140 transition count 352
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 140 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 140 transition count 348
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 133 transition count 332
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 133 transition count 332
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 34 place count 133 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 128 transition count 310
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 128 transition count 310
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 123 transition count 294
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 123 transition count 294
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 118 transition count 282
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 113 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 113 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 108 transition count 260
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 108 transition count 260
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 104 transition count 252
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 104 transition count 252
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 96 place count 100 transition count 244
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 99 transition count 242
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 98 transition count 240
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 98 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 98 transition count 238
Applied a total of 106 rules in 64 ms. Remains 98 /146 variables (removed 48) and now considering 238/376 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 98/146 places, 238/376 transitions.
RANDOM walk for 40013 steps (76 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39717 steps (8 resets) in 66 ms. (592 steps per ms) remains 0/1 properties
FORMULA FunctionPointer-PT-b016-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(!p0))||(F(!p0)&&X(X(!p1))))) U X(p2)))'
Support contains 6 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 376/376 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 140 transition count 350
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 140 transition count 350
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 140 transition count 346
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 134 transition count 332
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 134 transition count 332
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 134 transition count 328
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 130 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 130 transition count 314
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 126 transition count 300
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 126 transition count 300
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 122 transition count 292
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 122 transition count 292
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 118 transition count 284
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 118 transition count 284
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 114 transition count 276
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 114 transition count 276
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 111 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 111 transition count 270
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 108 transition count 264
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 108 transition count 264
Applied a total of 84 rules in 17 ms. Remains 108 /146 variables (removed 38) and now considering 264/376 (removed 112) transitions.
[2026-05-25 01:24:28] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17817697815030883717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7032777794453113559.kers'
[2026-05-25 01:24:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17817697815030883717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7032777794453113559.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 108 cols 498 entries
Finished phase 1 with 105 SingleSign rule and 1 generalized
[2026-05-25 01:24:28] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7032777794453113559.kers
Total runtime 1 ms.
[2026-05-25 01:24:28] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 01:24:28] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
[2026-05-25 01:24:28] [INFO ] Invariant cache hit.
[2026-05-25 01:24:28] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-25 01:24:29] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2026-05-25 01:24:29] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
[2026-05-25 01:24:29] [INFO ] Invariant cache hit.
[2026-05-25 01:24:29] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 179/287 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 262 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 151 constraints, problems are : Problem set: 0 solved, 262 unsolved in 6745 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 179/287 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 262/413 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 413 constraints, problems are : Problem set: 0 solved, 262 unsolved in 23711 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30539ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 30540ms
Starting structural reductions in LTL mode, iteration 1 : 108/146 places, 264/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30793 ms. Remains : 108/146 places, 264/376 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(!p0))||(F(!p0)&&X(X(!p1))))) U X(p2)))'
Stuttering acceptance computed with spot in 352 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p2)), (AND p1 p0), (AND p0 p1), p0]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-05
Stuttering criterion allowed to conclude after 82979 steps with 20701 reset in 226 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-05 finished in 31469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 376/376 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 141 transition count 356
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 141 transition count 356
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 141 transition count 352
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 136 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 136 transition count 340
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 28 place count 136 transition count 336
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 133 transition count 326
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 133 transition count 326
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 130 transition count 318
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 130 transition count 318
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 127 transition count 310
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 127 transition count 310
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 124 transition count 302
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 124 transition count 302
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 121 transition count 296
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 121 transition count 296
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 119 transition count 292
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 119 transition count 292
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 117 transition count 288
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 117 transition count 288
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 116 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 116 transition count 286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 115 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 115 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 115 transition count 278
Applied a total of 76 rules in 54 ms. Remains 115 /146 variables (removed 31) and now considering 278/376 (removed 98) transitions.
[2026-05-25 01:25:00] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8329029351506841419.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7188453887399325086.kers'
[2026-05-25 01:25:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8329029351506841419.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7188453887399325086.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 115 cols 530 entries
Finished phase 1 with 112 SingleSign rule and 1 generalized
[2026-05-25 01:25:00] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7188453887399325086.kers
Total runtime 2 ms.
[2026-05-25 01:25:00] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 01:25:00] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
[2026-05-25 01:25:00] [INFO ] Invariant cache hit.
[2026-05-25 01:25:00] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 01:25:00] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2026-05-25 01:25:00] [INFO ] Redundant transitions in 18 ms returned []
Running 276 sub problems to find dead transitions.
[2026-05-25 01:25:00] [INFO ] Flow matrix only has 190 transitions (discarded 88 similar events)
[2026-05-25 01:25:00] [INFO ] Invariant cache hit.
[2026-05-25 01:25:00] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 190/305 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/305 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 160 constraints, problems are : Problem set: 0 solved, 276 unsolved in 7264 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 190/305 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 276/436 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/305 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 436 constraints, problems are : Problem set: 0 solved, 276 unsolved in 25225 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32560ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 32563ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/146 places, 278/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32891 ms. Remains : 115/146 places, 278/376 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-06
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-06 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(F(!p0))||(F(!p1)&&X((F(!p0)&&F(!p2)))))))'
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 376/376 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 139 transition count 348
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 139 transition count 348
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 139 transition count 344
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 132 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 132 transition count 328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 132 transition count 324
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 40 place count 128 transition count 310
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 128 transition count 310
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 124 transition count 298
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 124 transition count 298
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 120 transition count 288
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 116 transition count 278
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 116 transition count 278
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 112 transition count 270
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 112 transition count 270
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 110 transition count 266
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 110 transition count 266
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 108 transition count 262
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 108 transition count 262
Applied a total of 84 rules in 14 ms. Remains 108 /146 variables (removed 38) and now considering 262/376 (removed 114) transitions.
[2026-05-25 01:25:33] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12156407252877225903.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6665277435091922058.kers'
[2026-05-25 01:25:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12156407252877225903.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6665277435091922058.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 108 cols 496 entries
Finished phase 1 with 105 SingleSign rule and 1 generalized
[2026-05-25 01:25:33] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6665277435091922058.kers
Total runtime 0 ms.
[2026-05-25 01:25:33] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 01:25:33] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2026-05-25 01:25:33] [INFO ] Invariant cache hit.
[2026-05-25 01:25:33] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 01:25:33] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-25 01:25:33] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2026-05-25 01:25:33] [INFO ] Invariant cache hit.
[2026-05-25 01:25:33] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/287 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 43/153 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 153 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6767 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/287 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 43/153 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 260/413 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/287 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 414 constraints, problems are : Problem set: 0 solved, 260 unsolved in 29475 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36318ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 36319ms
Starting structural reductions in LTL mode, iteration 1 : 108/146 places, 262/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36621 ms. Remains : 108/146 places, 262/376 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(F(p0))||(F(p1)&&X((F(p0)&&F(p2)))))))'
Stuttering acceptance computed with spot in 330 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 152 ms.
Product exploration explored 100000 steps with 33333 reset in 235 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 11 ms. Proved property starting from automaton with 8 states, 13 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 27 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b016-LTLFireability-08 finished in 37407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(p1)))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 376/376 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 139 transition count 348
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 139 transition count 348
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 139 transition count 344
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 132 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 132 transition count 328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 132 transition count 324
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 41 place count 127 transition count 306
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 127 transition count 306
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 122 transition count 290
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 117 transition count 278
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 117 transition count 278
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 112 transition count 266
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 112 transition count 266
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 107 transition count 256
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 107 transition count 256
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 103 transition count 248
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 103 transition count 248
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 99 transition count 240
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 98 transition count 238
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 97 transition count 236
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 97 transition count 236
Applied a total of 106 rules in 10 ms. Remains 97 /146 variables (removed 49) and now considering 236/376 (removed 140) transitions.
[2026-05-25 01:26:10] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10290690909623743052.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15067000956085975121.kers'
[2026-05-25 01:26:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10290690909623743052.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15067000956085975121.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 159 rows 97 cols 440 entries
Finished phase 1 with 94 SingleSign rule and 1 generalized
[2026-05-25 01:26:10] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15067000956085975121.kers
Total runtime 1 ms.
[2026-05-25 01:26:10] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 01:26:10] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2026-05-25 01:26:10] [INFO ] Invariant cache hit.
[2026-05-25 01:26:10] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 01:26:10] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2026-05-25 01:26:10] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2026-05-25 01:26:10] [INFO ] Invariant cache hit.
[2026-05-25 01:26:10] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 5532 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 372 constraints, problems are : Problem set: 0 solved, 234 unsolved in 27404 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 32994ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 32995ms
Starting structural reductions in LTL mode, iteration 1 : 97/146 places, 236/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33193 ms. Remains : 97/146 places, 236/376 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||p1)))'
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-10 finished in 33363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 376/376 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 141 transition count 360
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 141 transition count 360
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 141 transition count 354
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 136 transition count 344
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 136 transition count 344
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 34 place count 136 transition count 336
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 133 transition count 324
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 133 transition count 324
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 130 transition count 314
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 130 transition count 314
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 127 transition count 306
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 127 transition count 306
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 124 transition count 298
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 124 transition count 298
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 121 transition count 292
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 121 transition count 292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 118 transition count 286
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 118 transition count 286
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 115 transition count 280
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 115 transition count 280
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 114 transition count 278
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 114 transition count 278
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 113 transition count 276
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 113 transition count 276
Applied a total of 80 rules in 14 ms. Remains 113 /146 variables (removed 33) and now considering 276/376 (removed 100) transitions.
[2026-05-25 01:26:44] [INFO ] Flow matrix only has 187 transitions (discarded 89 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5640280793125650541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7252405570604542202.kers'
[2026-05-25 01:26:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5640280793125650541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7252405570604542202.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 187 rows 113 cols 516 entries
Finished phase 1 with 110 SingleSign rule and 1 generalized
[2026-05-25 01:26:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7252405570604542202.kers
Total runtime 1 ms.
[2026-05-25 01:26:44] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 01:26:44] [INFO ] Flow matrix only has 187 transitions (discarded 89 similar events)
[2026-05-25 01:26:44] [INFO ] Invariant cache hit.
[2026-05-25 01:26:44] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 01:26:44] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2026-05-25 01:26:44] [INFO ] Flow matrix only has 187 transitions (discarded 89 similar events)
[2026-05-25 01:26:44] [INFO ] Invariant cache hit.
[2026-05-25 01:26:44] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 187/300 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 43/158 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 274 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/300 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 158 constraints, problems are : Problem set: 0 solved, 274 unsolved in 7207 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 187/300 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 43/158 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 274/432 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 432 constraints, problems are : Problem set: 0 solved, 274 unsolved in 24630 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31909ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 31910ms
Starting structural reductions in LTL mode, iteration 1 : 113/146 places, 276/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32215 ms. Remains : 113/146 places, 276/376 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-12 finished in 32426 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(p1)&&p0)))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 376/376 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 140 transition count 350
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 140 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 140 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 135 transition count 336
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 135 transition count 336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 130 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 130 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 125 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 125 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 120 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 120 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 115 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 115 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 110 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 110 transition count 268
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 106 transition count 260
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 106 transition count 260
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 102 transition count 252
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 102 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 101 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 101 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 100 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 100 transition count 248
Applied a total of 94 rules in 18 ms. Remains 100 /146 variables (removed 46) and now considering 248/376 (removed 128) transitions.
[2026-05-25 01:27:16] [INFO ] Flow matrix only has 165 transitions (discarded 83 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9424947214792706862.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6035813777373949580.kers'
[2026-05-25 01:27:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9424947214792706862.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6035813777373949580.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 100 cols 452 entries
Finished phase 1 with 97 SingleSign rule and 1 generalized
[2026-05-25 01:27:16] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6035813777373949580.kers
Total runtime 1 ms.
[2026-05-25 01:27:16] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 01:27:16] [INFO ] Flow matrix only has 165 transitions (discarded 83 similar events)
[2026-05-25 01:27:16] [INFO ] Invariant cache hit.
[2026-05-25 01:27:16] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 01:27:16] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2026-05-25 01:27:16] [INFO ] Flow matrix only has 165 transitions (discarded 83 similar events)
[2026-05-25 01:27:16] [INFO ] Invariant cache hit.
[2026-05-25 01:27:16] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 165/265 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 246 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 139 constraints, problems are : Problem set: 0 solved, 246 unsolved in 5593 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 165/265 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 37/139 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 246/385 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 385 constraints, problems are : Problem set: 0 solved, 246 unsolved in 22212 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27854ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 27856ms
Starting structural reductions in LTL mode, iteration 1 : 100/146 places, 248/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28145 ms. Remains : 100/146 places, 248/376 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(p1)&&p0)))'
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-13 finished in 28306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(!p1)))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 376/376 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 140 transition count 352
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 140 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 140 transition count 348
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 133 transition count 332
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 133 transition count 332
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 34 place count 133 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 128 transition count 310
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 128 transition count 310
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 123 transition count 294
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 123 transition count 294
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 118 transition count 282
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 113 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 113 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 108 transition count 260
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 108 transition count 260
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 104 transition count 252
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 104 transition count 252
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 96 place count 100 transition count 244
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 99 transition count 242
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 98 transition count 240
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 98 transition count 240
Applied a total of 104 rules in 14 ms. Remains 98 /146 variables (removed 48) and now considering 240/376 (removed 136) transitions.
[2026-05-25 01:27:44] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-564611349490033293.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7949138238663229527.kers'
[2026-05-25 01:27:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-564611349490033293.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7949138238663229527.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 161 rows 98 cols 444 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-25 01:27:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7949138238663229527.kers
Total runtime 0 ms.
[2026-05-25 01:27:44] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 01:27:44] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2026-05-25 01:27:44] [INFO ] Invariant cache hit.
[2026-05-25 01:27:44] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 01:27:45] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2026-05-25 01:27:45] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2026-05-25 01:27:45] [INFO ] Invariant cache hit.
[2026-05-25 01:27:45] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 5607 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 0/259 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/259 variables, and 378 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 35673ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 35674ms
Starting structural reductions in LTL mode, iteration 1 : 98/146 places, 240/376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35946 ms. Remains : 98/146 places, 240/376 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(!p1)))))'
Stuttering acceptance computed with spot in 335 ms :[p1, p1, p1, p1, p1, true, p1, p1, (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-15
Product exploration explored 100000 steps with 25000 reset in 161 ms.
Product exploration explored 100000 steps with 25000 reset in 161 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge based reduction with 3 factoid took 361 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 14695 steps (12 resets) in 40 ms. (358 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 43 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[p1, p1, p1, p1, true]
Knowledge-based reduction took 576 ms.
Stuttering acceptance computed with spot in 158 ms :[p1, p1, p1, p1, true]
Support contains 2 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2026-05-25 01:28:22] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2026-05-25 01:28:22] [INFO ] Invariant cache hit.
[2026-05-25 01:28:22] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 01:28:22] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2026-05-25 01:28:22] [INFO ] Invariant cache hit.
[2026-05-25 01:28:22] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 01:28:22] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 98/98 places, 240/240 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge based reduction with 1 factoid took 46 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 24267 steps (31 resets) in 57 ms. (418 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 56 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[p1, p1, p1, p1, true]
Knowledge-based reduction took 289 ms.
Stuttering acceptance computed with spot in 174 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 172 ms :[p1, p1, p1, p1, true]
Product exploration explored 100000 steps with 25000 reset in 121 ms.
Product exploration explored 100000 steps with 25000 reset in 124 ms.
Spot run failed in 72 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/ltsmin3806944995378461653
[2026-05-25 01:28:23] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3806944995378461653
Running compilation step : cd /tmp/ltsmin3806944995378461653;'/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 454 ms.
Running link step : cd /tmp/ltsmin3806944995378461653;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin3806944995378461653;'/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/stateBased1518033233476787594.hoa' '--buchi-type=spotba'
LTSmin run took 42 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-b016-LTLFireability-15 finished in 39222 ms.
All properties solved by simple procedures.
Total runtime 281700 ms.

BK_STOP 1779672504021

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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