Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020100300.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyB-PT-B03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020100300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Mar 7 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 626K 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 MedleyB-PT-B03-LTLFireability-00
FORMULA_NAME MedleyB-PT-B03-LTLFireability-01
FORMULA_NAME MedleyB-PT-B03-LTLFireability-02
FORMULA_NAME MedleyB-PT-B03-LTLFireability-03
FORMULA_NAME MedleyB-PT-B03-LTLFireability-04
FORMULA_NAME MedleyB-PT-B03-LTLFireability-05
FORMULA_NAME MedleyB-PT-B03-LTLFireability-06
FORMULA_NAME MedleyB-PT-B03-LTLFireability-07
FORMULA_NAME MedleyB-PT-B03-LTLFireability-08
FORMULA_NAME MedleyB-PT-B03-LTLFireability-09
FORMULA_NAME MedleyB-PT-B03-LTLFireability-10
FORMULA_NAME MedleyB-PT-B03-LTLFireability-11
FORMULA_NAME MedleyB-PT-B03-LTLFireability-12
FORMULA_NAME MedleyB-PT-B03-LTLFireability-13
FORMULA_NAME MedleyB-PT-B03-LTLFireability-14
FORMULA_NAME MedleyB-PT-B03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779705367668

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 10:36:09] [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 10:36:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:36:09] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2026-05-25 10:36:09] [INFO ] Transformed 1529 places.
[2026-05-25 10:36:09] [INFO ] Transformed 2131 transitions.
[2026-05-25 10:36:09] [INFO ] Found NUPN structural information;
[2026-05-25 10:36:09] [INFO ] Parsed PT model containing 1529 places and 2131 transitions and 8591 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MedleyB-PT-B03-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 1529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1529/1529 places, 2131/2131 transitions.
Discarding 122 places :
Symmetric choice reduction at 0 with 122 rule applications. Total rules 122 place count 1407 transition count 2009
Iterating global reduction 0 with 122 rules applied. Total rules applied 244 place count 1407 transition count 2009
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 317 place count 1334 transition count 1936
Iterating global reduction 0 with 73 rules applied. Total rules applied 390 place count 1334 transition count 1936
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 432 place count 1292 transition count 1894
Iterating global reduction 0 with 42 rules applied. Total rules applied 474 place count 1292 transition count 1894
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 508 place count 1258 transition count 1860
Iterating global reduction 0 with 34 rules applied. Total rules applied 542 place count 1258 transition count 1860
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 570 place count 1230 transition count 1832
Iterating global reduction 0 with 28 rules applied. Total rules applied 598 place count 1230 transition count 1832
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 626 place count 1202 transition count 1804
Iterating global reduction 0 with 28 rules applied. Total rules applied 654 place count 1202 transition count 1804
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 682 place count 1174 transition count 1776
Iterating global reduction 0 with 28 rules applied. Total rules applied 710 place count 1174 transition count 1776
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 737 place count 1147 transition count 1749
Iterating global reduction 0 with 27 rules applied. Total rules applied 764 place count 1147 transition count 1749
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 789 place count 1122 transition count 1724
Iterating global reduction 0 with 25 rules applied. Total rules applied 814 place count 1122 transition count 1724
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 832 place count 1104 transition count 1706
Iterating global reduction 0 with 18 rules applied. Total rules applied 850 place count 1104 transition count 1706
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 853 place count 1104 transition count 1703
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 857 place count 1100 transition count 1699
Iterating global reduction 1 with 4 rules applied. Total rules applied 861 place count 1100 transition count 1699
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 865 place count 1096 transition count 1695
Iterating global reduction 1 with 4 rules applied. Total rules applied 869 place count 1096 transition count 1695
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 870 place count 1095 transition count 1694
Iterating global reduction 1 with 1 rules applied. Total rules applied 871 place count 1095 transition count 1694
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 872 place count 1094 transition count 1693
Iterating global reduction 1 with 1 rules applied. Total rules applied 873 place count 1094 transition count 1693
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 874 place count 1093 transition count 1692
Iterating global reduction 1 with 1 rules applied. Total rules applied 875 place count 1093 transition count 1692
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 876 place count 1092 transition count 1691
Iterating global reduction 1 with 1 rules applied. Total rules applied 877 place count 1092 transition count 1691
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 878 place count 1091 transition count 1690
Iterating global reduction 1 with 1 rules applied. Total rules applied 879 place count 1091 transition count 1690
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 880 place count 1090 transition count 1689
Iterating global reduction 1 with 1 rules applied. Total rules applied 881 place count 1090 transition count 1689
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 882 place count 1089 transition count 1688
Iterating global reduction 1 with 1 rules applied. Total rules applied 883 place count 1089 transition count 1688
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 884 place count 1088 transition count 1687
Iterating global reduction 1 with 1 rules applied. Total rules applied 885 place count 1088 transition count 1687
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 886 place count 1087 transition count 1686
Iterating global reduction 1 with 1 rules applied. Total rules applied 887 place count 1087 transition count 1686
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 888 place count 1086 transition count 1685
Iterating global reduction 1 with 1 rules applied. Total rules applied 889 place count 1086 transition count 1685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 890 place count 1086 transition count 1684
Applied a total of 890 rules in 1495 ms. Remains 1086 /1529 variables (removed 443) and now considering 1684/2131 (removed 447) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15655800335919933502.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-886930299663941529.kers'
[2026-05-25 10:36:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15655800335919933502.kers, --Pflows, --basisKERS=/tmp/petrispot-output-886930299663941529.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1684 rows 1086 cols 7683 entries
Finished phase 1 with 1080 SingleSign rule and 0 generalized
[2026-05-25 10:36:11] [INFO ] Computed 6 invariants in 17 ms
Computed 6 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-886930299663941529.kers
Total runtime 20 ms.
[2026-05-25 10:36:12] [INFO ] Implicit Places using invariants in 789 ms returned []
[2026-05-25 10:36:12] [INFO ] Invariant cache hit.
[2026-05-25 10:36:13] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
Running 1683 sub problems to find dead transitions.
[2026-05-25 10:36:13] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1085/2770 variables, and 0 constraints, problems are : Problem set: 0 solved, 1683 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1086 constraints, PredecessorRefiner: 1683/1683 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1683 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1085/2770 variables, and 0 constraints, problems are : Problem set: 0 solved, 1683 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1086 constraints, PredecessorRefiner: 0/1683 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61707ms problems are : Problem set: 0 solved, 1683 unsolved
Search for dead transitions found 0 dead transitions in 61730ms
Starting structural reductions in LTL mode, iteration 1 : 1086/1529 places, 1684/2131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65390 ms. Remains : 1086/1529 places, 1684/2131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Applied a total of 0 rules in 35 ms. Remains 1086 /1086 variables (removed 0) and now considering 1684/1684 (removed 0) transitions.
[2026-05-25 10:37:15] [INFO ] Invariant cache hit.
[2026-05-25 10:37:15] [INFO ] Implicit Places using invariants in 471 ms returned []
[2026-05-25 10:37:15] [INFO ] Invariant cache hit.
[2026-05-25 10:37:16] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1782 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1818 ms. Remains : 1086/1086 places, 1684/1684 transitions.
Support contains 55 out of 1086 places after structural reductions.
[2026-05-25 10:37:17] [INFO ] Flatten gal took : 142 ms
[2026-05-25 10:37:17] [INFO ] Flatten gal took : 83 ms
[2026-05-25 10:37:17] [INFO ] Input system was already deterministic with 1684 transitions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (423 resets) in 1487 ms. (26 steps per ms) remains 29/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
[2026-05-25 10:37:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 1034/1086 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
SMT process timed out in 5469ms, After SMT, problems are : Problem set: 0 solved, 29 unsolved
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 52 out of 1086 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Graph (trivial) has 975 edges and 1086 vertex of which 73 / 1086 are part of one of the 14 SCC in 20 ms
Free SCC test removed 59 places
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Graph (complete) has 1727 edges and 1027 vertex of which 1022 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 687 transitions
Trivial Post-agglo rules discarded 687 transitions
Performed 687 trivial Post agglomeration. Transition count delta: 687
Iterating post reduction 0 with 691 rules applied. Total rules applied 693 place count 1022 transition count 911
Reduce places removed 687 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 704 rules applied. Total rules applied 1397 place count 335 transition count 894
Reduce places removed 7 places and 0 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 2 with 42 rules applied. Total rules applied 1439 place count 328 transition count 859
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 1475 place count 293 transition count 858
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 1475 place count 293 transition count 800
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1591 place count 235 transition count 800
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1661 place count 200 transition count 765
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1670 place count 200 transition count 756
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1685 place count 185 transition count 741
Iterating global reduction 5 with 15 rules applied. Total rules applied 1700 place count 185 transition count 741
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1702 place count 185 transition count 739
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1713 place count 174 transition count 725
Iterating global reduction 6 with 11 rules applied. Total rules applied 1724 place count 174 transition count 725
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1732 place count 166 transition count 717
Iterating global reduction 6 with 8 rules applied. Total rules applied 1740 place count 166 transition count 717
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1744 place count 166 transition count 713
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1754 place count 161 transition count 708
Performed 5 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1764 place count 156 transition count 722
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1765 place count 156 transition count 721
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 1774 place count 156 transition count 712
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1783 place count 147 transition count 712
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 1792 place count 147 transition count 712
Applied a total of 1792 rules in 297 ms. Remains 147 /1086 variables (removed 939) and now considering 712/1684 (removed 972) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 147/1086 places, 712/1684 transitions.
RANDOM walk for 40000 steps (2946 resets) in 517 ms. (77 steps per ms) remains 26/29 properties
BEST_FIRST walk for 4003 steps (38 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (37 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (41 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (41 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (39 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (39 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (39 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (39 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (36 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (37 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (38 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (37 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (36 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (38 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (40 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (40 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (38 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (35 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (39 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (38 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9636260203619559661.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5513833020492135084.kers'
[2026-05-25 10:37:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9636260203619559661.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5513833020492135084.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 712 rows 147 cols 5611 entries
Finished phase 1 with 142 SingleSign rule and 0 generalized
[2026-05-25 10:37:24] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5513833020492135084.kers
Total runtime 4 ms.
[2026-05-25 10:37:24] [INFO ] State equation strengthened by 97 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 77/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 712/838 variables, 126/131 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/838 variables, 97/228 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/838 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 21/859 variables, 21/249 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/859 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/859 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 0/859 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 859/859 variables, and 251 constraints, problems are : Problem set: 0 solved, 26 unsolved in 4017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 147/147 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 77/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 712/838 variables, 126/134 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 97/231 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/838 variables, 10/241 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/838 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/838 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 21/859 variables, 21/263 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/859 variables, 16/279 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/859 variables, 6/285 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/859 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/859 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/859 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 17 (OVERLAPS) 0/859 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 859/859 variables, and 291 constraints, problems are : Problem set: 0 solved, 26 unsolved in 16394 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 147/147 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20453ms problems are : Problem set: 0 solved, 26 unsolved
Parikh walk visited 0 properties in 1473 ms.
Support contains 49 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 712/712 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 710
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 145 transition count 710
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 145 transition count 708
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 143 transition count 708
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 142 transition count 707
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 142 transition count 707
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 141 transition count 706
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 140 transition count 705
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 140 transition count 705
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 139 transition count 704
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 139 transition count 704
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 24 place count 139 transition count 696
Applied a total of 24 rules in 44 ms. Remains 139 /147 variables (removed 8) and now considering 696/712 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 139/147 places, 696/712 transitions.
RANDOM walk for 40000 steps (2885 resets) in 281 ms. (141 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4003 steps (41 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (43 resets) in 7 ms. (500 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (38 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (40 resets) in 6 ms. (572 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (42 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (42 resets) in 7 ms. (500 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (40 resets) in 7 ms. (500 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (41 resets) in 5 ms. (667 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (42 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (41 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (32 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (44 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (35 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (43 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (42 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (41 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (42 resets) in 7 ms. (500 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (35 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (40 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (42 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (41 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (39 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (41 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 411868 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :2 out of 24
Probabilistic random walk after 411868 steps, saw 86946 distinct states, run finished after 3015 ms. (steps per millisecond=136 ) properties seen :2
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7175496984209422575.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15327355083827751271.kers'
[2026-05-25 10:37:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7175496984209422575.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15327355083827751271.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 696 rows 139 cols 5533 entries
Finished phase 1 with 134 SingleSign rule and 0 generalized
[2026-05-25 10:37:49] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15327355083827751271.kers
Total runtime 4 ms.
[2026-05-25 10:37:49] [INFO ] State equation strengthened by 97 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 79/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 694/810 variables, 116/121 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 97/218 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/810 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 25/835 variables, 23/241 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/835 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/835 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 835/835 variables, and 241 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1610 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 139/139 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 79/116 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 694/810 variables, 116/121 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/810 variables, 97/218 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/810 variables, 9/227 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 25/835 variables, 23/250 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/835 variables, 13/263 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/835 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/835 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/835 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 0/835 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 835/835 variables, and 266 constraints, problems are : Problem set: 0 solved, 22 unsolved in 6423 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 139/139 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8086ms problems are : Problem set: 0 solved, 22 unsolved
Parikh walk visited 1 properties in 903 ms.
Support contains 33 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 696/696 transitions.
Graph (trivial) has 18 edges and 139 vertex of which 2 / 139 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 138 transition count 681
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 125 transition count 681
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 35 place count 117 transition count 342
Iterating global reduction 2 with 8 rules applied. Total rules applied 43 place count 117 transition count 342
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 50 place count 117 transition count 335
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 116 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 116 transition count 333
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 54 place count 115 transition count 332
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 115 transition count 332
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 115 transition count 331
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 73 place count 114 transition count 315
Applied a total of 73 rules in 36 ms. Remains 114 /139 variables (removed 25) and now considering 315/696 (removed 381) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 114/139 places, 315/696 transitions.
RANDOM walk for 40000 steps (2747 resets) in 269 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (43 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (46 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (45 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (41 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (43 resets) in 7 ms. (500 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (45 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (42 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (48 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (37 resets) in 7 ms. (500 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (47 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (40 resets) in 7 ms. (500 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (41 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (36 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (39 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (43 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (44 resets) in 6 ms. (572 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (45 resets) in 7 ms. (500 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (48 resets) in 6 ms. (572 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (42 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 574586 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :1 out of 21
Probabilistic random walk after 574586 steps, saw 113094 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :1
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8012084258333137439.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6333657668508037851.kers'
[2026-05-25 10:38:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8012084258333137439.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6333657668508037851.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 114 cols 2111 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-25 10:38:01] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6333657668508037851.kers
Total runtime 2 ms.
[2026-05-25 10:38:01] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 64/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 315/410 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 32/132 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 19/429 variables, 19/151 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/429 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 151 constraints, problems are : Problem set: 0 solved, 20 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 114/114 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 64/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 315/410 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 32/132 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 9/141 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 19/429 variables, 19/160 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 11/171 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/429 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 171 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2532 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 114/114 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3248ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 1 properties in 691 ms.
Support contains 25 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 315/315 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 313
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 112 transition count 313
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 112 transition count 311
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 110 transition count 311
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 108 transition count 251
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 108 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 108 transition count 250
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 105 transition count 247
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 105 transition count 246
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 21 place count 104 transition count 245
Iterating global reduction 4 with 1 rules applied. Total rules applied 22 place count 104 transition count 245
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 23 place count 103 transition count 244
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 103 transition count 244
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 25 place count 102 transition count 243
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 102 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 27 place count 102 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 28 place count 102 transition count 241
Free-agglomeration rule applied 22 times.
Iterating global reduction 5 with 22 rules applied. Total rules applied 50 place count 102 transition count 219
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 73 place count 80 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 6 with 28 rules applied. Total rules applied 101 place count 80 transition count 190
Applied a total of 101 rules in 33 ms. Remains 80 /114 variables (removed 34) and now considering 190/315 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 80/114 places, 190/315 transitions.
RANDOM walk for 40000 steps (28 resets) in 339 ms. (117 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (35 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (33 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (31 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (32 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (39 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (27 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (18 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (24 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (27 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (50 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (36 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (39 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (38 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (40 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (31 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (58 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
Finished probabilistic random walk after 972470 steps, run visited all 18 properties in 2901 ms. (steps per millisecond=335 )
Probabilistic random walk after 972470 steps, saw 185017 distinct states, run finished after 2908 ms. (steps per millisecond=334 ) properties seen :18
Computed a total of 205 stabilizing places and 215 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 1086 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Graph (trivial) has 1043 edges and 1086 vertex of which 80 / 1086 are part of one of the 15 SCC in 1 ms
Free SCC test removed 65 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 734 transitions
Trivial Post-agglo rules discarded 734 transitions
Performed 734 trivial Post agglomeration. Transition count delta: 734
Iterating post reduction 0 with 734 rules applied. Total rules applied 735 place count 1020 transition count 874
Reduce places removed 734 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 749 rules applied. Total rules applied 1484 place count 286 transition count 859
Reduce places removed 5 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 29 rules applied. Total rules applied 1513 place count 281 transition count 835
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1537 place count 257 transition count 835
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 1537 place count 257 transition count 779
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 1649 place count 201 transition count 779
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1660 place count 190 transition count 768
Iterating global reduction 4 with 11 rules applied. Total rules applied 1671 place count 190 transition count 768
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1676 place count 185 transition count 763
Iterating global reduction 4 with 5 rules applied. Total rules applied 1681 place count 185 transition count 763
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1682 place count 185 transition count 762
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1683 place count 184 transition count 761
Iterating global reduction 5 with 1 rules applied. Total rules applied 1684 place count 184 transition count 761
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1685 place count 183 transition count 760
Iterating global reduction 5 with 1 rules applied. Total rules applied 1686 place count 183 transition count 760
Performed 37 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1760 place count 146 transition count 721
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 1789 place count 117 transition count 275
Iterating global reduction 5 with 29 rules applied. Total rules applied 1818 place count 117 transition count 275
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1832 place count 117 transition count 261
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1849 place count 100 transition count 239
Iterating global reduction 6 with 17 rules applied. Total rules applied 1866 place count 100 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1867 place count 100 transition count 238
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1883 place count 84 transition count 217
Iterating global reduction 7 with 16 rules applied. Total rules applied 1899 place count 84 transition count 217
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1906 place count 84 transition count 210
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1924 place count 75 transition count 217
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1925 place count 74 transition count 207
Iterating global reduction 8 with 1 rules applied. Total rules applied 1926 place count 74 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1927 place count 74 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1932 place count 74 transition count 201
Applied a total of 1932 rules in 104 ms. Remains 74 /1086 variables (removed 1012) and now considering 201/1684 (removed 1483) transitions.
[2026-05-25 10:38:09] [INFO ] Flow matrix only has 196 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2400805478822135509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2950507486856979241.kers'
[2026-05-25 10:38:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2400805478822135509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2950507486856979241.kers]
Normalized transition count is 195 out of 196 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 195 rows 73 cols 1194 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-25 10:38:09] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2950507486856979241.kers
Total runtime 1 ms.
[2026-05-25 10:38:09] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 10:38:09] [INFO ] Flow matrix only has 196 transitions (discarded 5 similar events)
[2026-05-25 10:38:09] [INFO ] Invariant cache hit.
[2026-05-25 10:38:09] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 10:38:10] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2026-05-25 10:38:10] [INFO ] Redundant transitions in 4 ms returned []
Running 184 sub problems to find dead transitions.
[2026-05-25 10:38:10] [INFO ] Flow matrix only has 196 transitions (discarded 5 similar events)
[2026-05-25 10:38:10] [INFO ] Invariant cache hit.
[2026-05-25 10:38:10] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 195/269 variables, 74/95 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 16/111 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 1/270 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (OVERLAPS) 0/270 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 114 constraints, problems are : Problem set: 0 solved, 184 unsolved in 22200 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 195/269 variables, 74/98 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 16/114 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 184/298 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (OVERLAPS) 1/270 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 305 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52285ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 52286ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/1086 places, 201/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52594 ms. Remains : 74/1086 places, 201/1684 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 261 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-00
Product exploration explored 100000 steps with 9149 reset in 259 ms.
Product exploration explored 100000 steps with 9172 reset in 177 ms.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (3663 resets) in 437 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33169 steps (382 resets) in 165 ms. (199 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Knowledge-based reduction took 349 ms.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 201/201 transitions.
Applied a total of 0 rules in 7 ms. Remains 74 /74 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2026-05-25 10:39:03] [INFO ] Flow matrix only has 196 transitions (discarded 5 similar events)
[2026-05-25 10:39:03] [INFO ] Invariant cache hit.
[2026-05-25 10:39:03] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-25 10:39:03] [INFO ] Flow matrix only has 196 transitions (discarded 5 similar events)
[2026-05-25 10:39:03] [INFO ] Invariant cache hit.
[2026-05-25 10:39:03] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 10:39:03] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2026-05-25 10:39:03] [INFO ] Redundant transitions in 11 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 335 ms. Remains : 74/74 places, 201/201 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (3662 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (469 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 226117 steps, run visited all 1 properties in 307 ms. (steps per millisecond=736 )
Probabilistic random walk after 226117 steps, saw 49161 distinct states, run finished after 307 ms. (steps per millisecond=736 ) properties seen :1
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Knowledge-based reduction took 614 ms.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5386 reset in 148 ms.
Product exploration explored 100000 steps with 9130 reset in 223 ms.
Built C files in :
/tmp/ltsmin9258445246931131644
[2026-05-25 10:39:04] [INFO ] Computing symmetric may disable matrix : 201 transitions.
[2026-05-25 10:39:04] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:39:04] [INFO ] Computing symmetric may enable matrix : 201 transitions.
[2026-05-25 10:39:04] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:39:05] [INFO ] Computing Do-Not-Accords matrix : 201 transitions.
[2026-05-25 10:39:05] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:39:05] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9258445246931131644
Running compilation step : cd /tmp/ltsmin9258445246931131644;'/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 610 ms.
Running link step : cd /tmp/ltsmin9258445246931131644;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin9258445246931131644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13126869784128809884.hoa' '--buchi-type=spotba'
LTSmin run took 1001 ms.
FORMULA MedleyB-PT-B03-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyB-PT-B03-LTLFireability-00 finished in 57101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p0&&(F(p1) U X(X(!p0))))))))'
Support contains 3 out of 1086 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1074 transition count 1672
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1074 transition count 1672
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1074 transition count 1671
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 1064 transition count 1661
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 1064 transition count 1661
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 1056 transition count 1653
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 1056 transition count 1653
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 1048 transition count 1645
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 1048 transition count 1645
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 84 place count 1041 transition count 1638
Iterating global reduction 1 with 7 rules applied. Total rules applied 91 place count 1041 transition count 1638
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 98 place count 1034 transition count 1631
Iterating global reduction 1 with 7 rules applied. Total rules applied 105 place count 1034 transition count 1631
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 112 place count 1027 transition count 1624
Iterating global reduction 1 with 7 rules applied. Total rules applied 119 place count 1027 transition count 1624
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 1027 transition count 1623
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 125 place count 1022 transition count 1618
Iterating global reduction 2 with 5 rules applied. Total rules applied 130 place count 1022 transition count 1618
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 135 place count 1017 transition count 1613
Iterating global reduction 2 with 5 rules applied. Total rules applied 140 place count 1017 transition count 1613
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 145 place count 1012 transition count 1608
Iterating global reduction 2 with 5 rules applied. Total rules applied 150 place count 1012 transition count 1608
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 155 place count 1007 transition count 1603
Iterating global reduction 2 with 5 rules applied. Total rules applied 160 place count 1007 transition count 1603
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 164 place count 1003 transition count 1599
Iterating global reduction 2 with 4 rules applied. Total rules applied 168 place count 1003 transition count 1599
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 171 place count 1000 transition count 1596
Iterating global reduction 2 with 3 rules applied. Total rules applied 174 place count 1000 transition count 1596
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 1000 transition count 1595
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 998 transition count 1593
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 998 transition count 1593
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 181 place count 996 transition count 1591
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 996 transition count 1591
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 185 place count 994 transition count 1589
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 994 transition count 1589
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 189 place count 992 transition count 1587
Iterating global reduction 3 with 2 rules applied. Total rules applied 191 place count 992 transition count 1587
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 193 place count 990 transition count 1585
Iterating global reduction 3 with 2 rules applied. Total rules applied 195 place count 990 transition count 1585
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 197 place count 988 transition count 1583
Iterating global reduction 3 with 2 rules applied. Total rules applied 199 place count 988 transition count 1583
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 201 place count 988 transition count 1581
Applied a total of 201 rules in 806 ms. Remains 988 /1086 variables (removed 98) and now considering 1581/1684 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4391314645395442524.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11978251443446027594.kers'
[2026-05-25 10:39:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4391314645395442524.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11978251443446027594.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1581 rows 988 cols 7453 entries
Finished phase 1 with 982 SingleSign rule and 0 generalized
[2026-05-25 10:39:07] [INFO ] Computed 6 invariants in 25 ms
Computed 6 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-11978251443446027594.kers
Total runtime 27 ms.
[2026-05-25 10:39:08] [INFO ] Implicit Places using invariants in 886 ms returned []
[2026-05-25 10:39:08] [INFO ] Invariant cache hit.
[2026-05-25 10:39:09] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 2145 ms to find 0 implicit places.
Running 1580 sub problems to find dead transitions.
[2026-05-25 10:39:09] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/2569 variables, and 0 constraints, problems are : Problem set: 0 solved, 1580 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 1580/1580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1580 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/2569 variables, and 0 constraints, problems are : Problem set: 0 solved, 1580 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 0/1580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61325ms problems are : Problem set: 0 solved, 1580 unsolved
Search for dead transitions found 0 dead transitions in 61343ms
Starting structural reductions in LTL mode, iteration 1 : 988/1086 places, 1581/1684 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64302 ms. Remains : 988/1086 places, 1581/1684 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p0&&(F(p1) U X(X(!p0))))))))'
Stuttering acceptance computed with spot in 492 ms :[(NOT p0), (NOT p0), true, false, false, (AND (NOT p1) p0), (AND (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 282 ms.
Product exploration explored 100000 steps with 33333 reset in 268 ms.
Computed a total of 205 stabilizing places and 215 stable transitions
Computed a total of 205 stabilizing places and 215 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 12 ms. Proved property starting from automaton with 9 states, 13 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 26 ms.
FORMULA MedleyB-PT-B03-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B03-LTLFireability-01 finished in 65451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((F(G((p0 U X(p1)))) U (p2&&F(p3))))))'
Support contains 4 out of 1086 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1076 transition count 1674
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1076 transition count 1674
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1066 transition count 1664
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1066 transition count 1664
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 1058 transition count 1656
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 1058 transition count 1656
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 1050 transition count 1648
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 1050 transition count 1648
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 1044 transition count 1642
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 1044 transition count 1642
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 1038 transition count 1636
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 1038 transition count 1636
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 1032 transition count 1630
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 1032 transition count 1630
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 109 place count 1032 transition count 1629
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 112 place count 1029 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 115 place count 1029 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 118 place count 1026 transition count 1623
Iterating global reduction 1 with 3 rules applied. Total rules applied 121 place count 1026 transition count 1623
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 124 place count 1023 transition count 1620
Iterating global reduction 1 with 3 rules applied. Total rules applied 127 place count 1023 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 130 place count 1020 transition count 1617
Iterating global reduction 1 with 3 rules applied. Total rules applied 133 place count 1020 transition count 1617
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 136 place count 1017 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 139 place count 1017 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 1014 transition count 1611
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 1014 transition count 1611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 146 place count 1014 transition count 1610
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 148 place count 1012 transition count 1608
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 1012 transition count 1608
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 152 place count 1010 transition count 1606
Iterating global reduction 2 with 2 rules applied. Total rules applied 154 place count 1010 transition count 1606
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 156 place count 1008 transition count 1604
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 1008 transition count 1604
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 160 place count 1006 transition count 1602
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 1006 transition count 1602
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 164 place count 1004 transition count 1600
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 1004 transition count 1600
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 168 place count 1002 transition count 1598
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 1002 transition count 1598
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 171 place count 1002 transition count 1597
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 172 place count 1001 transition count 1596
Iterating global reduction 3 with 1 rules applied. Total rules applied 173 place count 1001 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 1000 transition count 1595
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 1000 transition count 1595
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 176 place count 1000 transition count 1594
Applied a total of 176 rules in 765 ms. Remains 1000 /1086 variables (removed 86) and now considering 1594/1684 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4164226948575139411.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-453496213335705552.kers'
[2026-05-25 10:40:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4164226948575139411.kers, --Pflows, --basisKERS=/tmp/petrispot-output-453496213335705552.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1594 rows 1000 cols 7485 entries
Finished phase 1 with 994 SingleSign rule and 0 generalized
[2026-05-25 10:40:12] [INFO ] Computed 6 invariants in 8 ms
Computed 6 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-453496213335705552.kers
Total runtime 12 ms.
[2026-05-25 10:40:13] [INFO ] Implicit Places using invariants in 637 ms returned []
[2026-05-25 10:40:13] [INFO ] Invariant cache hit.
[2026-05-25 10:40:14] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 1875 ms to find 0 implicit places.
Running 1593 sub problems to find dead transitions.
[2026-05-25 10:40:14] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/2594 variables, and 0 constraints, problems are : Problem set: 0 solved, 1593 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 1593/1593 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1593 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/2594 variables, and 0 constraints, problems are : Problem set: 0 solved, 1593 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/1593 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61284ms problems are : Problem set: 0 solved, 1593 unsolved
Search for dead transitions found 0 dead transitions in 61290ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1086 places, 1594/1684 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63942 ms. Remains : 1000/1086 places, 1594/1684 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((F(G((p0 U X(p1)))) U (p2&&F(p3))))))'
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p1), (NOT p1), (NOT p3), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-02
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-02 finished in 64320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1086 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Graph (trivial) has 1076 edges and 1086 vertex of which 80 / 1086 are part of one of the 15 SCC in 1 ms
Free SCC test removed 65 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 758 transitions
Trivial Post-agglo rules discarded 758 transitions
Performed 758 trivial Post agglomeration. Transition count delta: 758
Iterating post reduction 0 with 758 rules applied. Total rules applied 759 place count 1020 transition count 850
Reduce places removed 758 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 773 rules applied. Total rules applied 1532 place count 262 transition count 835
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 1538 place count 257 transition count 834
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1539 place count 256 transition count 834
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 1539 place count 256 transition count 776
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1655 place count 198 transition count 776
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1667 place count 186 transition count 764
Iterating global reduction 4 with 12 rules applied. Total rules applied 1679 place count 186 transition count 764
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1684 place count 181 transition count 759
Iterating global reduction 4 with 5 rules applied. Total rules applied 1689 place count 181 transition count 759
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1690 place count 181 transition count 758
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1691 place count 180 transition count 757
Iterating global reduction 5 with 1 rules applied. Total rules applied 1692 place count 180 transition count 757
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1693 place count 179 transition count 756
Iterating global reduction 5 with 1 rules applied. Total rules applied 1694 place count 179 transition count 756
Performed 37 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1768 place count 142 transition count 717
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 1798 place count 112 transition count 270
Iterating global reduction 5 with 30 rules applied. Total rules applied 1828 place count 112 transition count 270
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1842 place count 112 transition count 256
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1860 place count 94 transition count 233
Iterating global reduction 6 with 18 rules applied. Total rules applied 1878 place count 94 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1879 place count 94 transition count 232
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1895 place count 78 transition count 211
Iterating global reduction 7 with 16 rules applied. Total rules applied 1911 place count 78 transition count 211
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1918 place count 78 transition count 204
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1936 place count 69 transition count 218
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1937 place count 68 transition count 208
Iterating global reduction 8 with 1 rules applied. Total rules applied 1938 place count 68 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1939 place count 68 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1944 place count 68 transition count 202
Applied a total of 1944 rules in 99 ms. Remains 68 /1086 variables (removed 1018) and now considering 202/1684 (removed 1482) transitions.
[2026-05-25 10:41:16] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11829906802865288472.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10529598394561522792.kers'
[2026-05-25 10:41:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11829906802865288472.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10529598394561522792.kers]
Normalized transition count is 195 out of 196 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 195 rows 67 cols 1100 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-25 10:41:16] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10529598394561522792.kers
Total runtime 1 ms.
[2026-05-25 10:41:16] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 10:41:16] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
[2026-05-25 10:41:16] [INFO ] Invariant cache hit.
[2026-05-25 10:41:16] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-25 10:41:16] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2026-05-25 10:41:16] [INFO ] Redundant transitions in 2 ms returned []
Running 177 sub problems to find dead transitions.
[2026-05-25 10:41:16] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
[2026-05-25 10:41:16] [INFO ] Invariant cache hit.
[2026-05-25 10:41:16] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 195/263 variables, 68/100 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 30/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (OVERLAPS) 1/264 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 14 (OVERLAPS) 0/264 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 16 (OVERLAPS) 0/264 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 133 constraints, problems are : Problem set: 0 solved, 177 unsolved in 19607 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 195/263 variables, 68/102 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 30/132 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 177/309 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 1/264 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/264 variables, and 311 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49681ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 49681ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/1086 places, 202/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50032 ms. Remains : 68/1086 places, 202/1684 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-03
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-03 finished in 50109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(F((p1&&X(p2))))))))'
Support contains 8 out of 1086 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1074 transition count 1672
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1074 transition count 1672
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1074 transition count 1671
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 1064 transition count 1661
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 1064 transition count 1661
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 1056 transition count 1653
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 1056 transition count 1653
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 1048 transition count 1645
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 1048 transition count 1645
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 84 place count 1041 transition count 1638
Iterating global reduction 1 with 7 rules applied. Total rules applied 91 place count 1041 transition count 1638
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 98 place count 1034 transition count 1631
Iterating global reduction 1 with 7 rules applied. Total rules applied 105 place count 1034 transition count 1631
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 112 place count 1027 transition count 1624
Iterating global reduction 1 with 7 rules applied. Total rules applied 119 place count 1027 transition count 1624
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 1027 transition count 1623
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 125 place count 1022 transition count 1618
Iterating global reduction 2 with 5 rules applied. Total rules applied 130 place count 1022 transition count 1618
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 135 place count 1017 transition count 1613
Iterating global reduction 2 with 5 rules applied. Total rules applied 140 place count 1017 transition count 1613
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 145 place count 1012 transition count 1608
Iterating global reduction 2 with 5 rules applied. Total rules applied 150 place count 1012 transition count 1608
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 155 place count 1007 transition count 1603
Iterating global reduction 2 with 5 rules applied. Total rules applied 160 place count 1007 transition count 1603
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 164 place count 1003 transition count 1599
Iterating global reduction 2 with 4 rules applied. Total rules applied 168 place count 1003 transition count 1599
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 172 place count 999 transition count 1595
Iterating global reduction 2 with 4 rules applied. Total rules applied 176 place count 999 transition count 1595
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 177 place count 999 transition count 1594
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 180 place count 996 transition count 1591
Iterating global reduction 3 with 3 rules applied. Total rules applied 183 place count 996 transition count 1591
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 993 transition count 1588
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 993 transition count 1588
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 192 place count 990 transition count 1585
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 990 transition count 1585
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 198 place count 987 transition count 1582
Iterating global reduction 3 with 3 rules applied. Total rules applied 201 place count 987 transition count 1582
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 204 place count 984 transition count 1579
Iterating global reduction 3 with 3 rules applied. Total rules applied 207 place count 984 transition count 1579
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 210 place count 981 transition count 1576
Iterating global reduction 3 with 3 rules applied. Total rules applied 213 place count 981 transition count 1576
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 215 place count 981 transition count 1574
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 216 place count 980 transition count 1573
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 980 transition count 1573
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 218 place count 979 transition count 1572
Iterating global reduction 4 with 1 rules applied. Total rules applied 219 place count 979 transition count 1572
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 220 place count 979 transition count 1571
Applied a total of 220 rules in 885 ms. Remains 979 /1086 variables (removed 107) and now considering 1571/1684 (removed 113) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7672112673029647884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17872575500399454877.kers'
[2026-05-25 10:42:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7672112673029647884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17872575500399454877.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1571 rows 979 cols 7431 entries
Finished phase 1 with 973 SingleSign rule and 0 generalized
[2026-05-25 10:42:07] [INFO ] Computed 6 invariants in 9 ms
Computed 6 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-17872575500399454877.kers
Total runtime 13 ms.
[2026-05-25 10:42:08] [INFO ] Implicit Places using invariants in 531 ms returned []
[2026-05-25 10:42:08] [INFO ] Invariant cache hit.
[2026-05-25 10:42:09] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
Running 1570 sub problems to find dead transitions.
[2026-05-25 10:42:09] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/979 constraints, PredecessorRefiner: 1570/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/979 constraints, PredecessorRefiner: 0/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61248ms problems are : Problem set: 0 solved, 1570 unsolved
Search for dead transitions found 0 dead transitions in 61255ms
Starting structural reductions in LTL mode, iteration 1 : 979/1086 places, 1571/1684 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63672 ms. Remains : 979/1086 places, 1571/1684 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(F((p0&&X(p1)))))&&p2)))'
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-04
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-04 finished in 63929 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 1 out of 1086 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Graph (trivial) has 1076 edges and 1086 vertex of which 80 / 1086 are part of one of the 15 SCC in 1 ms
Free SCC test removed 65 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 758 transitions
Trivial Post-agglo rules discarded 758 transitions
Performed 758 trivial Post agglomeration. Transition count delta: 758
Iterating post reduction 0 with 758 rules applied. Total rules applied 759 place count 1020 transition count 850
Reduce places removed 758 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 773 rules applied. Total rules applied 1532 place count 262 transition count 835
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1537 place count 257 transition count 835
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 1537 place count 257 transition count 776
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1655 place count 198 transition count 776
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1667 place count 186 transition count 764
Iterating global reduction 3 with 12 rules applied. Total rules applied 1679 place count 186 transition count 764
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1684 place count 181 transition count 759
Iterating global reduction 3 with 5 rules applied. Total rules applied 1689 place count 181 transition count 759
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1690 place count 181 transition count 758
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1691 place count 180 transition count 757
Iterating global reduction 4 with 1 rules applied. Total rules applied 1692 place count 180 transition count 757
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1693 place count 179 transition count 756
Iterating global reduction 4 with 1 rules applied. Total rules applied 1694 place count 179 transition count 756
Performed 37 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1768 place count 142 transition count 718
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 1798 place count 112 transition count 271
Iterating global reduction 4 with 30 rules applied. Total rules applied 1828 place count 112 transition count 271
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 1842 place count 112 transition count 257
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1860 place count 94 transition count 234
Iterating global reduction 5 with 18 rules applied. Total rules applied 1878 place count 94 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1879 place count 94 transition count 233
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1896 place count 77 transition count 211
Iterating global reduction 6 with 17 rules applied. Total rules applied 1913 place count 77 transition count 211
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1921 place count 77 transition count 203
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1939 place count 68 transition count 210
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1940 place count 67 transition count 200
Iterating global reduction 7 with 1 rules applied. Total rules applied 1941 place count 67 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1942 place count 67 transition count 199
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1947 place count 67 transition count 194
Applied a total of 1947 rules in 66 ms. Remains 67 /1086 variables (removed 1019) and now considering 194/1684 (removed 1490) transitions.
[2026-05-25 10:43:10] [INFO ] Flow matrix only has 188 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12070439112195413806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8154373666868816573.kers'
[2026-05-25 10:43:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12070439112195413806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8154373666868816573.kers]
Normalized transition count is 187 out of 188 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 187 rows 66 cols 1052 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-25 10:43:10] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8154373666868816573.kers
Total runtime 6 ms.
[2026-05-25 10:43:10] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 10:43:10] [INFO ] Flow matrix only has 188 transitions (discarded 6 similar events)
[2026-05-25 10:43:10] [INFO ] Invariant cache hit.
[2026-05-25 10:43:10] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-25 10:43:10] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2026-05-25 10:43:10] [INFO ] Redundant transitions in 1 ms returned []
Running 177 sub problems to find dead transitions.
[2026-05-25 10:43:10] [INFO ] Flow matrix only has 188 transitions (discarded 6 similar events)
[2026-05-25 10:43:10] [INFO ] Invariant cache hit.
[2026-05-25 10:43:10] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 187/254 variables, 67/93 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 30/123 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 1/255 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 12 (OVERLAPS) 0/255 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 126 constraints, problems are : Problem set: 0 solved, 177 unsolved in 16101 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 187/254 variables, 67/95 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 30/125 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 177/302 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 1/255 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 255/255 variables, and 305 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46199ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 46199ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/1086 places, 194/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46465 ms. Remains : 67/1086 places, 194/1684 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 130 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-05
Product exploration explored 100000 steps with 798 reset in 53 ms.
Product exploration explored 100000 steps with 10778 reset in 162 ms.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (4608 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (489 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 142788 steps, run visited all 1 properties in 181 ms. (steps per millisecond=788 )
Probabilistic random walk after 142788 steps, saw 34654 distinct states, run finished after 181 ms. (steps per millisecond=788 ) properties seen :1
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 538 ms.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 194/194 transitions.
Applied a total of 0 rules in 9 ms. Remains 67 /67 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2026-05-25 10:43:58] [INFO ] Flow matrix only has 188 transitions (discarded 6 similar events)
[2026-05-25 10:43:58] [INFO ] Invariant cache hit.
[2026-05-25 10:43:58] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-25 10:43:58] [INFO ] Flow matrix only has 188 transitions (discarded 6 similar events)
[2026-05-25 10:43:58] [INFO ] Invariant cache hit.
[2026-05-25 10:43:58] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-25 10:43:58] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2026-05-25 10:43:58] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 400 ms. Remains : 67/67 places, 194/194 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (4577 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (491 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 142788 steps, run visited all 1 properties in 190 ms. (steps per millisecond=751 )
Probabilistic random walk after 142788 steps, saw 34654 distinct states, run finished after 190 ms. (steps per millisecond=751 ) properties seen :1
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 519 ms.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11502 reset in 171 ms.
Stuttering criterion allowed to conclude after 55133 steps with 6351 reset in 78 ms.
FORMULA MedleyB-PT-B03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-05 finished in 48937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0) U X(p1))) U (((p3 U p0)&&p2) U p3)))'
Support contains 10 out of 1086 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1075 transition count 1673
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1075 transition count 1673
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1075 transition count 1672
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 1066 transition count 1663
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 1066 transition count 1663
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 1058 transition count 1655
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 1058 transition count 1655
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 1051 transition count 1648
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 1051 transition count 1648
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 77 place count 1045 transition count 1642
Iterating global reduction 1 with 6 rules applied. Total rules applied 83 place count 1045 transition count 1642
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 89 place count 1039 transition count 1636
Iterating global reduction 1 with 6 rules applied. Total rules applied 95 place count 1039 transition count 1636
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 101 place count 1033 transition count 1630
Iterating global reduction 1 with 6 rules applied. Total rules applied 107 place count 1033 transition count 1630
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 1033 transition count 1629
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 112 place count 1029 transition count 1625
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 1029 transition count 1625
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 1025 transition count 1621
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 1025 transition count 1621
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 128 place count 1021 transition count 1617
Iterating global reduction 2 with 4 rules applied. Total rules applied 132 place count 1021 transition count 1617
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 1017 transition count 1613
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 1017 transition count 1613
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 143 place count 1014 transition count 1610
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 1014 transition count 1610
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 149 place count 1011 transition count 1607
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 1011 transition count 1607
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 155 place count 1008 transition count 1604
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 1008 transition count 1604
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 161 place count 1005 transition count 1601
Iterating global reduction 2 with 3 rules applied. Total rules applied 164 place count 1005 transition count 1601
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 167 place count 1002 transition count 1598
Iterating global reduction 2 with 3 rules applied. Total rules applied 170 place count 1002 transition count 1598
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 173 place count 999 transition count 1595
Iterating global reduction 2 with 3 rules applied. Total rules applied 176 place count 999 transition count 1595
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 179 place count 996 transition count 1592
Iterating global reduction 2 with 3 rules applied. Total rules applied 182 place count 996 transition count 1592
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 185 place count 993 transition count 1589
Iterating global reduction 2 with 3 rules applied. Total rules applied 188 place count 993 transition count 1589
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 190 place count 993 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 191 place count 992 transition count 1586
Iterating global reduction 3 with 1 rules applied. Total rules applied 192 place count 992 transition count 1586
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 193 place count 991 transition count 1585
Iterating global reduction 3 with 1 rules applied. Total rules applied 194 place count 991 transition count 1585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 195 place count 991 transition count 1584
Applied a total of 195 rules in 791 ms. Remains 991 /1086 variables (removed 95) and now considering 1584/1684 (removed 100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11065290182577108740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17696891957718774210.kers'
[2026-05-25 10:44:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11065290182577108740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17696891957718774210.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1584 rows 991 cols 7461 entries
Finished phase 1 with 985 SingleSign rule and 0 generalized
[2026-05-25 10:44:00] [INFO ] Computed 6 invariants in 14 ms
Computed 6 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-17696891957718774210.kers
Total runtime 35 ms.
[2026-05-25 10:44:00] [INFO ] Implicit Places using invariants in 532 ms returned []
[2026-05-25 10:44:00] [INFO ] Invariant cache hit.
[2026-05-25 10:44:02] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 1799 ms to find 0 implicit places.
Running 1583 sub problems to find dead transitions.
[2026-05-25 10:44:02] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 990/2575 variables, and 0 constraints, problems are : Problem set: 0 solved, 1583 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/991 constraints, PredecessorRefiner: 1583/1583 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1583 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 990/2575 variables, and 0 constraints, problems are : Problem set: 0 solved, 1583 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/991 constraints, PredecessorRefiner: 0/1583 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61309ms problems are : Problem set: 0 solved, 1583 unsolved
Search for dead transitions found 0 dead transitions in 61314ms
Starting structural reductions in LTL mode, iteration 1 : 991/1086 places, 1584/1684 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63913 ms. Remains : 991/1086 places, 1584/1684 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0) U X(p1))) U (((p3 U p0)&&p2) U p3)))'
Stuttering acceptance computed with spot in 349 ms :[(NOT p3), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-06 finished in 64342 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((F(p0)&&(G(p1) U p2))))'
Support contains 3 out of 1086 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Graph (trivial) has 1072 edges and 1086 vertex of which 73 / 1086 are part of one of the 14 SCC in 0 ms
Free SCC test removed 59 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 756 transitions
Trivial Post-agglo rules discarded 756 transitions
Performed 756 trivial Post agglomeration. Transition count delta: 756
Iterating post reduction 0 with 756 rules applied. Total rules applied 757 place count 1026 transition count 859
Reduce places removed 756 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 774 rules applied. Total rules applied 1531 place count 270 transition count 841
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 1540 place count 263 transition count 839
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1542 place count 261 transition count 839
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 1542 place count 261 transition count 779
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 1662 place count 201 transition count 779
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1673 place count 190 transition count 768
Iterating global reduction 4 with 11 rules applied. Total rules applied 1684 place count 190 transition count 768
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1689 place count 185 transition count 763
Iterating global reduction 4 with 5 rules applied. Total rules applied 1694 place count 185 transition count 763
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1695 place count 185 transition count 762
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1696 place count 184 transition count 761
Iterating global reduction 5 with 1 rules applied. Total rules applied 1697 place count 184 transition count 761
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1698 place count 183 transition count 760
Iterating global reduction 5 with 1 rules applied. Total rules applied 1699 place count 183 transition count 760
Performed 37 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1773 place count 146 transition count 721
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 1801 place count 118 transition count 277
Iterating global reduction 5 with 28 rules applied. Total rules applied 1829 place count 118 transition count 277
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1842 place count 118 transition count 264
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1858 place count 102 transition count 244
Iterating global reduction 6 with 16 rules applied. Total rules applied 1874 place count 102 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1875 place count 102 transition count 243
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1890 place count 87 transition count 224
Iterating global reduction 7 with 15 rules applied. Total rules applied 1905 place count 87 transition count 224
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1912 place count 87 transition count 217
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1934 place count 76 transition count 223
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1935 place count 75 transition count 211
Iterating global reduction 8 with 1 rules applied. Total rules applied 1936 place count 75 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1937 place count 75 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1942 place count 75 transition count 205
Applied a total of 1942 rules in 64 ms. Remains 75 /1086 variables (removed 1011) and now considering 205/1684 (removed 1479) transitions.
[2026-05-25 10:45:03] [INFO ] Flow matrix only has 199 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15573999362430041436.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14128248343670134812.kers'
[2026-05-25 10:45:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15573999362430041436.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14128248343670134812.kers]
Normalized transition count is 198 out of 199 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 198 rows 74 cols 1076 entries
Finished phase 1 with 73 SingleSign rule and 0 generalized
[2026-05-25 10:45:03] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14128248343670134812.kers
Total runtime 1 ms.
[2026-05-25 10:45:04] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-25 10:45:04] [INFO ] Flow matrix only has 199 transitions (discarded 6 similar events)
[2026-05-25 10:45:04] [INFO ] Invariant cache hit.
[2026-05-25 10:45:04] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-25 10:45:04] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2026-05-25 10:45:04] [INFO ] Redundant transitions in 0 ms returned []
Running 188 sub problems to find dead transitions.
[2026-05-25 10:45:04] [INFO ] Flow matrix only has 199 transitions (discarded 6 similar events)
[2026-05-25 10:45:04] [INFO ] Invariant cache hit.
[2026-05-25 10:45:04] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (OVERLAPS) 198/273 variables, 75/104 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 30/134 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 12 (OVERLAPS) 1/274 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 14 (OVERLAPS) 0/274 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 135 constraints, problems are : Problem set: 0 solved, 188 unsolved in 18974 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (OVERLAPS) 198/273 variables, 75/104 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 30/134 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 188/322 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (OVERLAPS) 1/274 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 326 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49050ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 49051ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/1086 places, 205/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49389 ms. Remains : 75/1086 places, 205/1684 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((F(p0)&&(G(p1) U p2))))'
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-07
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-07 finished in 49567 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(F((p1||G(p2)))))))'
Support contains 8 out of 1086 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1074 transition count 1672
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1074 transition count 1672
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1074 transition count 1671
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 1064 transition count 1661
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 1064 transition count 1661
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 1056 transition count 1653
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 1056 transition count 1653
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 1048 transition count 1645
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 1048 transition count 1645
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 84 place count 1041 transition count 1638
Iterating global reduction 1 with 7 rules applied. Total rules applied 91 place count 1041 transition count 1638
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 98 place count 1034 transition count 1631
Iterating global reduction 1 with 7 rules applied. Total rules applied 105 place count 1034 transition count 1631
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 112 place count 1027 transition count 1624
Iterating global reduction 1 with 7 rules applied. Total rules applied 119 place count 1027 transition count 1624
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 1027 transition count 1623
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 125 place count 1022 transition count 1618
Iterating global reduction 2 with 5 rules applied. Total rules applied 130 place count 1022 transition count 1618
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 135 place count 1017 transition count 1613
Iterating global reduction 2 with 5 rules applied. Total rules applied 140 place count 1017 transition count 1613
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 145 place count 1012 transition count 1608
Iterating global reduction 2 with 5 rules applied. Total rules applied 150 place count 1012 transition count 1608
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 155 place count 1007 transition count 1603
Iterating global reduction 2 with 5 rules applied. Total rules applied 160 place count 1007 transition count 1603
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 164 place count 1003 transition count 1599
Iterating global reduction 2 with 4 rules applied. Total rules applied 168 place count 1003 transition count 1599
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 172 place count 999 transition count 1595
Iterating global reduction 2 with 4 rules applied. Total rules applied 176 place count 999 transition count 1595
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 177 place count 999 transition count 1594
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 180 place count 996 transition count 1591
Iterating global reduction 3 with 3 rules applied. Total rules applied 183 place count 996 transition count 1591
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 993 transition count 1588
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 993 transition count 1588
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 192 place count 990 transition count 1585
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 990 transition count 1585
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 198 place count 987 transition count 1582
Iterating global reduction 3 with 3 rules applied. Total rules applied 201 place count 987 transition count 1582
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 204 place count 984 transition count 1579
Iterating global reduction 3 with 3 rules applied. Total rules applied 207 place count 984 transition count 1579
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 210 place count 981 transition count 1576
Iterating global reduction 3 with 3 rules applied. Total rules applied 213 place count 981 transition count 1576
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 215 place count 981 transition count 1574
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 216 place count 980 transition count 1573
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 980 transition count 1573
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 218 place count 979 transition count 1572
Iterating global reduction 4 with 1 rules applied. Total rules applied 219 place count 979 transition count 1572
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 220 place count 979 transition count 1571
Applied a total of 220 rules in 756 ms. Remains 979 /1086 variables (removed 107) and now considering 1571/1684 (removed 113) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7334247113707328389.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4456319080104914139.kers'
[2026-05-25 10:45:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7334247113707328389.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4456319080104914139.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1571 rows 979 cols 7431 entries
Finished phase 1 with 973 SingleSign rule and 0 generalized
[2026-05-25 10:45:54] [INFO ] Computed 6 invariants in 8 ms
Computed 6 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4456319080104914139.kers
Total runtime 9 ms.
[2026-05-25 10:45:54] [INFO ] Implicit Places using invariants in 491 ms returned []
[2026-05-25 10:45:54] [INFO ] Invariant cache hit.
[2026-05-25 10:45:55] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
Running 1570 sub problems to find dead transitions.
[2026-05-25 10:45:55] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/979 constraints, PredecessorRefiner: 1570/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/979 constraints, PredecessorRefiner: 0/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61595ms problems are : Problem set: 0 solved, 1570 unsolved
Search for dead transitions found 0 dead transitions in 61598ms
Starting structural reductions in LTL mode, iteration 1 : 979/1086 places, 1571/1684 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64107 ms. Remains : 979/1086 places, 1571/1684 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(F((p1||G(p2)))))))'
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Computed a total of 205 stabilizing places and 215 stable transitions
Computed a total of 205 stabilizing places and 215 stable transitions
Detected a total of 205/979 stabilizing places and 215/1571 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 22 ms. Proved property starting from automaton with 3 states, 4 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 43 ms.
FORMULA MedleyB-PT-B03-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B03-LTLFireability-09 finished in 64988 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(p1)||G(p2)))&&p0) U X(X(X(p1)))))'
Support contains 9 out of 1086 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1074 transition count 1672
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1074 transition count 1672
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1074 transition count 1671
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 1064 transition count 1661
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 1064 transition count 1661
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 1056 transition count 1653
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 1056 transition count 1653
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 1048 transition count 1645
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 1048 transition count 1645
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 84 place count 1041 transition count 1638
Iterating global reduction 1 with 7 rules applied. Total rules applied 91 place count 1041 transition count 1638
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 98 place count 1034 transition count 1631
Iterating global reduction 1 with 7 rules applied. Total rules applied 105 place count 1034 transition count 1631
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 112 place count 1027 transition count 1624
Iterating global reduction 1 with 7 rules applied. Total rules applied 119 place count 1027 transition count 1624
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 1027 transition count 1623
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 125 place count 1022 transition count 1618
Iterating global reduction 2 with 5 rules applied. Total rules applied 130 place count 1022 transition count 1618
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 135 place count 1017 transition count 1613
Iterating global reduction 2 with 5 rules applied. Total rules applied 140 place count 1017 transition count 1613
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 145 place count 1012 transition count 1608
Iterating global reduction 2 with 5 rules applied. Total rules applied 150 place count 1012 transition count 1608
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 155 place count 1007 transition count 1603
Iterating global reduction 2 with 5 rules applied. Total rules applied 160 place count 1007 transition count 1603
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 164 place count 1003 transition count 1599
Iterating global reduction 2 with 4 rules applied. Total rules applied 168 place count 1003 transition count 1599
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 172 place count 999 transition count 1595
Iterating global reduction 2 with 4 rules applied. Total rules applied 176 place count 999 transition count 1595
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 177 place count 999 transition count 1594
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 180 place count 996 transition count 1591
Iterating global reduction 3 with 3 rules applied. Total rules applied 183 place count 996 transition count 1591
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 993 transition count 1588
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 993 transition count 1588
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 192 place count 990 transition count 1585
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 990 transition count 1585
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 198 place count 987 transition count 1582
Iterating global reduction 3 with 3 rules applied. Total rules applied 201 place count 987 transition count 1582
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 204 place count 984 transition count 1579
Iterating global reduction 3 with 3 rules applied. Total rules applied 207 place count 984 transition count 1579
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 210 place count 981 transition count 1576
Iterating global reduction 3 with 3 rules applied. Total rules applied 213 place count 981 transition count 1576
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 215 place count 981 transition count 1574
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 216 place count 980 transition count 1573
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 980 transition count 1573
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 218 place count 979 transition count 1572
Iterating global reduction 4 with 1 rules applied. Total rules applied 219 place count 979 transition count 1572
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 220 place count 979 transition count 1571
Applied a total of 220 rules in 763 ms. Remains 979 /1086 variables (removed 107) and now considering 1571/1684 (removed 113) transitions.
[2026-05-25 10:46:59] [INFO ] Invariant cache hit.
[2026-05-25 10:46:59] [INFO ] Implicit Places using invariants in 526 ms returned []
[2026-05-25 10:46:59] [INFO ] Invariant cache hit.
[2026-05-25 10:47:00] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 979/1086 places, 1571/1684 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2319 ms. Remains : 979/1086 places, 1571/1684 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(p1)||G(p2)))&&p0) U X(X(X(p1)))))'
Stuttering acceptance computed with spot in 845 ms :[(NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-10 finished in 3234 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(G(p0))&&F(p1))))'
Support contains 4 out of 1086 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Graph (trivial) has 1070 edges and 1086 vertex of which 80 / 1086 are part of one of the 15 SCC in 1 ms
Free SCC test removed 65 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 752 transitions
Trivial Post-agglo rules discarded 752 transitions
Performed 752 trivial Post agglomeration. Transition count delta: 752
Iterating post reduction 0 with 752 rules applied. Total rules applied 753 place count 1020 transition count 856
Reduce places removed 752 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 767 rules applied. Total rules applied 1520 place count 268 transition count 841
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 8 rules applied. Total rules applied 1528 place count 263 transition count 838
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1531 place count 260 transition count 838
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 1531 place count 260 transition count 779
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1649 place count 201 transition count 779
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1659 place count 191 transition count 769
Iterating global reduction 4 with 10 rules applied. Total rules applied 1669 place count 191 transition count 769
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1673 place count 187 transition count 765
Iterating global reduction 4 with 4 rules applied. Total rules applied 1677 place count 187 transition count 765
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1678 place count 187 transition count 764
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1679 place count 186 transition count 763
Iterating global reduction 5 with 1 rules applied. Total rules applied 1680 place count 186 transition count 763
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1681 place count 185 transition count 762
Iterating global reduction 5 with 1 rules applied. Total rules applied 1682 place count 185 transition count 762
Performed 37 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1756 place count 148 transition count 723
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 1785 place count 119 transition count 277
Iterating global reduction 5 with 29 rules applied. Total rules applied 1814 place count 119 transition count 277
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1826 place count 119 transition count 265
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1843 place count 102 transition count 243
Iterating global reduction 6 with 17 rules applied. Total rules applied 1860 place count 102 transition count 243
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1877 place count 85 transition count 221
Iterating global reduction 6 with 17 rules applied. Total rules applied 1894 place count 85 transition count 221
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1902 place count 85 transition count 213
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1920 place count 76 transition count 220
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1921 place count 75 transition count 210
Iterating global reduction 7 with 1 rules applied. Total rules applied 1922 place count 75 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1923 place count 75 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1928 place count 75 transition count 204
Applied a total of 1928 rules in 97 ms. Remains 75 /1086 variables (removed 1011) and now considering 204/1684 (removed 1480) transitions.
[2026-05-25 10:47:01] [INFO ] Flow matrix only has 198 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4324993579228239944.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15130633903650964495.kers'
[2026-05-25 10:47:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4324993579228239944.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15130633903650964495.kers]
Normalized transition count is 197 out of 198 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 75 cols 1116 entries
Finished phase 1 with 73 SingleSign rule and 0 generalized
[2026-05-25 10:47:01] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15130633903650964495.kers
Total runtime 4 ms.
[2026-05-25 10:47:01] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-25 10:47:01] [INFO ] Flow matrix only has 198 transitions (discarded 6 similar events)
[2026-05-25 10:47:01] [INFO ] Invariant cache hit.
[2026-05-25 10:47:01] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-25 10:47:02] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2026-05-25 10:47:02] [INFO ] Redundant transitions in 1 ms returned []
Running 187 sub problems to find dead transitions.
[2026-05-25 10:47:02] [INFO ] Flow matrix only has 198 transitions (discarded 6 similar events)
[2026-05-25 10:47:02] [INFO ] Invariant cache hit.
[2026-05-25 10:47:02] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 2/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 197/272 variables, 75/97 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 30/127 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (OVERLAPS) 1/273 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 0/273 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 129 constraints, problems are : Problem set: 0 solved, 187 unsolved in 18963 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 2/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 197/272 variables, 75/99 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 30/129 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 187/316 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (OVERLAPS) 1/273 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 320 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49051ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 49052ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/1086 places, 204/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49507 ms. Remains : 75/1086 places, 204/1684 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(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-11
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-11 finished in 49761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0))||G(p1)) U X(p2)))'
Support contains 3 out of 1086 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1076 transition count 1674
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1076 transition count 1674
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1076 transition count 1673
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 29 place count 1068 transition count 1665
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 1068 transition count 1665
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 1062 transition count 1659
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 1062 transition count 1659
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 1056 transition count 1653
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 1056 transition count 1653
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 1051 transition count 1648
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 1051 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 1046 transition count 1643
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 1046 transition count 1643
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 86 place count 1041 transition count 1638
Iterating global reduction 1 with 5 rules applied. Total rules applied 91 place count 1041 transition count 1638
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 1041 transition count 1637
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 96 place count 1037 transition count 1633
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 1037 transition count 1633
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 1033 transition count 1629
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 1033 transition count 1629
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 112 place count 1029 transition count 1625
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 1029 transition count 1625
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 1025 transition count 1621
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 1025 transition count 1621
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 127 place count 1022 transition count 1618
Iterating global reduction 2 with 3 rules applied. Total rules applied 130 place count 1022 transition count 1618
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 133 place count 1019 transition count 1615
Iterating global reduction 2 with 3 rules applied. Total rules applied 136 place count 1019 transition count 1615
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 1019 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 1017 transition count 1612
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 1017 transition count 1612
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 143 place count 1015 transition count 1610
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 1015 transition count 1610
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 147 place count 1013 transition count 1608
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 1013 transition count 1608
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 151 place count 1011 transition count 1606
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 1011 transition count 1606
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 155 place count 1009 transition count 1604
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 1009 transition count 1604
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 159 place count 1007 transition count 1602
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 1007 transition count 1602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 162 place count 1007 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 163 place count 1006 transition count 1600
Iterating global reduction 4 with 1 rules applied. Total rules applied 164 place count 1006 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 1005 transition count 1599
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 1005 transition count 1599
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 167 place count 1005 transition count 1598
Applied a total of 167 rules in 1202 ms. Remains 1005 /1086 variables (removed 81) and now considering 1598/1684 (removed 86) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-266268148569500063.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5388582645839987820.kers'
[2026-05-25 10:47:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-266268148569500063.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5388582645839987820.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1598 rows 1005 cols 7491 entries
Finished phase 1 with 999 SingleSign rule and 0 generalized
[2026-05-25 10:47:52] [INFO ] Computed 6 invariants in 12 ms
Computed 6 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-5388582645839987820.kers
Total runtime 14 ms.
[2026-05-25 10:47:53] [INFO ] Implicit Places using invariants in 727 ms returned []
[2026-05-25 10:47:53] [INFO ] Invariant cache hit.
[2026-05-25 10:47:54] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1883 ms to find 0 implicit places.
Running 1597 sub problems to find dead transitions.
[2026-05-25 10:47:54] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1004/2603 variables, and 0 constraints, problems are : Problem set: 0 solved, 1597 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 1597/1597 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1597 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1004/2603 variables, and 0 constraints, problems are : Problem set: 0 solved, 1597 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 0/1597 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61531ms problems are : Problem set: 0 solved, 1597 unsolved
Search for dead transitions found 0 dead transitions in 61538ms
Starting structural reductions in LTL mode, iteration 1 : 1005/1086 places, 1598/1684 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64631 ms. Remains : 1005/1086 places, 1598/1684 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0))||G(p1)) U X(p2)))'
Stuttering acceptance computed with spot in 237 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-12
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-12 finished in 64928 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(G((G(p0)||X(p1))))))'
Support contains 6 out of 1086 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1075 transition count 1673
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1075 transition count 1673
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1075 transition count 1672
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 1066 transition count 1663
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 1066 transition count 1663
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 1059 transition count 1656
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 1059 transition count 1656
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 1052 transition count 1649
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 1052 transition count 1649
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 75 place count 1046 transition count 1643
Iterating global reduction 1 with 6 rules applied. Total rules applied 81 place count 1046 transition count 1643
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 87 place count 1040 transition count 1637
Iterating global reduction 1 with 6 rules applied. Total rules applied 93 place count 1040 transition count 1637
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 99 place count 1034 transition count 1631
Iterating global reduction 1 with 6 rules applied. Total rules applied 105 place count 1034 transition count 1631
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 1034 transition count 1630
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 110 place count 1030 transition count 1626
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 1030 transition count 1626
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 118 place count 1026 transition count 1622
Iterating global reduction 2 with 4 rules applied. Total rules applied 122 place count 1026 transition count 1622
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 126 place count 1022 transition count 1618
Iterating global reduction 2 with 4 rules applied. Total rules applied 130 place count 1022 transition count 1618
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 134 place count 1018 transition count 1614
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 1018 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 141 place count 1015 transition count 1611
Iterating global reduction 2 with 3 rules applied. Total rules applied 144 place count 1015 transition count 1611
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 147 place count 1012 transition count 1608
Iterating global reduction 2 with 3 rules applied. Total rules applied 150 place count 1012 transition count 1608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 1012 transition count 1607
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 1010 transition count 1605
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 1010 transition count 1605
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 1008 transition count 1603
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 1008 transition count 1603
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 161 place count 1006 transition count 1601
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 1006 transition count 1601
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 165 place count 1004 transition count 1599
Iterating global reduction 3 with 2 rules applied. Total rules applied 167 place count 1004 transition count 1599
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 169 place count 1002 transition count 1597
Iterating global reduction 3 with 2 rules applied. Total rules applied 171 place count 1002 transition count 1597
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 173 place count 1000 transition count 1595
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 1000 transition count 1595
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 177 place count 1000 transition count 1593
Applied a total of 177 rules in 769 ms. Remains 1000 /1086 variables (removed 86) and now considering 1593/1684 (removed 91) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7851674001893571768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3164881556813287075.kers'
[2026-05-25 10:48:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7851674001893571768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3164881556813287075.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1593 rows 1000 cols 7481 entries
Finished phase 1 with 994 SingleSign rule and 0 generalized
[2026-05-25 10:48:57] [INFO ] Computed 6 invariants in 25 ms
Computed 6 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-3164881556813287075.kers
Total runtime 29 ms.
[2026-05-25 10:48:57] [INFO ] Implicit Places using invariants in 580 ms returned []
[2026-05-25 10:48:57] [INFO ] Invariant cache hit.
[2026-05-25 10:48:58] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1781 ms to find 0 implicit places.
Running 1592 sub problems to find dead transitions.
[2026-05-25 10:48:58] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/2593 variables, and 0 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 1592/1592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1592 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s42 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/2593 variables, and 0 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/1592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61578ms problems are : Problem set: 0 solved, 1592 unsolved
Search for dead transitions found 0 dead transitions in 61584ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1086 places, 1593/1684 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64144 ms. Remains : 1000/1086 places, 1593/1684 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(G((G(p0)||X(p1))))))'
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-14 finished in 64419 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((F(p0) U p1)) U ((!p2&&X((F(p0) U p1)))||X(G((F(p0) U p1)))))))'
Support contains 3 out of 1086 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1086/1086 places, 1684/1684 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1075 transition count 1673
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1075 transition count 1673
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1075 transition count 1672
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 1066 transition count 1663
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 1066 transition count 1663
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 1059 transition count 1656
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 1059 transition count 1656
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 1052 transition count 1649
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 1052 transition count 1649
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 1045 transition count 1642
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 1045 transition count 1642
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 1038 transition count 1635
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 1038 transition count 1635
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 104 place count 1031 transition count 1628
Iterating global reduction 1 with 7 rules applied. Total rules applied 111 place count 1031 transition count 1628
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 1031 transition count 1627
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 117 place count 1026 transition count 1622
Iterating global reduction 2 with 5 rules applied. Total rules applied 122 place count 1026 transition count 1622
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 127 place count 1021 transition count 1617
Iterating global reduction 2 with 5 rules applied. Total rules applied 132 place count 1021 transition count 1617
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 137 place count 1016 transition count 1612
Iterating global reduction 2 with 5 rules applied. Total rules applied 142 place count 1016 transition count 1612
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 147 place count 1011 transition count 1607
Iterating global reduction 2 with 5 rules applied. Total rules applied 152 place count 1011 transition count 1607
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 156 place count 1007 transition count 1603
Iterating global reduction 2 with 4 rules applied. Total rules applied 160 place count 1007 transition count 1603
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 164 place count 1003 transition count 1599
Iterating global reduction 2 with 4 rules applied. Total rules applied 168 place count 1003 transition count 1599
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 169 place count 1003 transition count 1598
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 172 place count 1000 transition count 1595
Iterating global reduction 3 with 3 rules applied. Total rules applied 175 place count 1000 transition count 1595
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 178 place count 997 transition count 1592
Iterating global reduction 3 with 3 rules applied. Total rules applied 181 place count 997 transition count 1592
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 184 place count 994 transition count 1589
Iterating global reduction 3 with 3 rules applied. Total rules applied 187 place count 994 transition count 1589
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 190 place count 991 transition count 1586
Iterating global reduction 3 with 3 rules applied. Total rules applied 193 place count 991 transition count 1586
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 196 place count 988 transition count 1583
Iterating global reduction 3 with 3 rules applied. Total rules applied 199 place count 988 transition count 1583
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 202 place count 985 transition count 1580
Iterating global reduction 3 with 3 rules applied. Total rules applied 205 place count 985 transition count 1580
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 207 place count 985 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 208 place count 984 transition count 1577
Iterating global reduction 4 with 1 rules applied. Total rules applied 209 place count 984 transition count 1577
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 210 place count 983 transition count 1576
Iterating global reduction 4 with 1 rules applied. Total rules applied 211 place count 983 transition count 1576
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 212 place count 983 transition count 1575
Applied a total of 212 rules in 814 ms. Remains 983 /1086 variables (removed 103) and now considering 1575/1684 (removed 109) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3506659421463712143.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5781721987277859620.kers'
[2026-05-25 10:50:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3506659421463712143.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5781721987277859620.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1575 rows 983 cols 7439 entries
Finished phase 1 with 977 SingleSign rule and 0 generalized
[2026-05-25 10:50:01] [INFO ] Computed 6 invariants in 25 ms
Computed 6 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-5781721987277859620.kers
Total runtime 30 ms.
[2026-05-25 10:50:02] [INFO ] Implicit Places using invariants in 695 ms returned []
[2026-05-25 10:50:02] [INFO ] Invariant cache hit.
[2026-05-25 10:50:03] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 2005 ms to find 0 implicit places.
Running 1574 sub problems to find dead transitions.
[2026-05-25 10:50:03] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 982/2558 variables, and 0 constraints, problems are : Problem set: 0 solved, 1574 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/983 constraints, PredecessorRefiner: 1574/1574 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1574 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 982/2558 variables, and 0 constraints, problems are : Problem set: 0 solved, 1574 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/983 constraints, PredecessorRefiner: 0/1574 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61396ms problems are : Problem set: 0 solved, 1574 unsolved
Search for dead transitions found 0 dead transitions in 61399ms
Starting structural reductions in LTL mode, iteration 1 : 983/1086 places, 1575/1684 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64223 ms. Remains : 983/1086 places, 1575/1684 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((F(p0) U p1)) U (X(G((F(p0) U p1)))||(!p2&&X((F(p0) U p1)))))))'
Stuttering acceptance computed with spot in 332 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B03-LTLFireability-15
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLFireability-15 finished in 64650 ms.
All properties solved by simple procedures.
Total runtime 896263 ms.

BK_STOP 1779706265411

--------------------
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="MedleyB-PT-B03"
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 MedleyB-PT-B03, 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 r178-oct2-177969020100300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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