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-177961074000156.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-c064, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074000156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.0K Mar 7 07:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 7 07:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 07:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 07:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 07:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Mar 7 07:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 07:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 7 07:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:26 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 4.2M 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-c064-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c064-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779701342900

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-c064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 09:29:04] [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 09:29:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:29:04] [INFO ] Load time of PNML (sax parser for PT used): 377 ms
[2026-05-25 09:29:04] [INFO ] Transformed 2826 places.
[2026-05-25 09:29:04] [INFO ] Transformed 8960 transitions.
[2026-05-25 09:29:04] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 515 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1198 places in 41 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA FunctionPointer-PT-c064-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 296 places :
Symmetric choice reduction at 1 with 296 rule applications. Total rules 313 place count 1315 transition count 3720
Iterating global reduction 1 with 296 rules applied. Total rules applied 609 place count 1315 transition count 3720
Ensure Unique test removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Iterating post reduction 1 with 380 rules applied. Total rules applied 989 place count 1315 transition count 3340
Discarding 153 places :
Symmetric choice reduction at 2 with 153 rule applications. Total rules 1142 place count 1162 transition count 3034
Iterating global reduction 2 with 153 rules applied. Total rules applied 1295 place count 1162 transition count 3034
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 1367 place count 1162 transition count 2962
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1381 place count 1148 transition count 2934
Iterating global reduction 3 with 14 rules applied. Total rules applied 1395 place count 1148 transition count 2934
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1408 place count 1135 transition count 2908
Iterating global reduction 3 with 13 rules applied. Total rules applied 1421 place count 1135 transition count 2908
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1434 place count 1122 transition count 2882
Iterating global reduction 3 with 13 rules applied. Total rules applied 1447 place count 1122 transition count 2882
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1460 place count 1109 transition count 2856
Iterating global reduction 3 with 13 rules applied. Total rules applied 1473 place count 1109 transition count 2856
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1486 place count 1096 transition count 2830
Iterating global reduction 3 with 13 rules applied. Total rules applied 1499 place count 1096 transition count 2830
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1511 place count 1084 transition count 2806
Iterating global reduction 3 with 12 rules applied. Total rules applied 1523 place count 1084 transition count 2806
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1534 place count 1073 transition count 2784
Iterating global reduction 3 with 11 rules applied. Total rules applied 1545 place count 1073 transition count 2784
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 1588 place count 1030 transition count 2624
Iterating global reduction 3 with 43 rules applied. Total rules applied 1631 place count 1030 transition count 2624
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1684 place count 977 transition count 2412
Iterating global reduction 3 with 53 rules applied. Total rules applied 1737 place count 977 transition count 2412
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 1790 place count 924 transition count 2272
Iterating global reduction 3 with 53 rules applied. Total rules applied 1843 place count 924 transition count 2272
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1895 place count 872 transition count 2168
Iterating global reduction 3 with 52 rules applied. Total rules applied 1947 place count 872 transition count 2168
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1999 place count 820 transition count 2064
Iterating global reduction 3 with 52 rules applied. Total rules applied 2051 place count 820 transition count 2064
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2103 place count 768 transition count 1960
Iterating global reduction 3 with 52 rules applied. Total rules applied 2155 place count 768 transition count 1960
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 2205 place count 718 transition count 1860
Iterating global reduction 3 with 50 rules applied. Total rules applied 2255 place count 718 transition count 1860
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 2271 place count 702 transition count 1828
Iterating global reduction 3 with 16 rules applied. Total rules applied 2287 place count 702 transition count 1828
Applied a total of 2287 rules in 1533 ms. Remains 702 /1628 variables (removed 926) and now considering 1828/5962 (removed 4134) transitions.
[2026-05-25 09:29:06] [INFO ] Flow matrix only has 1228 transitions (discarded 600 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4962585817949358449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16540052598825025268.kers'
[2026-05-25 09:29:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4962585817949358449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16540052598825025268.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1228 rows 702 cols 3364 entries
Finished phase 1 with 699 SingleSign rule and 1 generalized
[2026-05-25 09:29:06] [INFO ] Computed 2 invariants in 8 ms
Computed 2 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-16540052598825025268.kers
Total runtime 10 ms.
[2026-05-25 09:29:07] [INFO ] Implicit Places using invariants in 738 ms returned []
[2026-05-25 09:29:07] [INFO ] Flow matrix only has 1228 transitions (discarded 600 similar events)
[2026-05-25 09:29:07] [INFO ] Invariant cache hit.
[2026-05-25 09:29:12] [INFO ] State equation strengthened by 300 read => feed constraints.
[2026-05-25 09:29:15] [INFO ] Implicit Places using invariants and state equation in 8571 ms returned []
Implicit Place search using SMT with State Equation took 9341 ms to find 0 implicit places.
Running 1826 sub problems to find dead transitions.
[2026-05-25 09:29:15] [INFO ] Flow matrix only has 1228 transitions (discarded 600 similar events)
[2026-05-25 09:29:15] [INFO ] Invariant cache hit.
[2026-05-25 09:29:15] [INFO ] State equation strengthened by 300 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1826 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1826 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/1930 variables, and 2 constraints, problems are : Problem set: 0 solved, 1826 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/702 constraints, ReadFeed: 0/300 constraints, PredecessorRefiner: 1826/1826 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1826 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1826 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1826 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/1930 variables, and 2 constraints, problems are : Problem set: 0 solved, 1826 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/702 constraints, ReadFeed: 0/300 constraints, PredecessorRefiner: 0/1826 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63423ms problems are : Problem set: 0 solved, 1826 unsolved
Search for dead transitions found 0 dead transitions in 63448ms
Starting structural reductions in LTL mode, iteration 1 : 702/1628 places, 1828/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74372 ms. Remains : 702/1628 places, 1828/5962 transitions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 1828/1828 transitions.
Applied a total of 0 rules in 16 ms. Remains 702 /702 variables (removed 0) and now considering 1828/1828 (removed 0) transitions.
[2026-05-25 09:30:19] [INFO ] Flow matrix only has 1228 transitions (discarded 600 similar events)
[2026-05-25 09:30:19] [INFO ] Invariant cache hit.
[2026-05-25 09:30:19] [INFO ] Implicit Places using invariants in 380 ms returned []
[2026-05-25 09:30:19] [INFO ] Flow matrix only has 1228 transitions (discarded 600 similar events)
[2026-05-25 09:30:19] [INFO ] Invariant cache hit.
[2026-05-25 09:30:19] [INFO ] State equation strengthened by 300 read => feed constraints.
[2026-05-25 09:30:22] [INFO ] Implicit Places using invariants and state equation in 2722 ms returned []
Implicit Place search using SMT with State Equation took 3107 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3125 ms. Remains : 702/702 places, 1828/1828 transitions.
Support contains 18 out of 702 places after structural reductions.
[2026-05-25 09:30:22] [INFO ] Flatten gal took : 131 ms
[2026-05-25 09:30:22] [INFO ] Flatten gal took : 86 ms
[2026-05-25 09:30:22] [INFO ] Input system was already deterministic with 1828 transitions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40083 steps (8 resets) in 2335 ms. (17 steps per ms) remains 12/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
[2026-05-25 09:30:23] [INFO ] Flow matrix only has 1228 transitions (discarded 600 similar events)
[2026-05-25 09:30:23] [INFO ] Invariant cache hit.
[2026-05-25 09:30:23] [INFO ] State equation strengthened by 300 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 383/398 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 26/424 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 950/1374 variables, 424/426 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1374 variables, 235/661 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1374 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 436/1810 variables, 180/841 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1810 variables, 65/906 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1810 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 110/1920 variables, 91/997 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1920 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 9/1929 variables, 6/1003 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1929 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 1/1930 variables, 1/1004 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1930 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/1930 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1930/1930 variables, and 1004 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 702/702 constraints, ReadFeed: 300/300 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 383/398 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 26/424 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 950/1374 variables, 424/426 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1374 variables, 235/661 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1374 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1374 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 436/1810 variables, 180/842 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1810 variables, 65/907 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1810 variables, 12/919 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1810/1930 variables, and 936 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 604/702 constraints, ReadFeed: 300/300 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 18/18 constraints]
After SMT, in 9106ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 1828/1828 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 700 transition count 1824
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 700 transition count 1824
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 700 transition count 1822
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 698 transition count 1818
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 698 transition count 1818
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 696 transition count 1812
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 696 transition count 1812
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 693 transition count 1800
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 693 transition count 1800
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 690 transition count 1790
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 690 transition count 1790
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 687 transition count 1784
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 687 transition count 1784
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 684 transition count 1778
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 684 transition count 1778
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 681 transition count 1772
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 681 transition count 1772
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 678 transition count 1766
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 678 transition count 1766
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 676 transition count 1762
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 676 transition count 1762
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 70 place count 676 transition count 1746
Applied a total of 70 rules in 524 ms. Remains 676 /702 variables (removed 26) and now considering 1746/1828 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 676/702 places, 1746/1828 transitions.
RANDOM walk for 40122 steps (8 resets) in 720 ms. (55 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 176939 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 11
Probabilistic random walk after 176939 steps, saw 114865 distinct states, run finished after 3006 ms. (steps per millisecond=58 ) properties seen :0
[2026-05-25 09:30:36] [INFO ] Flow matrix only has 1175 transitions (discarded 571 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1845077296202716537.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9108151280467753854.kers'
[2026-05-25 09:30:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1845077296202716537.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9108151280467753854.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1175 rows 676 cols 3228 entries
Finished phase 1 with 673 SingleSign rule and 1 generalized
[2026-05-25 09:30:37] [INFO ] Computed 2 invariants in 7 ms
Computed 2 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9108151280467753854.kers
Total runtime 9 ms.
[2026-05-25 09:30:37] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 383/397 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 20/417 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 927/1344 variables, 417/419 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1344 variables, 226/645 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1344 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 407/1751 variables, 171/816 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1751 variables, 65/881 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1751 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 93/1844 variables, 83/964 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1844 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 6/1850 variables, 4/968 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1850 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 1/1851 variables, 1/969 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1851 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/1851 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1851/1851 variables, and 969 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4524 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 676/676 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 383/397 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 20/417 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 927/1344 variables, 417/419 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1344 variables, 226/645 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1344 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1344 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 407/1751 variables, 171/817 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1751 variables, 65/882 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1751 variables, 11/893 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1751 variables, 1/894 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1751 variables, 16/910 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1751 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 93/1844 variables, 83/993 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1844/1851 variables, and 993 constraints, problems are : Problem set: 0 solved, 11 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 671/676 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 17/17 constraints]
After SMT, in 49597ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 676 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 676/676 places, 1746/1746 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 675 transition count 1744
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 675 transition count 1744
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 674 transition count 1742
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 674 transition count 1742
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 673 transition count 1740
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 673 transition count 1740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 672 transition count 1738
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 672 transition count 1738
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 671 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 671 transition count 1736
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 670 transition count 1734
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 670 transition count 1734
Applied a total of 12 rules in 205 ms. Remains 670 /676 variables (removed 6) and now considering 1734/1746 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 670/676 places, 1734/1746 transitions.
RANDOM walk for 40104 steps (8 resets) in 215 ms. (185 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 185741 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 10
Probabilistic random walk after 185741 steps, saw 120577 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2026-05-25 09:31:30] [INFO ] Flow matrix only has 1165 transitions (discarded 569 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17895077251287633825.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1111158401782577904.kers'
[2026-05-25 09:31:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17895077251287633825.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1111158401782577904.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1165 rows 670 cols 3198 entries
Finished phase 1 with 667 SingleSign rule and 1 generalized
[2026-05-25 09:31:30] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1111158401782577904.kers
Total runtime 7 ms.
[2026-05-25 09:31:30] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 383/395 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 18/413 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 846/1259 variables, 413/415 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1259 variables, 151/566 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1259 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 476/1735 variables, 169/735 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1735 variables, 137/872 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1735 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 93/1828 variables, 83/955 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1828 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 6/1834 variables, 4/959 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1834 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1/1835 variables, 1/960 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1835 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/1835 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1835/1835 variables, and 960 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2200 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 670/670 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 383/395 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 18/413 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 846/1259 variables, 413/415 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1259 variables, 151/566 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1259 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1259 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 476/1735 variables, 169/736 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1735 variables, 137/873 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1735 variables, 10/883 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1735 variables, 14/897 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1735 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 93/1828 variables, 83/980 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1828 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 6/1834 variables, 4/984 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1834 variables, 1/985 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1834 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 1/1835 variables, 1/986 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1835 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 0/1835 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1835/1835 variables, and 986 constraints, problems are : Problem set: 0 solved, 10 unsolved in 14206 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 670/670 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 15/15 constraints]
After SMT, in 16453ms problems are : Problem set: 0 solved, 10 unsolved
Finished Parikh walk after 10313 steps, including 37 resets, run visited all 1 properties in 79 ms. (steps per millisecond=130 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 6029 ms.
Computed a total of 192 stabilizing places and 512 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((X(G(p0))&&(F(p1)||(p1 U p0)))))'
Support contains 3 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 1828/1828 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 692 transition count 1804
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 692 transition count 1804
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 692 transition count 1798
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 682 transition count 1776
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 682 transition count 1776
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 682 transition count 1772
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 674 transition count 1752
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 674 transition count 1752
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 665 transition count 1726
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 665 transition count 1726
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 655 transition count 1698
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 655 transition count 1698
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 113 place count 646 transition count 1676
Iterating global reduction 2 with 9 rules applied. Total rules applied 122 place count 646 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 130 place count 638 transition count 1658
Iterating global reduction 2 with 8 rules applied. Total rules applied 138 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 145 place count 631 transition count 1642
Iterating global reduction 2 with 7 rules applied. Total rules applied 152 place count 631 transition count 1642
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 159 place count 624 transition count 1628
Iterating global reduction 2 with 7 rules applied. Total rules applied 166 place count 624 transition count 1628
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 171 place count 619 transition count 1618
Iterating global reduction 2 with 5 rules applied. Total rules applied 176 place count 619 transition count 1618
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 179 place count 616 transition count 1612
Iterating global reduction 2 with 3 rules applied. Total rules applied 182 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 615 transition count 1610
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 190 place count 614 transition count 1604
Applied a total of 190 rules in 894 ms. Remains 614 /702 variables (removed 88) and now considering 1604/1828 (removed 224) transitions.
[2026-05-25 09:31:53] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10426333717371293628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18039640811209234539.kers'
[2026-05-25 09:31:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10426333717371293628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18039640811209234539.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1071 rows 614 cols 2944 entries
Finished phase 1 with 611 SingleSign rule and 1 generalized
[2026-05-25 09:31:53] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-18039640811209234539.kers
Total runtime 7 ms.
[2026-05-25 09:31:54] [INFO ] Implicit Places using invariants in 378 ms returned []
[2026-05-25 09:31:54] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2026-05-25 09:31:54] [INFO ] Invariant cache hit.
[2026-05-25 09:31:54] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 09:31:57] [INFO ] Implicit Places using invariants and state equation in 3535 ms returned []
Implicit Place search using SMT with State Equation took 3916 ms to find 0 implicit places.
[2026-05-25 09:31:57] [INFO ] Redundant transitions in 103 ms returned []
Running 1602 sub problems to find dead transitions.
[2026-05-25 09:31:57] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2026-05-25 09:31:57] [INFO ] Invariant cache hit.
[2026-05-25 09:31:57] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31375 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63518ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 63522ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/702 places, 1604/1828 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68452 ms. Remains : 614/702 places, 1604/1828 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&(F(p1)||(p1 U p0)))))'
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-03
Stuttering criterion allowed to conclude after 487 steps with 0 reset in 22 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-03 finished in 68840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 1828/1828 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 692 transition count 1804
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 692 transition count 1804
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 692 transition count 1798
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 37 place count 681 transition count 1774
Iterating global reduction 1 with 11 rules applied. Total rules applied 48 place count 681 transition count 1774
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 52 place count 681 transition count 1770
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 61 place count 672 transition count 1746
Iterating global reduction 2 with 9 rules applied. Total rules applied 70 place count 672 transition count 1746
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 80 place count 662 transition count 1716
Iterating global reduction 2 with 10 rules applied. Total rules applied 90 place count 662 transition count 1716
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 101 place count 651 transition count 1686
Iterating global reduction 2 with 11 rules applied. Total rules applied 112 place count 651 transition count 1686
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 122 place count 641 transition count 1662
Iterating global reduction 2 with 10 rules applied. Total rules applied 132 place count 641 transition count 1662
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 141 place count 632 transition count 1642
Iterating global reduction 2 with 9 rules applied. Total rules applied 150 place count 632 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 158 place count 624 transition count 1624
Iterating global reduction 2 with 8 rules applied. Total rules applied 166 place count 624 transition count 1624
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 174 place count 616 transition count 1608
Iterating global reduction 2 with 8 rules applied. Total rules applied 182 place count 616 transition count 1608
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 187 place count 611 transition count 1598
Iterating global reduction 2 with 5 rules applied. Total rules applied 192 place count 611 transition count 1598
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 195 place count 608 transition count 1592
Iterating global reduction 2 with 3 rules applied. Total rules applied 198 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 199 place count 607 transition count 1590
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 201 place count 606 transition count 1588
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 606 transition count 1588
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 204 place count 606 transition count 1586
Applied a total of 204 rules in 374 ms. Remains 606 /702 variables (removed 96) and now considering 1586/1828 (removed 242) transitions.
[2026-05-25 09:33:02] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18001863229663919736.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15615051105721154177.kers'
[2026-05-25 09:33:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18001863229663919736.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15615051105721154177.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1060 rows 606 cols 2914 entries
Finished phase 1 with 603 SingleSign rule and 1 generalized
[2026-05-25 09:33:02] [INFO ] Computed 2 invariants in 7 ms
Computed 2 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-15615051105721154177.kers
Total runtime 10 ms.
[2026-05-25 09:33:02] [INFO ] Implicit Places using invariants in 374 ms returned []
[2026-05-25 09:33:02] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2026-05-25 09:33:02] [INFO ] Invariant cache hit.
[2026-05-25 09:33:02] [INFO ] State equation strengthened by 264 read => feed constraints.
[2026-05-25 09:33:04] [INFO ] Implicit Places using invariants and state equation in 2147 ms returned []
Implicit Place search using SMT with State Equation took 2524 ms to find 0 implicit places.
[2026-05-25 09:33:04] [INFO ] Redundant transitions in 94 ms returned []
Running 1584 sub problems to find dead transitions.
[2026-05-25 09:33:04] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2026-05-25 09:33:04] [INFO ] Invariant cache hit.
[2026-05-25 09:33:04] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 606/1666 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/606 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1060/1666 variables, 606/608 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
SMT process timed out in 61922ms, After SMT, problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 61926ms
Starting structural reductions in SI_LTL mode, iteration 1 : 606/702 places, 1586/1828 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64934 ms. Remains : 606/702 places, 1586/1828 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-04
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-04 finished in 65035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(G(!(G(p1) U X(F(p0)))))||X(p1))))'
Support contains 3 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 1828/1828 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 693 transition count 1806
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 693 transition count 1806
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 693 transition count 1804
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 29 place count 684 transition count 1784
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 684 transition count 1784
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 42 place count 684 transition count 1780
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 50 place count 676 transition count 1758
Iterating global reduction 2 with 8 rules applied. Total rules applied 58 place count 676 transition count 1758
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 668 transition count 1736
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 668 transition count 1736
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 84 place count 658 transition count 1710
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 658 transition count 1710
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 103 place count 649 transition count 1686
Iterating global reduction 2 with 9 rules applied. Total rules applied 112 place count 649 transition count 1686
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 120 place count 641 transition count 1668
Iterating global reduction 2 with 8 rules applied. Total rules applied 128 place count 641 transition count 1668
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 135 place count 634 transition count 1652
Iterating global reduction 2 with 7 rules applied. Total rules applied 142 place count 634 transition count 1652
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 149 place count 627 transition count 1638
Iterating global reduction 2 with 7 rules applied. Total rules applied 156 place count 627 transition count 1638
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 160 place count 623 transition count 1630
Iterating global reduction 2 with 4 rules applied. Total rules applied 164 place count 623 transition count 1630
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 168 place count 619 transition count 1622
Iterating global reduction 2 with 4 rules applied. Total rules applied 172 place count 619 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 173 place count 618 transition count 1620
Iterating global reduction 2 with 1 rules applied. Total rules applied 174 place count 618 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 617 transition count 1618
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 617 transition count 1618
Applied a total of 176 rules in 209 ms. Remains 617 /702 variables (removed 85) and now considering 1618/1828 (removed 210) transitions.
[2026-05-25 09:34:06] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3790774352515374068.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11259610587729467115.kers'
[2026-05-25 09:34:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3790774352515374068.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11259610587729467115.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1080 rows 617 cols 2964 entries
Finished phase 1 with 614 SingleSign rule and 1 generalized
[2026-05-25 09:34:06] [INFO ] Computed 2 invariants in 8 ms
Computed 2 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-11259610587729467115.kers
Total runtime 11 ms.
[2026-05-25 09:34:07] [INFO ] Implicit Places using invariants in 350 ms returned []
[2026-05-25 09:34:07] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2026-05-25 09:34:07] [INFO ] Invariant cache hit.
[2026-05-25 09:34:07] [INFO ] State equation strengthened by 267 read => feed constraints.
[2026-05-25 09:34:09] [INFO ] Implicit Places using invariants and state equation in 1945 ms returned []
Implicit Place search using SMT with State Equation took 2297 ms to find 0 implicit places.
Running 1616 sub problems to find dead transitions.
[2026-05-25 09:34:09] [INFO ] Flow matrix only has 1080 transitions (discarded 538 similar events)
[2026-05-25 09:34:09] [INFO ] Invariant cache hit.
[2026-05-25 09:34:09] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1697 variables, and 2 constraints, problems are : Problem set: 0 solved, 1616 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1616/1616 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1616 unsolved
SMT process timed out in 62040ms, After SMT, problems are : Problem set: 0 solved, 1616 unsolved
Search for dead transitions found 0 dead transitions in 62045ms
Starting structural reductions in LTL mode, iteration 1 : 617/702 places, 1618/1828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64557 ms. Remains : 617/702 places, 1618/1828 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(G(!(G(p1) U X(F(p0)))))||X(p1))))'
Stuttering acceptance computed with spot in 116 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), p0]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-07 finished in 64703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&X(F(p1)))))))'
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 1828/1828 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 692 transition count 1806
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 692 transition count 1806
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 692 transition count 1800
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 682 transition count 1778
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 682 transition count 1778
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 682 transition count 1774
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 58 place count 674 transition count 1752
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 674 transition count 1752
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 665 transition count 1724
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 665 transition count 1724
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 655 transition count 1696
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 655 transition count 1696
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 113 place count 646 transition count 1674
Iterating global reduction 2 with 9 rules applied. Total rules applied 122 place count 646 transition count 1674
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 131 place count 637 transition count 1654
Iterating global reduction 2 with 9 rules applied. Total rules applied 140 place count 637 transition count 1654
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 148 place count 629 transition count 1636
Iterating global reduction 2 with 8 rules applied. Total rules applied 156 place count 629 transition count 1636
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 164 place count 621 transition count 1620
Iterating global reduction 2 with 8 rules applied. Total rules applied 172 place count 621 transition count 1620
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 177 place count 616 transition count 1610
Iterating global reduction 2 with 5 rules applied. Total rules applied 182 place count 616 transition count 1610
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 185 place count 613 transition count 1604
Iterating global reduction 2 with 3 rules applied. Total rules applied 188 place count 613 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 189 place count 612 transition count 1602
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 191 place count 611 transition count 1600
Iterating global reduction 2 with 1 rules applied. Total rules applied 192 place count 611 transition count 1600
Applied a total of 192 rules in 201 ms. Remains 611 /702 variables (removed 91) and now considering 1600/1828 (removed 228) transitions.
[2026-05-25 09:35:11] [INFO ] Flow matrix only has 1069 transitions (discarded 531 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5832602702311992311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1447657753411703825.kers'
[2026-05-25 09:35:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5832602702311992311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1447657753411703825.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1069 rows 611 cols 2940 entries
Finished phase 1 with 608 SingleSign rule and 1 generalized
[2026-05-25 09:35:11] [INFO ] Computed 2 invariants in 9 ms
Computed 2 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-1447657753411703825.kers
Total runtime 11 ms.
[2026-05-25 09:35:11] [INFO ] Implicit Places using invariants in 285 ms returned []
[2026-05-25 09:35:11] [INFO ] Flow matrix only has 1069 transitions (discarded 531 similar events)
[2026-05-25 09:35:11] [INFO ] Invariant cache hit.
[2026-05-25 09:35:12] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 09:35:13] [INFO ] Implicit Places using invariants and state equation in 1771 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
Running 1598 sub problems to find dead transitions.
[2026-05-25 09:35:13] [INFO ] Flow matrix only has 1069 transitions (discarded 531 similar events)
[2026-05-25 09:35:13] [INFO ] Invariant cache hit.
[2026-05-25 09:35:13] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/611 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 611/1680 variables, and 2 constraints, problems are : Problem set: 0 solved, 1598 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/611 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1598/1598 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1598 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/611 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 611/1680 variables, and 2 constraints, problems are : Problem set: 0 solved, 1598 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/611 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1598 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62399ms problems are : Problem set: 0 solved, 1598 unsolved
Search for dead transitions found 0 dead transitions in 62402ms
Starting structural reductions in LTL mode, iteration 1 : 611/702 places, 1600/1828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64673 ms. Remains : 611/702 places, 1600/1828 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(F(p0))&&p1)))))'
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-09
Stuttering criterion allowed to conclude after 68 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-09 finished in 64937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(F(p1))&&p0))&&X(X((X(p3)&&p2)))))'
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 1828/1828 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 693 transition count 1808
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 693 transition count 1808
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 693 transition count 1802
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 684 transition count 1784
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 684 transition count 1784
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 684 transition count 1780
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 53 place count 677 transition count 1762
Iterating global reduction 2 with 7 rules applied. Total rules applied 60 place count 677 transition count 1762
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 669 transition count 1738
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 669 transition count 1738
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 85 place count 660 transition count 1712
Iterating global reduction 2 with 9 rules applied. Total rules applied 94 place count 660 transition count 1712
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 102 place count 652 transition count 1692
Iterating global reduction 2 with 8 rules applied. Total rules applied 110 place count 652 transition count 1692
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 117 place count 645 transition count 1676
Iterating global reduction 2 with 7 rules applied. Total rules applied 124 place count 645 transition count 1676
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 131 place count 638 transition count 1660
Iterating global reduction 2 with 7 rules applied. Total rules applied 138 place count 638 transition count 1660
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 145 place count 631 transition count 1646
Iterating global reduction 2 with 7 rules applied. Total rules applied 152 place count 631 transition count 1646
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 157 place count 626 transition count 1636
Iterating global reduction 2 with 5 rules applied. Total rules applied 162 place count 626 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 165 place count 623 transition count 1630
Iterating global reduction 2 with 3 rules applied. Total rules applied 168 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 169 place count 622 transition count 1628
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 622 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 621 transition count 1626
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 621 transition count 1626
Applied a total of 172 rules in 210 ms. Remains 621 /702 variables (removed 81) and now considering 1626/1828 (removed 202) transitions.
[2026-05-25 09:36:16] [INFO ] Flow matrix only has 1086 transitions (discarded 540 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1246480722364891839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8857723222424713410.kers'
[2026-05-25 09:36:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1246480722364891839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8857723222424713410.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1086 rows 621 cols 2984 entries
Finished phase 1 with 618 SingleSign rule and 1 generalized
[2026-05-25 09:36:16] [INFO ] Computed 2 invariants in 10 ms
Computed 2 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-8857723222424713410.kers
Total runtime 14 ms.
[2026-05-25 09:36:16] [INFO ] Implicit Places using invariants in 352 ms returned []
[2026-05-25 09:36:16] [INFO ] Flow matrix only has 1086 transitions (discarded 540 similar events)
[2026-05-25 09:36:16] [INFO ] Invariant cache hit.
[2026-05-25 09:36:17] [INFO ] State equation strengthened by 268 read => feed constraints.
[2026-05-25 09:36:18] [INFO ] Implicit Places using invariants and state equation in 2009 ms returned []
Implicit Place search using SMT with State Equation took 2364 ms to find 0 implicit places.
Running 1624 sub problems to find dead transitions.
[2026-05-25 09:36:18] [INFO ] Flow matrix only has 1086 transitions (discarded 540 similar events)
[2026-05-25 09:36:18] [INFO ] Invariant cache hit.
[2026-05-25 09:36:19] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1707 variables, and 2 constraints, problems are : Problem set: 0 solved, 1624 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/621 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1624/1624 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1624 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/1707 variables, and 2 constraints, problems are : Problem set: 0 solved, 1624 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/621 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 0/1624 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62366ms problems are : Problem set: 0 solved, 1624 unsolved
Search for dead transitions found 0 dead transitions in 62369ms
Starting structural reductions in LTL mode, iteration 1 : 621/702 places, 1626/1828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64950 ms. Remains : 621/702 places, 1626/1828 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(F(p1))&&p0))&&X(X((X(p3)&&p2)))))'
Stuttering acceptance computed with spot in 761 ms :[(OR (AND (NOT p0) (NOT p1) p2 p3) (AND (NOT p0) p1 p2 p3) (AND p0 (NOT p1) p2 p3) (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2) p3) (AND (NOT p0) (NOT p1) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2) p3) (AND (NOT p0) p1 p2 (NOT p3)) (AND p0 (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p2) p3) (AND p0 (NOT p1) p2 (NOT p3)) (AND p0 p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p2) p3) (AND p0 p1 p2 (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (NOT p2) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-12 finished in 65763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)||p0) U p2)))'
Support contains 6 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 1828/1828 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 694 transition count 1808
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 694 transition count 1808
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 694 transition count 1802
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 686 transition count 1784
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 686 transition count 1784
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 42 place count 686 transition count 1780
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 48 place count 680 transition count 1764
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 680 transition count 1764
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 61 place count 673 transition count 1742
Iterating global reduction 2 with 7 rules applied. Total rules applied 68 place count 673 transition count 1742
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 76 place count 665 transition count 1718
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 665 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 92 place count 657 transition count 1698
Iterating global reduction 2 with 8 rules applied. Total rules applied 100 place count 657 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 107 place count 650 transition count 1684
Iterating global reduction 2 with 7 rules applied. Total rules applied 114 place count 650 transition count 1684
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 120 place count 644 transition count 1672
Iterating global reduction 2 with 6 rules applied. Total rules applied 126 place count 644 transition count 1672
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 132 place count 638 transition count 1660
Iterating global reduction 2 with 6 rules applied. Total rules applied 138 place count 638 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 634 transition count 1652
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 634 transition count 1652
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 148 place count 632 transition count 1648
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 632 transition count 1648
Applied a total of 150 rules in 198 ms. Remains 632 /702 variables (removed 70) and now considering 1648/1828 (removed 180) transitions.
[2026-05-25 09:37:22] [INFO ] Flow matrix only has 1102 transitions (discarded 546 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-850561537874926717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11675504927497927043.kers'
[2026-05-25 09:37:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-850561537874926717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11675504927497927043.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1102 rows 632 cols 3028 entries
Finished phase 1 with 629 SingleSign rule and 1 generalized
[2026-05-25 09:37:22] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11675504927497927043.kers
Total runtime 7 ms.
[2026-05-25 09:37:22] [INFO ] Implicit Places using invariants in 286 ms returned []
[2026-05-25 09:37:22] [INFO ] Flow matrix only has 1102 transitions (discarded 546 similar events)
[2026-05-25 09:37:22] [INFO ] Invariant cache hit.
[2026-05-25 09:37:22] [INFO ] State equation strengthened by 272 read => feed constraints.
[2026-05-25 09:37:24] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 2093 ms to find 0 implicit places.
Running 1646 sub problems to find dead transitions.
[2026-05-25 09:37:24] [INFO ] Flow matrix only has 1102 transitions (discarded 546 similar events)
[2026-05-25 09:37:24] [INFO ] Invariant cache hit.
[2026-05-25 09:37:24] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/1734 variables, and 2 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1646/1646 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1646 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/1734 variables, and 2 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 0/1646 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62348ms problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 62351ms
Starting structural reductions in LTL mode, iteration 1 : 632/702 places, 1648/1828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64649 ms. Remains : 632/702 places, 1648/1828 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)||p0) U p2)))'
Stuttering acceptance computed with spot in 143 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c064-LTLFireability-13 finished in 64845 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))||G(p0)) U X(X(p1))))'
Support contains 3 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 1828/1828 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 692 transition count 1804
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 692 transition count 1804
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 692 transition count 1800
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 683 transition count 1780
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 683 transition count 1780
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 675 transition count 1758
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 675 transition count 1758
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 67 place count 666 transition count 1730
Iterating global reduction 1 with 9 rules applied. Total rules applied 76 place count 666 transition count 1730
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 85 place count 657 transition count 1708
Iterating global reduction 1 with 9 rules applied. Total rules applied 94 place count 657 transition count 1708
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 102 place count 649 transition count 1692
Iterating global reduction 1 with 8 rules applied. Total rules applied 110 place count 649 transition count 1692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 118 place count 641 transition count 1672
Iterating global reduction 1 with 8 rules applied. Total rules applied 126 place count 641 transition count 1672
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 133 place count 634 transition count 1654
Iterating global reduction 1 with 7 rules applied. Total rules applied 140 place count 634 transition count 1654
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 147 place count 627 transition count 1640
Iterating global reduction 1 with 7 rules applied. Total rules applied 154 place count 627 transition count 1640
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 158 place count 623 transition count 1632
Iterating global reduction 1 with 4 rules applied. Total rules applied 162 place count 623 transition count 1632
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 164 place count 621 transition count 1628
Iterating global reduction 1 with 2 rules applied. Total rules applied 166 place count 621 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 168 place count 619 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 170 place count 619 transition count 1624
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 172 place count 617 transition count 1620
Iterating global reduction 1 with 2 rules applied. Total rules applied 174 place count 617 transition count 1620
Applied a total of 174 rules in 209 ms. Remains 617 /702 variables (removed 85) and now considering 1620/1828 (removed 208) transitions.
[2026-05-25 09:38:27] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1622914216656104621.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3378398396481196259.kers'
[2026-05-25 09:38:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1622914216656104621.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3378398396481196259.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1079 rows 617 cols 2960 entries
Finished phase 1 with 614 SingleSign rule and 1 generalized
[2026-05-25 09:38:27] [INFO ] Computed 2 invariants in 8 ms
Computed 2 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-3378398396481196259.kers
Total runtime 11 ms.
[2026-05-25 09:38:27] [INFO ] Implicit Places using invariants in 359 ms returned []
[2026-05-25 09:38:27] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
[2026-05-25 09:38:27] [INFO ] Invariant cache hit.
[2026-05-25 09:38:27] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 09:38:30] [INFO ] Implicit Places using invariants and state equation in 2587 ms returned []
Implicit Place search using SMT with State Equation took 2952 ms to find 0 implicit places.
Running 1618 sub problems to find dead transitions.
[2026-05-25 09:38:30] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
[2026-05-25 09:38:30] [INFO ] Invariant cache hit.
[2026-05-25 09:38:30] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1618/1618 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1618 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1696 variables, and 2 constraints, problems are : Problem set: 0 solved, 1618 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1618 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62592ms problems are : Problem set: 0 solved, 1618 unsolved
Search for dead transitions found 0 dead transitions in 62595ms
Starting structural reductions in LTL mode, iteration 1 : 617/702 places, 1620/1828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65764 ms. Remains : 617/702 places, 1620/1828 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(!p0))||G(p0)) U X(X(p1))))'
Stuttering acceptance computed with spot in 462 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), false, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), false, false, p0, p0, false]
Running random walk in product with property : FunctionPointer-PT-c064-LTLFireability-15
Product exploration explored 100000 steps with 743 reset in 667 ms.
Product exploration explored 100000 steps with 739 reset in 634 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge based reduction with 6 factoid took 67 ms. Reduced automaton from 12 states, 24 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
RANDOM walk for 40044 steps (8 resets) in 530 ms. (75 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 200572 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 4
Probabilistic random walk after 200572 steps, saw 130202 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2026-05-25 09:39:38] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
[2026-05-25 09:39:38] [INFO ] Invariant cache hit.
[2026-05-25 09:39:38] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 782/1168 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1168 variables, 66/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 435/1603 variables, 151/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1603 variables, 199/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1603 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1604 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1604 variables, 1/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1604 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 82/1686 variables, 73/878 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1686 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 7/1693 variables, 4/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1693 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 3/1696 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1696 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1696 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1696/1696 variables, and 884 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1289 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 782/1168 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1168 variables, 66/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 435/1603 variables, 151/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1603 variables, 199/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1603 variables, 4/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1603 variables, 9/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1603 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/1604 variables, 1/817 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1604 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1604 variables, 1/819 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1604 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 82/1686 variables, 73/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1686 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 7/1693 variables, 4/896 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1693 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 3/1696 variables, 2/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 898 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 6324ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1620/1620 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 617 transition count 1616
Applied a total of 4 rules in 202 ms. Remains 617 /617 variables (removed 0) and now considering 1616/1620 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 617/617 places, 1616/1620 transitions.
RANDOM walk for 40096 steps (8 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 227530 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 4
Probabilistic random walk after 227530 steps, saw 147698 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2026-05-25 09:39:47] [INFO ] Flow matrix only has 1077 transitions (discarded 539 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17842724498924264095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1099709168760240828.kers'
[2026-05-25 09:39:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17842724498924264095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1099709168760240828.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1077 rows 617 cols 2956 entries
Finished phase 1 with 614 SingleSign rule and 1 generalized
[2026-05-25 09:39:47] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1099709168760240828.kers
Total runtime 5 ms.
[2026-05-25 09:39:47] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 782/1168 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1168 variables, 66/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 433/1601 variables, 151/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1601 variables, 199/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1601 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1602 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1602 variables, 1/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1602 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 79/1681 variables, 71/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 9/1690 variables, 5/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1690 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 4/1694 variables, 3/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1694 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1694 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 884 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1557 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 782/1168 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1168 variables, 66/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 433/1601 variables, 151/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1601 variables, 199/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1601 variables, 4/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1601 variables, 4/811 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1601 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/1602 variables, 1/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1602 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1602 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 79/1681 variables, 71/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1681 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 9/1690 variables, 5/889 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1690 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 4/1694 variables, 3/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1694 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1694 variables, 2/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1694 variables, 1/895 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1694 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/1694 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 895 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7085 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 8686ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 30833 steps, including 78 resets, run visited all 1 properties in 123 ms. (steps per millisecond=250 )
Parikh walk visited 4 properties in 1078 ms.
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 429 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), false, false, p0, p0, false]
[2026-05-25 09:39:58] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9167138503074043264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13041327299799687418.kers'
[2026-05-25 09:39:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9167138503074043264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13041327299799687418.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1079 rows 617 cols 2960 entries
Finished phase 1 with 614 SingleSign rule and 1 generalized
[2026-05-25 09:39:58] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13041327299799687418.kers
Total runtime 7 ms.
[2026-05-25 09:39:58] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2026-05-25 09:39:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:40:13] [INFO ] [Real]Absence check using state equation in 14129 ms returned unknown
Could not prove EG (NOT p1)
Knowledge-based reduction took 38538 ms.
Stuttering acceptance computed with spot in 370 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), false, false, p0, p0, false]
Support contains 3 out of 617 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 617/617 places, 1620/1620 transitions.
Applied a total of 0 rules in 18 ms. Remains 617 /617 variables (removed 0) and now considering 1620/1620 (removed 0) transitions.
[2026-05-25 09:40:13] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
[2026-05-25 09:40:13] [INFO ] Invariant cache hit.
[2026-05-25 09:40:13] [INFO ] Implicit Places using invariants in 348 ms returned []
[2026-05-25 09:40:13] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
[2026-05-25 09:40:13] [INFO ] Invariant cache hit.
[2026-05-25 09:40:14] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 09:40:16] [INFO ] Implicit Places using invariants and state equation in 2608 ms returned []
Implicit Place search using SMT with State Equation took 2957 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2977 ms. Remains : 617/617 places, 1620/1620 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge based reduction with 5 factoid took 65 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
RANDOM walk for 40086 steps (8 resets) in 223 ms. (178 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 241258 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 4
Probabilistic random walk after 241258 steps, saw 156608 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2026-05-25 09:40:19] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
[2026-05-25 09:40:19] [INFO ] Invariant cache hit.
[2026-05-25 09:40:19] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 782/1168 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1168 variables, 66/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 435/1603 variables, 151/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1603 variables, 199/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1603 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1604 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1604 variables, 1/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1604 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 82/1686 variables, 73/878 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1686 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 7/1693 variables, 4/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1693 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 3/1696 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1696 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1696 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1696/1696 variables, and 884 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1219 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 782/1168 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1168 variables, 66/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 435/1603 variables, 151/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1603 variables, 199/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1603 variables, 4/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1603 variables, 9/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1603 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/1604 variables, 1/817 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1604 variables, 1/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1604 variables, 1/819 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1604 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 82/1686 variables, 73/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1686 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 7/1693 variables, 4/896 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1693 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 3/1696 variables, 2/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1696 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1696/1696 variables, and 898 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 6244ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1620/1620 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 617 transition count 1616
Applied a total of 4 rules in 168 ms. Remains 617 /617 variables (removed 0) and now considering 1616/1620 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 617/617 places, 1616/1620 transitions.
RANDOM walk for 40044 steps (8 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 244043 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 4
Probabilistic random walk after 244043 steps, saw 158414 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2026-05-25 09:40:29] [INFO ] Flow matrix only has 1077 transitions (discarded 539 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4514563833051600597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1957294500150277991.kers'
[2026-05-25 09:40:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4514563833051600597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1957294500150277991.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1077 rows 617 cols 2956 entries
Finished phase 1 with 614 SingleSign rule and 1 generalized
[2026-05-25 09:40:29] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1957294500150277991.kers
Total runtime 4 ms.
[2026-05-25 09:40:29] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 782/1168 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1168 variables, 66/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 433/1601 variables, 151/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1601 variables, 199/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1601 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/1602 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1602 variables, 1/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1602 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 79/1681 variables, 71/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1681 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 9/1690 variables, 5/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1690 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 4/1694 variables, 3/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1694 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1694 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 884 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1501 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 782/1168 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1168 variables, 66/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1168 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 433/1601 variables, 151/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1601 variables, 199/803 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1601 variables, 4/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1601 variables, 4/811 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1601 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/1602 variables, 1/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1602 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1602 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 79/1681 variables, 71/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1681 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 9/1690 variables, 5/889 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1690 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 4/1694 variables, 3/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1694 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1694 variables, 2/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1694 variables, 1/895 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1694 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/1694 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 895 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7081 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 617/617 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 8611ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 24467 steps, including 60 resets, run visited all 1 properties in 101 ms. (steps per millisecond=242 )
Parikh walk visited 4 properties in 1066 ms.
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), false, false, p0, p0, false]
[2026-05-25 09:40:39] [INFO ] Flow matrix only has 1079 transitions (discarded 541 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12747777023581255178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2092441694603969795.kers'
[2026-05-25 09:40:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12747777023581255178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2092441694603969795.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1079 rows 617 cols 2960 entries
Finished phase 1 with 614 SingleSign rule and 1 generalized
[2026-05-25 09:40:39] [INFO ] Computed 2 invariants in 13 ms
Computed 2 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-2092441694603969795.kers
Total runtime 15 ms.
[2026-05-25 09:40:40] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2026-05-25 09:40:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:40:54] [INFO ] [Real]Absence check using state equation in 14184 ms returned unknown
Could not prove EG (NOT p1)
Knowledge-based reduction took 38012 ms.
Stuttering acceptance computed with spot in 365 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), false, false, p0, p0, false]
Stuttering acceptance computed with spot in 362 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), false, false, p0, p0, false]
Product exploration explored 100000 steps with 751 reset in 648 ms.
Product exploration explored 100000 steps with 766 reset in 704 ms.
Spot run failed in 71 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/ltsmin17784071553026416594
[2026-05-25 09:40:56] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17784071553026416594
Running compilation step : cd /tmp/ltsmin17784071553026416594;'/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 2973 ms.
Running link step : cd /tmp/ltsmin17784071553026416594;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin17784071553026416594;'/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/stateBased5803997051741002800.hoa' '--buchi-type=spotba'
LTSmin run took 136 ms.
FORMULA FunctionPointer-PT-c064-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-c064-LTLFireability-15 finished in 152940 ms.
All properties solved by simple procedures.
Total runtime 715895 ms.

BK_STOP 1779702060005

--------------------
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-c064"
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-c064, 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-177961074000156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c064.tgz
mv FunctionPointer-PT-c064 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 ;