About the Execution of ITS-Tools for MedleyB-PT-B07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16106.420 | 3600000.00 | 6461820.00 | 23954.20 | FF?TFTTTFFFTF??F | normal |
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-177969020100331.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-B07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020100331
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 9.5K Mar 7 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 7 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Mar 7 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 7 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:34 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 3.7M 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-B07-LTLCardinality-00
FORMULA_NAME MedleyB-PT-B07-LTLCardinality-01
FORMULA_NAME MedleyB-PT-B07-LTLCardinality-02
FORMULA_NAME MedleyB-PT-B07-LTLCardinality-03
FORMULA_NAME MedleyB-PT-B07-LTLCardinality-04
FORMULA_NAME MedleyB-PT-B07-LTLCardinality-05
FORMULA_NAME MedleyB-PT-B07-LTLCardinality-06
FORMULA_NAME MedleyB-PT-B07-LTLCardinality-07
FORMULA_NAME MedleyB-PT-B07-LTLCardinality-08
FORMULA_NAME MedleyB-PT-B07-LTLCardinality-09
FORMULA_NAME MedleyB-PT-B07-LTLCardinality-10
FORMULA_NAME MedleyB-PT-B07-LTLCardinality-11
FORMULA_NAME MedleyB-PT-B07-LTLCardinality-12
FORMULA_NAME MedleyB-PT-B07-LTLCardinality-13
FORMULA_NAME MedleyB-PT-B07-LTLCardinality-14
FORMULA_NAME MedleyB-PT-B07-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779707684468
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 11:14:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 11:14:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:14:46] [INFO ] Load time of PNML (sax parser for PT used): 417 ms
[2026-05-25 11:14:46] [INFO ] Transformed 2133 places.
[2026-05-25 11:14:46] [INFO ] Transformed 6753 transitions.
[2026-05-25 11:14:46] [INFO ] Found NUPN structural information;
[2026-05-25 11:14:46] [INFO ] Parsed PT model containing 2133 places and 6753 transitions and 67789 arcs in 591 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MedleyB-PT-B07-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 2133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2133/2133 places, 6753/6753 transitions.
Discarding 169 places :
Symmetric choice reduction at 0 with 169 rule applications. Total rules 169 place count 1964 transition count 6584
Iterating global reduction 0 with 169 rules applied. Total rules applied 338 place count 1964 transition count 6584
Discarding 105 places :
Symmetric choice reduction at 0 with 105 rule applications. Total rules 443 place count 1859 transition count 6479
Iterating global reduction 0 with 105 rules applied. Total rules applied 548 place count 1859 transition count 6479
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 610 place count 1797 transition count 6417
Iterating global reduction 0 with 62 rules applied. Total rules applied 672 place count 1797 transition count 6417
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 724 place count 1745 transition count 6365
Iterating global reduction 0 with 52 rules applied. Total rules applied 776 place count 1745 transition count 6365
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 820 place count 1701 transition count 6321
Iterating global reduction 0 with 44 rules applied. Total rules applied 864 place count 1701 transition count 6321
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 906 place count 1659 transition count 6279
Iterating global reduction 0 with 42 rules applied. Total rules applied 948 place count 1659 transition count 6279
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 989 place count 1618 transition count 6238
Iterating global reduction 0 with 41 rules applied. Total rules applied 1030 place count 1618 transition count 6238
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 1071 place count 1577 transition count 6197
Iterating global reduction 0 with 41 rules applied. Total rules applied 1112 place count 1577 transition count 6197
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 1146 place count 1543 transition count 6163
Iterating global reduction 0 with 34 rules applied. Total rules applied 1180 place count 1543 transition count 6163
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 1205 place count 1518 transition count 6138
Iterating global reduction 0 with 25 rules applied. Total rules applied 1230 place count 1518 transition count 6138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 1235 place count 1518 transition count 6133
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 1244 place count 1509 transition count 6124
Iterating global reduction 1 with 9 rules applied. Total rules applied 1253 place count 1509 transition count 6124
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 1261 place count 1501 transition count 6116
Iterating global reduction 1 with 8 rules applied. Total rules applied 1269 place count 1501 transition count 6116
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1272 place count 1498 transition count 6113
Iterating global reduction 1 with 3 rules applied. Total rules applied 1275 place count 1498 transition count 6113
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1278 place count 1495 transition count 6110
Iterating global reduction 1 with 3 rules applied. Total rules applied 1281 place count 1495 transition count 6110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1284 place count 1492 transition count 6107
Iterating global reduction 1 with 3 rules applied. Total rules applied 1287 place count 1492 transition count 6107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1290 place count 1489 transition count 6104
Iterating global reduction 1 with 3 rules applied. Total rules applied 1293 place count 1489 transition count 6104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1296 place count 1486 transition count 6101
Iterating global reduction 1 with 3 rules applied. Total rules applied 1299 place count 1486 transition count 6101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1301 place count 1484 transition count 6099
Iterating global reduction 1 with 2 rules applied. Total rules applied 1303 place count 1484 transition count 6099
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1305 place count 1482 transition count 6097
Iterating global reduction 1 with 2 rules applied. Total rules applied 1307 place count 1482 transition count 6097
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1309 place count 1480 transition count 6095
Iterating global reduction 1 with 2 rules applied. Total rules applied 1311 place count 1480 transition count 6095
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1313 place count 1478 transition count 6093
Iterating global reduction 1 with 2 rules applied. Total rules applied 1315 place count 1478 transition count 6093
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1317 place count 1476 transition count 6091
Iterating global reduction 1 with 2 rules applied. Total rules applied 1319 place count 1476 transition count 6091
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1321 place count 1476 transition count 6089
Applied a total of 1321 rules in 3291 ms. Remains 1476 /2133 variables (removed 657) and now considering 6089/6753 (removed 664) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15788567133333230228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17898129228039125577.kers'
[2026-05-25 11:14:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15788567133333230228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17898129228039125577.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 6089 rows 1476 cols 66431 entries
Finished phase 1 with 1468 SingleSign rule and 0 generalized
[2026-05-25 11:14:50] [INFO ] Computed 8 invariants in 58 ms
Computed 8 P flows in 59 ms.
Exported basis to /tmp/petrispot-output-17898129228039125577.kers
Total runtime 67 ms.
[2026-05-25 11:14:53] [INFO ] Implicit Places using invariants in 3454 ms returned []
[2026-05-25 11:14:53] [INFO ] Invariant cache hit.
[2026-05-25 11:14:59] [INFO ] Implicit Places using invariants and state equation in 6184 ms returned []
Implicit Place search using SMT with State Equation took 9706 ms to find 0 implicit places.
Running 6088 sub problems to find dead transitions.
[2026-05-25 11:15:00] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1475/7565 variables, and 0 constraints, problems are : Problem set: 0 solved, 6088 unsolved in 30143 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1476 constraints, PredecessorRefiner: 6088/1671 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6088 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1475/7565 variables, and 0 constraints, problems are : Problem set: 0 solved, 6088 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1476 constraints, PredecessorRefiner: 4417/1671 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 71117ms problems are : Problem set: 0 solved, 6088 unsolved
Search for dead transitions found 0 dead transitions in 71204ms
Starting structural reductions in LTL mode, iteration 1 : 1476/2133 places, 6089/6753 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84338 ms. Remains : 1476/2133 places, 6089/6753 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1476/1476 places, 6089/6089 transitions.
Applied a total of 0 rules in 98 ms. Remains 1476 /1476 variables (removed 0) and now considering 6089/6089 (removed 0) transitions.
[2026-05-25 11:16:11] [INFO ] Invariant cache hit.
[2026-05-25 11:16:14] [INFO ] Implicit Places using invariants in 2750 ms returned []
[2026-05-25 11:16:14] [INFO ] Invariant cache hit.
[2026-05-25 11:16:19] [INFO ] Implicit Places using invariants and state equation in 5387 ms returned []
Implicit Place search using SMT with State Equation took 8155 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 8258 ms. Remains : 1476/1476 places, 6089/6089 transitions.
Support contains 31 out of 1476 places after structural reductions.
[2026-05-25 11:16:20] [INFO ] Flatten gal took : 705 ms
[2026-05-25 11:16:20] [INFO ] Flatten gal took : 326 ms
[2026-05-25 11:16:21] [INFO ] Input system was already deterministic with 6089 transitions.
Support contains 29 out of 1476 places (down from 31) after GAL structural reductions.
RANDOM walk for 40000 steps (304 resets) in 1861 ms. (21 steps per ms) remains 9/16 properties
BEST_FIRST walk for 40004 steps (44 resets) in 227 ms. (175 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (45 resets) in 167 ms. (238 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 160 ms. (248 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 145 ms. (274 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (48 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (46 resets) in 160 ms. (248 steps per ms) remains 9/9 properties
[2026-05-25 11:16:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1442/1462 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1462 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 14/1476 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1476 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 6089/7565 variables, 1476/1484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7565 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/7565 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7565/7565 variables, and 1484 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4831 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1476/1476 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1442/1462 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 10088ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 1476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1476/1476 places, 6089/6089 transitions.
Graph (trivial) has 1433 edges and 1476 vertex of which 105 / 1476 are part of one of the 20 SCC in 18 ms
Free SCC test removed 85 places
Drop transitions (Empty/Sink Transition effects.) removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Graph (complete) has 2665 edges and 1391 vertex of which 1383 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.44 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1008 transitions
Trivial Post-agglo rules discarded 1008 transitions
Performed 1008 trivial Post agglomeration. Transition count delta: 1008
Iterating post reduction 0 with 1015 rules applied. Total rules applied 1017 place count 1383 transition count 4955
Reduce places removed 1008 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 1030 rules applied. Total rules applied 2047 place count 375 transition count 4933
Reduce places removed 9 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 15 rules applied. Total rules applied 2062 place count 366 transition count 4927
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 2070 place count 360 transition count 4925
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2071 place count 359 transition count 4925
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 90 Pre rules applied. Total rules applied 2071 place count 359 transition count 4835
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 5 with 180 rules applied. Total rules applied 2251 place count 269 transition count 4835
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2253 place count 267 transition count 4833
Iterating global reduction 5 with 2 rules applied. Total rules applied 2255 place count 267 transition count 4833
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 2 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 2359 place count 215 transition count 4781
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2372 place count 215 transition count 4768
Discarding 36 places :
Symmetric choice reduction at 6 with 36 rule applications. Total rules 2408 place count 179 transition count 678
Iterating global reduction 6 with 36 rules applied. Total rules applied 2444 place count 179 transition count 678
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 2461 place count 179 transition count 661
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 2477 place count 163 transition count 645
Iterating global reduction 7 with 16 rules applied. Total rules applied 2493 place count 163 transition count 645
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 2504 place count 152 transition count 634
Iterating global reduction 7 with 11 rules applied. Total rules applied 2515 place count 152 transition count 634
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2519 place count 152 transition count 630
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 2535 place count 144 transition count 622
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2539 place count 142 transition count 632
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 2542 place count 142 transition count 629
Free-agglomeration rule applied 47 times.
Iterating global reduction 8 with 47 rules applied. Total rules applied 2589 place count 142 transition count 582
Reduce places removed 47 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 48 rules applied. Total rules applied 2637 place count 95 transition count 581
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2644 place count 88 transition count 574
Iterating global reduction 9 with 7 rules applied. Total rules applied 2651 place count 88 transition count 574
Drop transitions (Redundant composition of simpler transitions.) removed 195 transitions
Redundant transition composition rules discarded 195 transitions
Iterating global reduction 9 with 195 rules applied. Total rules applied 2846 place count 88 transition count 379
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 9 with 2 rules applied. Total rules applied 2848 place count 87 transition count 378
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2850 place count 86 transition count 381
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2852 place count 86 transition count 379
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2854 place count 84 transition count 379
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 2861 place count 84 transition count 379
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2865 place count 84 transition count 375
Applied a total of 2865 rules in 1058 ms. Remains 84 /1476 variables (removed 1392) and now considering 375/6089 (removed 5714) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1071 ms. Remains : 84/1476 places, 375/6089 transitions.
RANDOM walk for 40000 steps (8 resets) in 1749 ms. (22 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9318808969685585752.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8871002235481751769.kers'
[2026-05-25 11:16:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9318808969685585752.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8871002235481751769.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 375 rows 83 cols 2490 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-25 11:16:34] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8871002235481751769.kers
Total runtime 4 ms.
[2026-05-25 11:16:34] [INFO ] State equation strengthened by 305 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/84 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 375/459 variables, 84/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 305/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/459 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 397 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1341 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 84/84 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/52 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Int declared 52/459 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 4/8 constraints, State Equation: 0/84 constraints, ReadFeed: 0/305 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2012ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 298 stabilizing places and 312 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' '!((p0 U (F(!p0)&&X(G(p1)))))'
Support contains 3 out of 1476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1476/1476 places, 6089/6089 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1461 transition count 6074
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1461 transition count 6074
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 42 place count 1449 transition count 6062
Iterating global reduction 0 with 12 rules applied. Total rules applied 54 place count 1449 transition count 6062
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 1449 transition count 6061
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 66 place count 1438 transition count 6050
Iterating global reduction 1 with 11 rules applied. Total rules applied 77 place count 1438 transition count 6050
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 86 place count 1429 transition count 6041
Iterating global reduction 1 with 9 rules applied. Total rules applied 95 place count 1429 transition count 6041
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 103 place count 1421 transition count 6033
Iterating global reduction 1 with 8 rules applied. Total rules applied 111 place count 1421 transition count 6033
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 1421 transition count 6032
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 119 place count 1414 transition count 6025
Iterating global reduction 2 with 7 rules applied. Total rules applied 126 place count 1414 transition count 6025
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 133 place count 1407 transition count 6018
Iterating global reduction 2 with 7 rules applied. Total rules applied 140 place count 1407 transition count 6018
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 1407 transition count 6017
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 146 place count 1402 transition count 6012
Iterating global reduction 3 with 5 rules applied. Total rules applied 151 place count 1402 transition count 6012
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 156 place count 1397 transition count 6007
Iterating global reduction 3 with 5 rules applied. Total rules applied 161 place count 1397 transition count 6007
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 165 place count 1393 transition count 6003
Iterating global reduction 3 with 4 rules applied. Total rules applied 169 place count 1393 transition count 6003
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 173 place count 1389 transition count 5999
Iterating global reduction 3 with 4 rules applied. Total rules applied 177 place count 1389 transition count 5999
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 178 place count 1389 transition count 5998
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 181 place count 1386 transition count 5995
Iterating global reduction 4 with 3 rules applied. Total rules applied 184 place count 1386 transition count 5995
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 187 place count 1383 transition count 5992
Iterating global reduction 4 with 3 rules applied. Total rules applied 190 place count 1383 transition count 5992
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 191 place count 1383 transition count 5991
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 193 place count 1381 transition count 5989
Iterating global reduction 5 with 2 rules applied. Total rules applied 195 place count 1381 transition count 5989
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 197 place count 1379 transition count 5987
Iterating global reduction 5 with 2 rules applied. Total rules applied 199 place count 1379 transition count 5987
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 201 place count 1377 transition count 5985
Iterating global reduction 5 with 2 rules applied. Total rules applied 203 place count 1377 transition count 5985
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 205 place count 1375 transition count 5983
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 1375 transition count 5983
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 208 place count 1375 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 209 place count 1374 transition count 5981
Iterating global reduction 6 with 1 rules applied. Total rules applied 210 place count 1374 transition count 5981
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 211 place count 1373 transition count 5980
Iterating global reduction 6 with 1 rules applied. Total rules applied 212 place count 1373 transition count 5980
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 213 place count 1372 transition count 5979
Iterating global reduction 6 with 1 rules applied. Total rules applied 214 place count 1372 transition count 5979
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 215 place count 1372 transition count 5978
Applied a total of 215 rules in 2332 ms. Remains 1372 /1476 variables (removed 104) and now considering 5978/6089 (removed 111) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4327750081207996615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12923210372804565600.kers'
[2026-05-25 11:16:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4327750081207996615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12923210372804565600.kers]
Culled 0 columns in 17 ms.
// Phase 1: matrix 5978 rows 1372 cols 66183 entries
Finished phase 1 with 1364 SingleSign rule and 0 generalized
[2026-05-25 11:16:39] [INFO ] Computed 8 invariants in 92 ms
Computed 8 P flows in 93 ms.
Exported basis to /tmp/petrispot-output-12923210372804565600.kers
Total runtime 113 ms.
[2026-05-25 11:16:41] [INFO ] Implicit Places using invariants in 2384 ms returned []
[2026-05-25 11:16:41] [INFO ] Invariant cache hit.
[2026-05-25 11:16:47] [INFO ] Implicit Places using invariants and state equation in 5119 ms returned []
Implicit Place search using SMT with State Equation took 7512 ms to find 0 implicit places.
Running 5977 sub problems to find dead transitions.
[2026-05-25 11:16:47] [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 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 5977/1561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5977 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1371/7350 variables, and 0 constraints, problems are : Problem set: 0 solved, 5977 unsolved in 30132 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1372 constraints, PredecessorRefiner: 4416/1561 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 71282ms problems are : Problem set: 0 solved, 5977 unsolved
Search for dead transitions found 0 dead transitions in 71327ms
Starting structural reductions in LTL mode, iteration 1 : 1372/1476 places, 5978/6089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81229 ms. Remains : 1372/1476 places, 5978/6089 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(!p0)&&X(G(p1)))))'
Stuttering acceptance computed with spot in 448 ms :[(NOT p1), true, (OR (NOT p1) p0)]
Running random walk in product with property : MedleyB-PT-B07-LTLCardinality-00
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 7 ms.
FORMULA MedleyB-PT-B07-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B07-LTLCardinality-00 finished in 81906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X(G(p1))) U p2)))'
Support contains 5 out of 1476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1476/1476 places, 6089/6089 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1462 transition count 6075
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1462 transition count 6075
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 39 place count 1451 transition count 6064
Iterating global reduction 0 with 11 rules applied. Total rules applied 50 place count 1451 transition count 6064
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 1451 transition count 6063
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 1441 transition count 6053
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 1441 transition count 6053
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 79 place count 1433 transition count 6045
Iterating global reduction 1 with 8 rules applied. Total rules applied 87 place count 1433 transition count 6045
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 1426 transition count 6038
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 1426 transition count 6038
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 108 place count 1419 transition count 6031
Iterating global reduction 1 with 7 rules applied. Total rules applied 115 place count 1419 transition count 6031
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 121 place count 1413 transition count 6025
Iterating global reduction 1 with 6 rules applied. Total rules applied 127 place count 1413 transition count 6025
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 128 place count 1413 transition count 6024
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 132 place count 1409 transition count 6020
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 1409 transition count 6020
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 140 place count 1405 transition count 6016
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 1405 transition count 6016
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 147 place count 1402 transition count 6013
Iterating global reduction 2 with 3 rules applied. Total rules applied 150 place count 1402 transition count 6013
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 153 place count 1399 transition count 6010
Iterating global reduction 2 with 3 rules applied. Total rules applied 156 place count 1399 transition count 6010
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 1399 transition count 6009
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 159 place count 1397 transition count 6007
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 1397 transition count 6007
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 163 place count 1395 transition count 6005
Iterating global reduction 3 with 2 rules applied. Total rules applied 165 place count 1395 transition count 6005
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 166 place count 1395 transition count 6004
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 167 place count 1394 transition count 6003
Iterating global reduction 4 with 1 rules applied. Total rules applied 168 place count 1394 transition count 6003
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 169 place count 1393 transition count 6002
Iterating global reduction 4 with 1 rules applied. Total rules applied 170 place count 1393 transition count 6002
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 171 place count 1392 transition count 6001
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 1392 transition count 6001
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 173 place count 1391 transition count 6000
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 1391 transition count 6000
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 175 place count 1391 transition count 5999
Applied a total of 175 rules in 2137 ms. Remains 1391 /1476 variables (removed 85) and now considering 5999/6089 (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-16620159536839414431.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5363210429556374022.kers'
[2026-05-25 11:18:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16620159536839414431.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5363210429556374022.kers]
Culled 0 columns in 8 ms.
// Phase 1: matrix 5999 rows 1391 cols 66231 entries
Finished phase 1 with 1383 SingleSign rule and 0 generalized
[2026-05-25 11:18:01] [INFO ] Computed 8 invariants in 62 ms
Computed 8 P flows in 63 ms.
Exported basis to /tmp/petrispot-output-5363210429556374022.kers
Total runtime 87 ms.
[2026-05-25 11:18:03] [INFO ] Implicit Places using invariants in 2269 ms returned []
[2026-05-25 11:18:03] [INFO ] Invariant cache hit.
[2026-05-25 11:18:08] [INFO ] Implicit Places using invariants and state equation in 5131 ms returned []
Implicit Place search using SMT with State Equation took 7419 ms to find 0 implicit places.
Running 5998 sub problems to find dead transitions.
[2026-05-25 11:18:08] [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 1390/7390 variables, and 0 constraints, problems are : Problem set: 0 solved, 5998 unsolved in 30163 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1391 constraints, PredecessorRefiner: 5998/1582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5998 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1390/7390 variables, and 0 constraints, problems are : Problem set: 0 solved, 5998 unsolved in 30118 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1391 constraints, PredecessorRefiner: 4416/1582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 71100ms problems are : Problem set: 0 solved, 5998 unsolved
Search for dead transitions found 0 dead transitions in 71130ms
Starting structural reductions in LTL mode, iteration 1 : 1391/1476 places, 5999/6089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80719 ms. Remains : 1391/1476 places, 5999/6089 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(p0))&&p1) U p2)))'
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : MedleyB-PT-B07-LTLCardinality-01
Product exploration explored 100000 steps with 767 reset in 582 ms.
Product exploration explored 100000 steps with 774 reset in 546 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge based reduction with 10 factoid took 98 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (305 resets) in 439 ms. (90 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (46 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
[2026-05-25 11:19:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 202/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1187/1391 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1391 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7390/7390 variables, and 1399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1922 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1391/1391 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 202/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1187/1391 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 8504ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1391/1391 places, 5999/5999 transitions.
Graph (trivial) has 1385 edges and 1391 vertex of which 112 / 1391 are part of one of the 21 SCC in 7 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Graph (complete) has 2549 edges and 1300 vertex of which 1293 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.15 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 977 transitions
Trivial Post-agglo rules discarded 977 transitions
Performed 977 trivial Post agglomeration. Transition count delta: 977
Iterating post reduction 0 with 984 rules applied. Total rules applied 986 place count 1293 transition count 4889
Reduce places removed 977 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 998 rules applied. Total rules applied 1984 place count 316 transition count 4868
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1991 place count 309 transition count 4868
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 1991 place count 309 transition count 4788
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 2151 place count 229 transition count 4788
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2152 place count 228 transition count 4787
Iterating global reduction 3 with 1 rules applied. Total rules applied 2153 place count 228 transition count 4787
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 2255 place count 177 transition count 4736
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 2269 place count 177 transition count 4722
Discarding 43 places :
Symmetric choice reduction at 4 with 43 rule applications. Total rules 2312 place count 134 transition count 562
Iterating global reduction 4 with 43 rules applied. Total rules applied 2355 place count 134 transition count 562
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 2377 place count 134 transition count 540
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 2398 place count 113 transition count 519
Iterating global reduction 5 with 21 rules applied. Total rules applied 2419 place count 113 transition count 519
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2434 place count 98 transition count 504
Iterating global reduction 5 with 15 rules applied. Total rules applied 2449 place count 98 transition count 504
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 2457 place count 98 transition count 496
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 2471 place count 91 transition count 489
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 2477 place count 88 transition count 497
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2478 place count 88 transition count 496
Free-agglomeration rule applied 37 times.
Iterating global reduction 6 with 37 rules applied. Total rules applied 2515 place count 88 transition count 459
Reduce places removed 37 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 6 with 102 rules applied. Total rules applied 2617 place count 51 transition count 394
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 2624 place count 44 transition count 387
Iterating global reduction 7 with 7 rules applied. Total rules applied 2631 place count 44 transition count 387
Drop transitions (Redundant composition of simpler transitions.) removed 134 transitions
Redundant transition composition rules discarded 134 transitions
Iterating global reduction 7 with 134 rules applied. Total rules applied 2765 place count 44 transition count 253
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 7 with 2 rules applied. Total rules applied 2767 place count 43 transition count 252
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 2771 place count 41 transition count 270
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 2774 place count 41 transition count 267
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2777 place count 38 transition count 267
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2781 place count 38 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2785 place count 38 transition count 263
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 2788 place count 35 transition count 257
Iterating global reduction 8 with 3 rules applied. Total rules applied 2791 place count 35 transition count 257
Applied a total of 2791 rules in 525 ms. Remains 35 /1391 variables (removed 1356) and now considering 257/5999 (removed 5742) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 35/1391 places, 257/5999 transitions.
RANDOM walk for 292 steps (0 resets) in 9 ms. (29 steps per ms) remains 0/1 properties
Knowledge based reduction with 10 factoid took 199 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (NOT p2), true, (NOT p0)]
[2026-05-25 11:19:30] [INFO ] Invariant cache hit.
[2026-05-25 11:19:33] [INFO ] [Real]Absence check using 8 positive place invariants in 91 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:240)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:248)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 11:19:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Knowledge-based reduction took 24906 ms.
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (NOT p2), true, (NOT p0)]
Support contains 5 out of 1391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1391/1391 places, 5999/5999 transitions.
Applied a total of 0 rules in 107 ms. Remains 1391 /1391 variables (removed 0) and now considering 5999/5999 (removed 0) transitions.
[2026-05-25 11:19:46] [INFO ] Invariant cache hit.
[2026-05-25 11:19:48] [INFO ] Implicit Places using invariants in 2070 ms returned []
[2026-05-25 11:19:48] [INFO ] Invariant cache hit.
[2026-05-25 11:19:54] [INFO ] Implicit Places using invariants and state equation in 5710 ms returned []
Implicit Place search using SMT with State Equation took 7800 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 7909 ms. Remains : 1391/1391 places, 5999/5999 transitions.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge based reduction with 10 factoid took 97 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (308 resets) in 601 ms. (66 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (46 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
[2026-05-25 11:19:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 202/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1187/1391 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1391 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5999/7390 variables, 1391/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7390 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/7390 variables, 0/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7390/7390 variables, and 1399 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2389 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1391/1391 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 202/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1187/1391 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 9695ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1391/1391 places, 5999/5999 transitions.
Graph (trivial) has 1385 edges and 1391 vertex of which 112 / 1391 are part of one of the 21 SCC in 4 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Graph (complete) has 2549 edges and 1300 vertex of which 1293 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 977 transitions
Trivial Post-agglo rules discarded 977 transitions
Performed 977 trivial Post agglomeration. Transition count delta: 977
Iterating post reduction 0 with 984 rules applied. Total rules applied 986 place count 1293 transition count 4889
Reduce places removed 977 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 998 rules applied. Total rules applied 1984 place count 316 transition count 4868
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1991 place count 309 transition count 4868
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 1991 place count 309 transition count 4788
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 2151 place count 229 transition count 4788
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2152 place count 228 transition count 4787
Iterating global reduction 3 with 1 rules applied. Total rules applied 2153 place count 228 transition count 4787
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 2255 place count 177 transition count 4736
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 2269 place count 177 transition count 4722
Discarding 43 places :
Symmetric choice reduction at 4 with 43 rule applications. Total rules 2312 place count 134 transition count 562
Iterating global reduction 4 with 43 rules applied. Total rules applied 2355 place count 134 transition count 562
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 2377 place count 134 transition count 540
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 2398 place count 113 transition count 519
Iterating global reduction 5 with 21 rules applied. Total rules applied 2419 place count 113 transition count 519
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2434 place count 98 transition count 504
Iterating global reduction 5 with 15 rules applied. Total rules applied 2449 place count 98 transition count 504
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 2457 place count 98 transition count 496
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 2471 place count 91 transition count 489
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 2477 place count 88 transition count 497
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2478 place count 88 transition count 496
Free-agglomeration rule applied 37 times.
Iterating global reduction 6 with 37 rules applied. Total rules applied 2515 place count 88 transition count 459
Reduce places removed 37 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 6 with 102 rules applied. Total rules applied 2617 place count 51 transition count 394
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 2624 place count 44 transition count 387
Iterating global reduction 7 with 7 rules applied. Total rules applied 2631 place count 44 transition count 387
Drop transitions (Redundant composition of simpler transitions.) removed 134 transitions
Redundant transition composition rules discarded 134 transitions
Iterating global reduction 7 with 134 rules applied. Total rules applied 2765 place count 44 transition count 253
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 7 with 2 rules applied. Total rules applied 2767 place count 43 transition count 252
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 2771 place count 41 transition count 270
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 2774 place count 41 transition count 267
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2777 place count 38 transition count 267
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2781 place count 38 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2785 place count 38 transition count 263
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 2788 place count 35 transition count 257
Iterating global reduction 8 with 3 rules applied. Total rules applied 2791 place count 35 transition count 257
Applied a total of 2791 rules in 640 ms. Remains 35 /1391 variables (removed 1356) and now considering 257/5999 (removed 5742) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 653 ms. Remains : 35/1391 places, 257/5999 transitions.
RANDOM walk for 495 steps (0 resets) in 10 ms. (45 steps per ms) remains 0/1 properties
Knowledge based reduction with 10 factoid took 215 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (NOT p2), true, (NOT p0)]
[2026-05-25 11:20:05] [INFO ] Invariant cache hit.
[2026-05-25 11:20:07] [INFO ] [Real]Absence check using 8 positive place invariants in 92 ms returned sat
[2026-05-25 11:20:20] [INFO ] [Real]Absence check using state equation in 12603 ms returned unknown
Could not prove EG (NOT p2)
Knowledge-based reduction took 26243 ms.
Stuttering acceptance computed with spot in 265 ms :[(NOT p2), (NOT p2), true, (NOT p0)]
Stuttering acceptance computed with spot in 246 ms :[(NOT p2), (NOT p2), true, (NOT p0)]
Product exploration explored 100000 steps with 778 reset in 544 ms.
Product exploration explored 100000 steps with 766 reset in 623 ms.
Spot run failed in 137 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin4536684445623668804
[2026-05-25 11:20:22] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4536684445623668804
Running compilation step : cd /tmp/ltsmin4536684445623668804;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4536684445623668804;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4536684445623668804;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 1391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1391/1391 places, 5999/5999 transitions.
Applied a total of 0 rules in 135 ms. Remains 1391 /1391 variables (removed 0) and now considering 5999/5999 (removed 0) transitions.
[2026-05-25 11:20:25] [INFO ] Invariant cache hit.
[2026-05-25 11:20:28] [INFO ] Implicit Places using invariants in 2793 ms returned []
[2026-05-25 11:20:28] [INFO ] Invariant cache hit.
[2026-05-25 11:20:33] [INFO ] Implicit Places using invariants and state equation in 5102 ms returned []
Implicit Place search using SMT with State Equation took 7930 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 8066 ms. Remains : 1391/1391 places, 5999/5999 transitions.
Built C files in :
/tmp/ltsmin9989659063853824074
[2026-05-25 11:20:33] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9989659063853824074
Running compilation step : cd /tmp/ltsmin9989659063853824074;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9989659063853824074;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9989659063853824074;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-25 11:20:37] [INFO ] Flatten gal took : 326 ms
[2026-05-25 11:20:37] [INFO ] Flatten gal took : 243 ms
[2026-05-25 11:20:37] [INFO ] Time to serialize gal into /tmp/LTL4065134868944227613.gal : 96 ms
[2026-05-25 11:20:37] [INFO ] Time to serialize properties into /tmp/LTL4942710469620646076.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4065134868944227613.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1934889591214597837.hoa' '-atoms' '/tmp/LTL4942710469620646076.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4942710469620646076.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1934889591214597837.hoa
Detected timeout of ITS tools.
[2026-05-25 11:20:53] [INFO ] Flatten gal took : 212 ms
[2026-05-25 11:20:53] [INFO ] Flatten gal took : 238 ms
[2026-05-25 11:20:53] [INFO ] Time to serialize gal into /tmp/LTL1630732117933504854.gal : 61 ms
[2026-05-25 11:20:53] [INFO ] Time to serialize properties into /tmp/LTL5278909258945491073.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1630732117933504854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5278909258945491073.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(((X(G("((p839==0)||(p680==1))")))&&("((p712==0)||(p1125==1))"))U("((p357==1)&&((p712==0)||(p1125==1)))"))))
Formula 0 simplified : X((!"((p712==0)||(p1125==1))" | XF!"((p839==0)||(p680==1))") R !"((p357==1)&&((p712==0)||(p1125==1)))")
Detected timeout of ITS tools.
[2026-05-25 11:21:09] [INFO ] Flatten gal took : 270 ms
[2026-05-25 11:21:09] [INFO ] Applying decomposition
[2026-05-25 11:21:09] [INFO ] Flatten gal took : 307 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12047002767094436973.txt' '-o' '/tmp/graph12047002767094436973.bin' '-w' '/tmp/graph12047002767094436973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12047002767094436973.bin' '-l' '-1' '-v' '-w' '/tmp/graph12047002767094436973.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:21:10] [INFO ] Decomposing Gal with order
[2026-05-25 11:21:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:21:11] [INFO ] Removed a total of 31733 redundant transitions.
[2026-05-25 11:21:11] [INFO ] Flatten gal took : 899 ms
[2026-05-25 11:21:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 370 ms.
[2026-05-25 11:21:12] [INFO ] Time to serialize gal into /tmp/LTL12551138467658032577.gal : 86 ms
[2026-05-25 11:21:12] [INFO ] Time to serialize properties into /tmp/LTL18027756599537606695.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12551138467658032577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18027756599537606695.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(((X(G("((i21.i1.i4.u233.p839==0)||(i21.i0.i1.u200.p680==1))")))&&("((i19.i1.i0.u207.p712==0)||(i35.i2.i12.u317.p1125==1))"))U("((...240
Formula 0 simplified : X((!"((i19.i1.i0.u207.p712==0)||(i35.i2.i12.u317.p1125==1))" | XF!"((i21.i1.i4.u233.p839==0)||(i21.i0.i1.u200.p680==1))") R !"((i10....233
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B07-LTLCardinality-01 finished in 208728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1476/1476 places, 6089/6089 transitions.
Graph (trivial) has 1466 edges and 1476 vertex of which 112 / 1476 are part of one of the 21 SCC in 2 ms
Free SCC test removed 91 places
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1024 transitions
Trivial Post-agglo rules discarded 1024 transitions
Performed 1024 trivial Post agglomeration. Transition count delta: 1024
Iterating post reduction 0 with 1024 rules applied. Total rules applied 1025 place count 1384 transition count 4959
Reduce places removed 1024 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 1048 rules applied. Total rules applied 2073 place count 360 transition count 4935
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 2083 place count 350 transition count 4935
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 2083 place count 350 transition count 4855
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 2243 place count 270 transition count 4855
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 2259 place count 254 transition count 4839
Iterating global reduction 3 with 16 rules applied. Total rules applied 2275 place count 254 transition count 4839
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 2280 place count 249 transition count 4834
Iterating global reduction 3 with 5 rules applied. Total rules applied 2285 place count 249 transition count 4834
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2286 place count 249 transition count 4833
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2289 place count 246 transition count 4830
Iterating global reduction 4 with 3 rules applied. Total rules applied 2292 place count 246 transition count 4830
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2294 place count 246 transition count 4828
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2295 place count 245 transition count 4827
Iterating global reduction 5 with 1 rules applied. Total rules applied 2296 place count 245 transition count 4827
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2297 place count 245 transition count 4826
Performed 53 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 2403 place count 192 transition count 4770
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 2444 place count 151 transition count 618
Iterating global reduction 6 with 41 rules applied. Total rules applied 2485 place count 151 transition count 618
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 2504 place count 151 transition count 599
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2525 place count 130 transition count 571
Iterating global reduction 7 with 21 rules applied. Total rules applied 2546 place count 130 transition count 571
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2567 place count 109 transition count 543
Iterating global reduction 7 with 21 rules applied. Total rules applied 2588 place count 109 transition count 543
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2595 place count 109 transition count 536
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 2617 place count 98 transition count 550
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2618 place count 97 transition count 536
Iterating global reduction 8 with 1 rules applied. Total rules applied 2619 place count 97 transition count 536
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2620 place count 97 transition count 535
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 2627 place count 97 transition count 528
Applied a total of 2627 rules in 804 ms. Remains 97 /1476 variables (removed 1379) and now considering 528/6089 (removed 5561) transitions.
[2026-05-25 11:21:28] [INFO ] Flow matrix only has 520 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16171816816085405269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11212502635332904061.kers'
[2026-05-25 11:21:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16171816816085405269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11212502635332904061.kers]
Normalized transition count is 519 out of 520 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 519 rows 96 cols 4902 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-25 11:21:28] [INFO ] Computed 2 invariants in 10 ms
Computed 2 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-11212502635332904061.kers
Total runtime 15 ms.
[2026-05-25 11:21:28] [INFO ] Implicit Places using invariants in 204 ms returned []
[2026-05-25 11:21:28] [INFO ] Flow matrix only has 520 transitions (discarded 8 similar events)
[2026-05-25 11:21:28] [INFO ] Invariant cache hit.
[2026-05-25 11:21:28] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:21:29] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2026-05-25 11:21:29] [INFO ] Redundant transitions in 33 ms returned []
Running 503 sub problems to find dead transitions.
[2026-05-25 11:21:29] [INFO ] Flow matrix only has 520 transitions (discarded 8 similar events)
[2026-05-25 11:21:29] [INFO ] Invariant cache hit.
[2026-05-25 11:21:29] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 97/617 variables, and 42 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/97 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 503/376 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 519/616 variables, 97/143 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/616 variables, 126/269 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/616 variables, 376/645 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 616/617 variables, and 645 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 503/376 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60858ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 60860ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/1476 places, 528/6089 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62541 ms. Remains : 97/1476 places, 528/6089 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 70 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B07-LTLCardinality-02
Product exploration explored 100000 steps with 8055 reset in 264 ms.
Product exploration explored 100000 steps with 8063 reset in 385 ms.
Computed a total of 8 stabilizing places and 34 stable transitions
Computed a total of 8 stabilizing places and 34 stable transitions
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).
RANDOM walk for 40000 steps (3238 resets) in 758 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (275 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1425626 steps, run timeout after 3001 ms. (steps per millisecond=475 ) properties seen :0 out of 1
Probabilistic random walk after 1425626 steps, saw 264753 distinct states, run finished after 3012 ms. (steps per millisecond=473 ) properties seen :0
[2026-05-25 11:22:34] [INFO ] Flow matrix only has 520 transitions (discarded 8 similar events)
[2026-05-25 11:22:34] [INFO ] Invariant cache hit.
[2026-05-25 11:22:34] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 518/613 variables, 95/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 126/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/616 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/616 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/617 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/617 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/617 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 617/617 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 518/613 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 126/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/616 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/616 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/616 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/617 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/617 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/617 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 617/617 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 959 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1397ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1788 steps, including 139 resets, run visited all 1 properties in 8 ms. (steps per millisecond=223 )
Parikh walk visited 1 properties in 12 ms.
Knowledge based reduction with 3 factoid took 103 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 73 ms :[(NOT p0)]
Knowledge-based reduction took 4938 ms.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 528/528 transitions.
Applied a total of 0 rules in 24 ms. Remains 97 /97 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2026-05-25 11:22:36] [INFO ] Flow matrix only has 520 transitions (discarded 8 similar events)
[2026-05-25 11:22:36] [INFO ] Invariant cache hit.
[2026-05-25 11:22:36] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-25 11:22:36] [INFO ] Flow matrix only has 520 transitions (discarded 8 similar events)
[2026-05-25 11:22:36] [INFO ] Invariant cache hit.
[2026-05-25 11:22:36] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:22:37] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2026-05-25 11:22:37] [INFO ] Redundant transitions in 14 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1087 ms. Remains : 97/97 places, 528/528 transitions.
Computed a total of 8 stabilizing places and 34 stable transitions
Computed a total of 8 stabilizing places and 34 stable transitions
Knowledge based reduction with 3 factoid took 43 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 (3226 resets) in 247 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (270 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1460549 steps, run timeout after 3001 ms. (steps per millisecond=486 ) properties seen :0 out of 1
Probabilistic random walk after 1460549 steps, saw 270745 distinct states, run finished after 3001 ms. (steps per millisecond=486 ) properties seen :0
[2026-05-25 11:22:40] [INFO ] Flow matrix only has 520 transitions (discarded 8 similar events)
[2026-05-25 11:22:40] [INFO ] Invariant cache hit.
[2026-05-25 11:22:40] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 518/613 variables, 95/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 126/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/616 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/616 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/617 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/617 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/617 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 617/617 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 518/613 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 126/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/613 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/616 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/616 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/616 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/617 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/617 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/617 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 617/617 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 857 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 97/97 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1237ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1178 steps, including 91 resets, run visited all 1 properties in 6 ms. (steps per millisecond=196 )
Parikh walk visited 1 properties in 6 ms.
Knowledge based reduction with 3 factoid took 81 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 54 ms :[(NOT p0)]
Knowledge-based reduction took 4514 ms.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8057 reset in 320 ms.
Product exploration explored 100000 steps with 8065 reset in 341 ms.
Built C files in :
/tmp/ltsmin2029056778066879301
[2026-05-25 11:22:42] [INFO ] Computing symmetric may disable matrix : 528 transitions.
[2026-05-25 11:22:42] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:22:42] [INFO ] Computing symmetric may enable matrix : 528 transitions.
[2026-05-25 11:22:42] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:22:42] [INFO ] Computing Do-Not-Accords matrix : 528 transitions.
[2026-05-25 11:22:42] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:22:42] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2029056778066879301
Running compilation step : cd /tmp/ltsmin2029056778066879301;'/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 1968 ms.
Running link step : cd /tmp/ltsmin2029056778066879301;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin2029056778066879301;'/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/stateBased17459313142300431752.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 528/528 transitions.
Applied a total of 0 rules in 34 ms. Remains 97 /97 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2026-05-25 11:22:57] [INFO ] Flow matrix only has 520 transitions (discarded 8 similar events)
[2026-05-25 11:22:57] [INFO ] Invariant cache hit.
[2026-05-25 11:22:57] [INFO ] Implicit Places using invariants in 303 ms returned []
[2026-05-25 11:22:57] [INFO ] Flow matrix only has 520 transitions (discarded 8 similar events)
[2026-05-25 11:22:57] [INFO ] Invariant cache hit.
[2026-05-25 11:22:57] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:22:58] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
[2026-05-25 11:22:58] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 954 ms. Remains : 97/97 places, 528/528 transitions.
Built C files in :
/tmp/ltsmin264603712512819588
[2026-05-25 11:22:58] [INFO ] Computing symmetric may disable matrix : 528 transitions.
[2026-05-25 11:22:58] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:22:58] [INFO ] Computing symmetric may enable matrix : 528 transitions.
[2026-05-25 11:22:58] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:22:58] [INFO ] Computing Do-Not-Accords matrix : 528 transitions.
[2026-05-25 11:22:58] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:22:58] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin264603712512819588
Running compilation step : cd /tmp/ltsmin264603712512819588;'/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 1987 ms.
Running link step : cd /tmp/ltsmin264603712512819588;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin264603712512819588;'/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/stateBased10279622811914427949.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 11:23:13] [INFO ] Flatten gal took : 30 ms
[2026-05-25 11:23:13] [INFO ] Flatten gal took : 29 ms
[2026-05-25 11:23:13] [INFO ] Time to serialize gal into /tmp/LTL5986994724422215456.gal : 5 ms
[2026-05-25 11:23:13] [INFO ] Time to serialize properties into /tmp/LTL9568115204783763849.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5986994724422215456.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17263664433676883618.hoa' '-atoms' '/tmp/LTL9568115204783763849.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9568115204783763849.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17263664433676883618.hoa
Detected timeout of ITS tools.
[2026-05-25 11:23:29] [INFO ] Flatten gal took : 28 ms
[2026-05-25 11:23:29] [INFO ] Flatten gal took : 27 ms
[2026-05-25 11:23:29] [INFO ] Time to serialize gal into /tmp/LTL8224345033633931525.gal : 5 ms
[2026-05-25 11:23:29] [INFO ] Time to serialize properties into /tmp/LTL13057053690122157602.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8224345033633931525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13057053690122157602.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p458==0)||(p887==1))"))))
Formula 0 simplified : GF!"((p458==0)||(p887==1))"
Detected timeout of ITS tools.
[2026-05-25 11:23:44] [INFO ] Flatten gal took : 29 ms
[2026-05-25 11:23:44] [INFO ] Applying decomposition
[2026-05-25 11:23:44] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13334107990804280281.txt' '-o' '/tmp/graph13334107990804280281.bin' '-w' '/tmp/graph13334107990804280281.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13334107990804280281.bin' '-l' '-1' '-v' '-w' '/tmp/graph13334107990804280281.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:23:44] [INFO ] Decomposing Gal with order
[2026-05-25 11:23:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:23:44] [INFO ] Removed a total of 2758 redundant transitions.
[2026-05-25 11:23:44] [INFO ] Flatten gal took : 51 ms
[2026-05-25 11:23:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 12 ms.
[2026-05-25 11:23:44] [INFO ] Time to serialize gal into /tmp/LTL4031241690706875836.gal : 3 ms
[2026-05-25 11:23:44] [INFO ] Time to serialize properties into /tmp/LTL5546342112942655690.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4031241690706875836.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5546342112942655690.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((i2.u6.p458==0)||(i2.u11.p887==1))"))))
Formula 0 simplified : GF!"((i2.u6.p458==0)||(i2.u11.p887==1))"
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B07-LTLCardinality-02 finished in 151781 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((F(!p0)&&F((G(p1)||G(!p0)))))||(X(F((!p0&&X(G((!p0||G(p1)))))))&&G(!p2)))))'
Support contains 6 out of 1476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1476/1476 places, 6089/6089 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1462 transition count 6075
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1462 transition count 6075
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 1452 transition count 6065
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 1452 transition count 6065
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1452 transition count 6064
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 1443 transition count 6055
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 1443 transition count 6055
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 74 place count 1436 transition count 6048
Iterating global reduction 1 with 7 rules applied. Total rules applied 81 place count 1436 transition count 6048
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 87 place count 1430 transition count 6042
Iterating global reduction 1 with 6 rules applied. Total rules applied 93 place count 1430 transition count 6042
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 1430 transition count 6041
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 99 place count 1425 transition count 6036
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 1425 transition count 6036
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 108 place count 1421 transition count 6032
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 1421 transition count 6032
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 116 place count 1417 transition count 6028
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 1417 transition count 6028
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 124 place count 1413 transition count 6024
Iterating global reduction 2 with 4 rules applied. Total rules applied 128 place count 1413 transition count 6024
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 1410 transition count 6021
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 1410 transition count 6021
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 137 place count 1407 transition count 6018
Iterating global reduction 2 with 3 rules applied. Total rules applied 140 place count 1407 transition count 6018
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 143 place count 1404 transition count 6015
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 1404 transition count 6015
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 149 place count 1401 transition count 6012
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 1401 transition count 6012
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 153 place count 1401 transition count 6011
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 155 place count 1399 transition count 6009
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 1399 transition count 6009
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 159 place count 1397 transition count 6007
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 1397 transition count 6007
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 163 place count 1395 transition count 6005
Iterating global reduction 3 with 2 rules applied. Total rules applied 165 place count 1395 transition count 6005
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 167 place count 1393 transition count 6003
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 1393 transition count 6003
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 1393 transition count 6002
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 171 place count 1392 transition count 6001
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 1392 transition count 6001
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 173 place count 1391 transition count 6000
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 1391 transition count 6000
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 175 place count 1390 transition count 5999
Iterating global reduction 4 with 1 rules applied. Total rules applied 176 place count 1390 transition count 5999
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 177 place count 1390 transition count 5998
Applied a total of 177 rules in 2474 ms. Remains 1390 /1476 variables (removed 86) and now considering 5998/6089 (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-10923180160483245853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13048661791171927630.kers'
[2026-05-25 11:24:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10923180160483245853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13048661791171927630.kers]
Culled 0 columns in 21 ms.
// Phase 1: matrix 5998 rows 1390 cols 66227 entries
Finished phase 1 with 1382 SingleSign rule and 0 generalized
[2026-05-25 11:24:02] [INFO ] Computed 8 invariants in 110 ms
Computed 8 P flows in 110 ms.
Exported basis to /tmp/petrispot-output-13048661791171927630.kers
Total runtime 120 ms.
[2026-05-25 11:24:04] [INFO ] Implicit Places using invariants in 2359 ms returned []
[2026-05-25 11:24:04] [INFO ] Invariant cache hit.
[2026-05-25 11:24:09] [INFO ] Implicit Places using invariants and state equation in 5111 ms returned []
Implicit Place search using SMT with State Equation took 7477 ms to find 0 implicit places.
Running 5997 sub problems to find dead transitions.
[2026-05-25 11:24: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 1389/7388 variables, and 0 constraints, problems are : Problem set: 0 solved, 5997 unsolved in 30143 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1390 constraints, PredecessorRefiner: 5997/1581 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5997 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1389/7388 variables, and 0 constraints, problems are : Problem set: 0 solved, 5997 unsolved in 30143 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1390 constraints, PredecessorRefiner: 4416/1581 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 70998ms problems are : Problem set: 0 solved, 5997 unsolved
Search for dead transitions found 0 dead transitions in 71021ms
Starting structural reductions in LTL mode, iteration 1 : 1390/1476 places, 5998/6089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81005 ms. Remains : 1390/1476 places, 5998/6089 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p0)&&F((G(p1)||G(p0)))))||(X(F((X(G((p0||G(p1))))&&p2)))&&G(p3)))))'
Stuttering acceptance computed with spot in 975 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Running random walk in product with property : MedleyB-PT-B07-LTLCardinality-04
Stuttering criterion allowed to conclude after 495 steps with 3 reset in 6 ms.
FORMULA MedleyB-PT-B07-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B07-LTLCardinality-04 finished in 82124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1476/1476 places, 6089/6089 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1460 transition count 6073
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1460 transition count 6073
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 45 place count 1447 transition count 6060
Iterating global reduction 0 with 13 rules applied. Total rules applied 58 place count 1447 transition count 6060
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 1447 transition count 6059
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 71 place count 1435 transition count 6047
Iterating global reduction 1 with 12 rules applied. Total rules applied 83 place count 1435 transition count 6047
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 1425 transition count 6037
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 1425 transition count 6037
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 112 place count 1416 transition count 6028
Iterating global reduction 1 with 9 rules applied. Total rules applied 121 place count 1416 transition count 6028
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 122 place count 1416 transition count 6027
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 130 place count 1408 transition count 6019
Iterating global reduction 2 with 8 rules applied. Total rules applied 138 place count 1408 transition count 6019
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 145 place count 1401 transition count 6012
Iterating global reduction 2 with 7 rules applied. Total rules applied 152 place count 1401 transition count 6012
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 153 place count 1401 transition count 6011
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 158 place count 1396 transition count 6006
Iterating global reduction 3 with 5 rules applied. Total rules applied 163 place count 1396 transition count 6006
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 168 place count 1391 transition count 6001
Iterating global reduction 3 with 5 rules applied. Total rules applied 173 place count 1391 transition count 6001
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 177 place count 1387 transition count 5997
Iterating global reduction 3 with 4 rules applied. Total rules applied 181 place count 1387 transition count 5997
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 185 place count 1383 transition count 5993
Iterating global reduction 3 with 4 rules applied. Total rules applied 189 place count 1383 transition count 5993
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 190 place count 1383 transition count 5992
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 193 place count 1380 transition count 5989
Iterating global reduction 4 with 3 rules applied. Total rules applied 196 place count 1380 transition count 5989
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 199 place count 1377 transition count 5986
Iterating global reduction 4 with 3 rules applied. Total rules applied 202 place count 1377 transition count 5986
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 1377 transition count 5985
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 205 place count 1375 transition count 5983
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 1375 transition count 5983
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 209 place count 1373 transition count 5981
Iterating global reduction 5 with 2 rules applied. Total rules applied 211 place count 1373 transition count 5981
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 213 place count 1371 transition count 5979
Iterating global reduction 5 with 2 rules applied. Total rules applied 215 place count 1371 transition count 5979
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 217 place count 1369 transition count 5977
Iterating global reduction 5 with 2 rules applied. Total rules applied 219 place count 1369 transition count 5977
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 220 place count 1369 transition count 5976
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 221 place count 1368 transition count 5975
Iterating global reduction 6 with 1 rules applied. Total rules applied 222 place count 1368 transition count 5975
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 223 place count 1367 transition count 5974
Iterating global reduction 6 with 1 rules applied. Total rules applied 224 place count 1367 transition count 5974
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 225 place count 1366 transition count 5973
Iterating global reduction 6 with 1 rules applied. Total rules applied 226 place count 1366 transition count 5973
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 227 place count 1366 transition count 5972
Applied a total of 227 rules in 2241 ms. Remains 1366 /1476 variables (removed 110) and now considering 5972/6089 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3849796868839501510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7395003572077126057.kers'
[2026-05-25 11:25:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3849796868839501510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7395003572077126057.kers]
Culled 0 columns in 21 ms.
// Phase 1: matrix 5972 rows 1366 cols 66171 entries
Finished phase 1 with 1358 SingleSign rule and 0 generalized
[2026-05-25 11:25:24] [INFO ] Computed 8 invariants in 115 ms
Computed 8 P flows in 116 ms.
Exported basis to /tmp/petrispot-output-7395003572077126057.kers
Total runtime 136 ms.
[2026-05-25 11:25:26] [INFO ] Implicit Places using invariants in 2461 ms returned []
[2026-05-25 11:25:26] [INFO ] Invariant cache hit.
[2026-05-25 11:25:31] [INFO ] Implicit Places using invariants and state equation in 5096 ms returned []
Implicit Place search using SMT with State Equation took 7564 ms to find 0 implicit places.
Running 5971 sub problems to find dead transitions.
[2026-05-25 11:25:31] [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 1365/7338 variables, and 0 constraints, problems are : Problem set: 0 solved, 5971 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1366 constraints, PredecessorRefiner: 5971/1555 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5971 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1365/7338 variables, and 0 constraints, problems are : Problem set: 0 solved, 5971 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1366 constraints, PredecessorRefiner: 4416/1555 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 70572ms problems are : Problem set: 0 solved, 5971 unsolved
Search for dead transitions found 0 dead transitions in 70605ms
Starting structural reductions in LTL mode, iteration 1 : 1366/1476 places, 5972/6089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80445 ms. Remains : 1366/1476 places, 5972/6089 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B07-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B07-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B07-LTLCardinality-10 finished in 80677 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(X(X((G(F(p1)) U p2))))))))'
Support contains 6 out of 1476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1476/1476 places, 6089/6089 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1463 transition count 6076
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1463 transition count 6076
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1453 transition count 6066
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1453 transition count 6066
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1453 transition count 6065
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 1444 transition count 6056
Iterating global reduction 1 with 9 rules applied. Total rules applied 65 place count 1444 transition count 6056
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 1436 transition count 6048
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 1436 transition count 6048
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 89 place count 1428 transition count 6040
Iterating global reduction 1 with 8 rules applied. Total rules applied 97 place count 1428 transition count 6040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 1428 transition count 6039
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 105 place count 1421 transition count 6032
Iterating global reduction 2 with 7 rules applied. Total rules applied 112 place count 1421 transition count 6032
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 118 place count 1415 transition count 6026
Iterating global reduction 2 with 6 rules applied. Total rules applied 124 place count 1415 transition count 6026
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 1415 transition count 6025
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 1411 transition count 6021
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 1411 transition count 6021
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 1407 transition count 6017
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 1407 transition count 6017
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 1404 transition count 6014
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 1404 transition count 6014
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 150 place count 1401 transition count 6011
Iterating global reduction 3 with 3 rules applied. Total rules applied 153 place count 1401 transition count 6011
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 1401 transition count 6010
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 156 place count 1399 transition count 6008
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 1399 transition count 6008
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 160 place count 1397 transition count 6006
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 1397 transition count 6006
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 1397 transition count 6005
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 1396 transition count 6004
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 1396 transition count 6004
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 166 place count 1395 transition count 6003
Iterating global reduction 5 with 1 rules applied. Total rules applied 167 place count 1395 transition count 6003
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 168 place count 1394 transition count 6002
Iterating global reduction 5 with 1 rules applied. Total rules applied 169 place count 1394 transition count 6002
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 170 place count 1393 transition count 6001
Iterating global reduction 5 with 1 rules applied. Total rules applied 171 place count 1393 transition count 6001
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 172 place count 1392 transition count 6000
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 1392 transition count 6000
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 174 place count 1391 transition count 5999
Iterating global reduction 5 with 1 rules applied. Total rules applied 175 place count 1391 transition count 5999
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 176 place count 1390 transition count 5998
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 1390 transition count 5998
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 178 place count 1390 transition count 5997
Applied a total of 178 rules in 2212 ms. Remains 1390 /1476 variables (removed 86) and now considering 5997/6089 (removed 92) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1046756514860299231.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4505728809879233833.kers'
[2026-05-25 11:26:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1046756514860299231.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4505728809879233833.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 5997 rows 1390 cols 66229 entries
Finished phase 1 with 1382 SingleSign rule and 0 generalized
[2026-05-25 11:26:44] [INFO ] Computed 8 invariants in 81 ms
Computed 8 P flows in 82 ms.
Exported basis to /tmp/petrispot-output-4505728809879233833.kers
Total runtime 102 ms.
[2026-05-25 11:26:46] [INFO ] Implicit Places using invariants in 2399 ms returned []
[2026-05-25 11:26:46] [INFO ] Invariant cache hit.
[2026-05-25 11:26:52] [INFO ] Implicit Places using invariants and state equation in 5402 ms returned []
Implicit Place search using SMT with State Equation took 7812 ms to find 0 implicit places.
Running 5996 sub problems to find dead transitions.
[2026-05-25 11:26:52] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1389/7387 variables, and 0 constraints, problems are : Problem set: 0 solved, 5996 unsolved in 30118 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1390 constraints, PredecessorRefiner: 5996/1579 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5996 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1389/7387 variables, and 0 constraints, problems are : Problem set: 0 solved, 5996 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1390 constraints, PredecessorRefiner: 4417/1579 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 70375ms problems are : Problem set: 0 solved, 5996 unsolved
Search for dead transitions found 0 dead transitions in 70426ms
Starting structural reductions in LTL mode, iteration 1 : 1390/1476 places, 5997/6089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80486 ms. Remains : 1390/1476 places, 5997/6089 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(X(X((G(F(p1)) U p2))))))))'
Stuttering acceptance computed with spot in 556 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : MedleyB-PT-B07-LTLCardinality-13
Product exploration explored 100000 steps with 16667 reset in 549 ms.
Product exploration explored 100000 steps with 16684 reset in 548 ms.
Computed a total of 291 stabilizing places and 305 stable transitions
Computed a total of 291 stabilizing places and 305 stable transitions
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 13 states, 21 edges and 3 AP (stutter sensitive) to 13 states, 21 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (307 resets) in 455 ms. (87 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (46 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (45 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (45 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (43 resets) in 335 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (43 resets) in 187 ms. (212 steps per ms) remains 5/5 properties
[2026-05-25 11:28:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 794/800 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/800 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 590/1390 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1390 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 5997/7387 variables, 1390/1398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7387 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/7387 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7387/7387 variables, and 1398 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3737 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1390/1390 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 794/800 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/800 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/800 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 590/1390 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1390/7387 variables, and 10 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/1390 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8787ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1390/1390 places, 5997/5997 transitions.
Graph (trivial) has 1376 edges and 1390 vertex of which 112 / 1390 are part of one of the 21 SCC in 1 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Graph (complete) has 2548 edges and 1299 vertex of which 1292 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 964 transitions
Trivial Post-agglo rules discarded 964 transitions
Performed 964 trivial Post agglomeration. Transition count delta: 964
Iterating post reduction 0 with 971 rules applied. Total rules applied 973 place count 1292 transition count 4900
Reduce places removed 964 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 986 rules applied. Total rules applied 1959 place count 328 transition count 4878
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 1969 place count 320 transition count 4876
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1971 place count 318 transition count 4876
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 82 Pre rules applied. Total rules applied 1971 place count 318 transition count 4794
Deduced a syphon composed of 82 places in 2 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 2135 place count 236 transition count 4794
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2136 place count 236 transition count 4793
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 2238 place count 185 transition count 4742
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2252 place count 185 transition count 4728
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 2293 place count 144 transition count 633
Iterating global reduction 6 with 41 rules applied. Total rules applied 2334 place count 144 transition count 633
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 2354 place count 144 transition count 613
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2374 place count 124 transition count 593
Iterating global reduction 7 with 20 rules applied. Total rules applied 2394 place count 124 transition count 593
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 2407 place count 111 transition count 580
Iterating global reduction 7 with 13 rules applied. Total rules applied 2420 place count 111 transition count 580
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2426 place count 111 transition count 574
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 2440 place count 104 transition count 567
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2446 place count 101 transition count 575
Free-agglomeration rule applied 40 times.
Iterating global reduction 8 with 40 rules applied. Total rules applied 2486 place count 101 transition count 535
Reduce places removed 40 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 8 with 73 rules applied. Total rules applied 2559 place count 61 transition count 502
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2566 place count 54 transition count 495
Iterating global reduction 9 with 7 rules applied. Total rules applied 2573 place count 54 transition count 495
Drop transitions (Redundant composition of simpler transitions.) removed 190 transitions
Redundant transition composition rules discarded 190 transitions
Iterating global reduction 9 with 190 rules applied. Total rules applied 2763 place count 54 transition count 305
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 9 with 2 rules applied. Total rules applied 2765 place count 53 transition count 304
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2769 place count 51 transition count 322
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 2772 place count 51 transition count 319
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2775 place count 48 transition count 319
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 2780 place count 48 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2784 place count 48 transition count 315
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2785 place count 47 transition count 313
Iterating global reduction 10 with 1 rules applied. Total rules applied 2786 place count 47 transition count 313
Applied a total of 2786 rules in 432 ms. Remains 47 /1390 variables (removed 1343) and now considering 313/5997 (removed 5684) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 47/1390 places, 313/5997 transitions.
RANDOM walk for 40000 steps (8 resets) in 312 ms. (127 steps per ms) remains 1/4 properties
BEST_FIRST walk for 7120 steps (2 resets) in 10 ms. (647 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 13 states, 21 edges and 3 AP (stutter sensitive) to 13 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 930 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Knowledge-based reduction took 11150 ms.
Stuttering acceptance computed with spot in 784 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 6 out of 1390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1390/1390 places, 5997/5997 transitions.
Applied a total of 0 rules in 108 ms. Remains 1390 /1390 variables (removed 0) and now considering 5997/5997 (removed 0) transitions.
[2026-05-25 11:28:16] [INFO ] Invariant cache hit.
[2026-05-25 11:28:18] [INFO ] Implicit Places using invariants in 2365 ms returned []
[2026-05-25 11:28:18] [INFO ] Invariant cache hit.
[2026-05-25 11:28:24] [INFO ] Implicit Places using invariants and state equation in 5552 ms returned []
Implicit Place search using SMT with State Equation took 7960 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 8070 ms. Remains : 1390/1390 places, 5997/5997 transitions.
Computed a total of 291 stabilizing places and 305 stable transitions
Computed a total of 291 stabilizing places and 305 stable transitions
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 13 states, 20 edges and 3 AP (stutter sensitive) to 13 states, 20 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (305 resets) in 359 ms. (111 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (45 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (46 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (44 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (44 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
[2026-05-25 11:28:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 794/800 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/800 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 590/1390 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1390 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 5997/7387 variables, 1390/1398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7387 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/7387 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7387/7387 variables, and 1398 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3771 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1390/1390 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 794/800 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/800 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 590/1390 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1390 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1390/7387 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/1390 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8806ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1390/1390 places, 5997/5997 transitions.
Graph (trivial) has 1376 edges and 1390 vertex of which 112 / 1390 are part of one of the 21 SCC in 1 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Graph (complete) has 2548 edges and 1299 vertex of which 1292 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 964 transitions
Trivial Post-agglo rules discarded 964 transitions
Performed 964 trivial Post agglomeration. Transition count delta: 964
Iterating post reduction 0 with 971 rules applied. Total rules applied 973 place count 1292 transition count 4900
Reduce places removed 964 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 986 rules applied. Total rules applied 1959 place count 328 transition count 4878
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 1969 place count 320 transition count 4876
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1971 place count 318 transition count 4876
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 82 Pre rules applied. Total rules applied 1971 place count 318 transition count 4794
Deduced a syphon composed of 82 places in 2 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 2135 place count 236 transition count 4794
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2136 place count 236 transition count 4793
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 2238 place count 185 transition count 4742
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2252 place count 185 transition count 4728
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 2293 place count 144 transition count 633
Iterating global reduction 6 with 41 rules applied. Total rules applied 2334 place count 144 transition count 633
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 2354 place count 144 transition count 613
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2374 place count 124 transition count 593
Iterating global reduction 7 with 20 rules applied. Total rules applied 2394 place count 124 transition count 593
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 2407 place count 111 transition count 580
Iterating global reduction 7 with 13 rules applied. Total rules applied 2420 place count 111 transition count 580
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2426 place count 111 transition count 574
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 2440 place count 104 transition count 567
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2446 place count 101 transition count 575
Free-agglomeration rule applied 40 times.
Iterating global reduction 8 with 40 rules applied. Total rules applied 2486 place count 101 transition count 535
Reduce places removed 40 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 8 with 73 rules applied. Total rules applied 2559 place count 61 transition count 502
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2566 place count 54 transition count 495
Iterating global reduction 9 with 7 rules applied. Total rules applied 2573 place count 54 transition count 495
Drop transitions (Redundant composition of simpler transitions.) removed 190 transitions
Redundant transition composition rules discarded 190 transitions
Iterating global reduction 9 with 190 rules applied. Total rules applied 2763 place count 54 transition count 305
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 9 with 2 rules applied. Total rules applied 2765 place count 53 transition count 304
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2769 place count 51 transition count 322
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 2772 place count 51 transition count 319
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2775 place count 48 transition count 319
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 2780 place count 48 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2784 place count 48 transition count 315
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2785 place count 47 transition count 313
Iterating global reduction 10 with 1 rules applied. Total rules applied 2786 place count 47 transition count 313
Applied a total of 2786 rules in 444 ms. Remains 47 /1390 variables (removed 1343) and now considering 313/5997 (removed 5684) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 444 ms. Remains : 47/1390 places, 313/5997 transitions.
RANDOM walk for 40000 steps (8 resets) in 227 ms. (175 steps per ms) remains 1/4 properties
BEST_FIRST walk for 13884 steps (4 resets) in 12 ms. (1068 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 234 ms. Reduced automaton from 13 states, 20 edges and 3 AP (stutter sensitive) to 13 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 667 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Knowledge-based reduction took 10768 ms.
Stuttering acceptance computed with spot in 687 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 679 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 16615 reset in 507 ms.
Product exploration explored 100000 steps with 16672 reset in 545 ms.
Spot run failed in 99 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin6024708552471857968
[2026-05-25 11:28:38] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6024708552471857968
Running compilation step : cd /tmp/ltsmin6024708552471857968;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6024708552471857968;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6024708552471857968;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 1390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1390/1390 places, 5997/5997 transitions.
Applied a total of 0 rules in 102 ms. Remains 1390 /1390 variables (removed 0) and now considering 5997/5997 (removed 0) transitions.
[2026-05-25 11:28:41] [INFO ] Invariant cache hit.
[2026-05-25 11:28:43] [INFO ] Implicit Places using invariants in 2280 ms returned []
[2026-05-25 11:28:43] [INFO ] Invariant cache hit.
[2026-05-25 11:28:48] [INFO ] Implicit Places using invariants and state equation in 4675 ms returned []
Implicit Place search using SMT with State Equation took 6983 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 7099 ms. Remains : 1390/1390 places, 5997/5997 transitions.
Built C files in :
/tmp/ltsmin12741515602133797520
[2026-05-25 11:28:48] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12741515602133797520
Running compilation step : cd /tmp/ltsmin12741515602133797520;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12741515602133797520;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12741515602133797520;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-25 11:28:51] [INFO ] Flatten gal took : 239 ms
[2026-05-25 11:28:52] [INFO ] Flatten gal took : 248 ms
[2026-05-25 11:28:52] [INFO ] Time to serialize gal into /tmp/LTL8728668198994946857.gal : 83 ms
[2026-05-25 11:28:52] [INFO ] Time to serialize properties into /tmp/LTL15024322285523390368.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8728668198994946857.gal' '-t' 'CGAL' '-hoa' '/tmp/aut666191222814942391.hoa' '-atoms' '/tmp/LTL15024322285523390368.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL15024322285523390368.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut666191222814942391.hoa
Detected timeout of ITS tools.
[2026-05-25 11:29:07] [INFO ] Flatten gal took : 288 ms
[2026-05-25 11:29:07] [INFO ] Flatten gal took : 233 ms
[2026-05-25 11:29:07] [INFO ] Time to serialize gal into /tmp/LTL17126728124606352353.gal : 62 ms
[2026-05-25 11:29:07] [INFO ] Time to serialize properties into /tmp/LTL13370977301773211911.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17126728124606352353.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13370977301773211911.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p409==0)||(p484==1))")U(X(X(X((G(F("((p1880==0)||(p1397==1))")))U("((p2087==0)||(p1607==1))")))))))))
Formula 0 simplified : XF(!"((p409==0)||(p484==1))" R XXX(FG!"((p1880==0)||(p1397==1))" R !"((p2087==0)||(p1607==1))"))
Detected timeout of ITS tools.
[2026-05-25 11:29:23] [INFO ] Flatten gal took : 253 ms
[2026-05-25 11:29:23] [INFO ] Applying decomposition
[2026-05-25 11:29:23] [INFO ] Flatten gal took : 264 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3309057328196480829.txt' '-o' '/tmp/graph3309057328196480829.bin' '-w' '/tmp/graph3309057328196480829.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3309057328196480829.bin' '-l' '-1' '-v' '-w' '/tmp/graph3309057328196480829.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:29:24] [INFO ] Decomposing Gal with order
[2026-05-25 11:29:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:29:25] [INFO ] Removed a total of 31736 redundant transitions.
[2026-05-25 11:29:25] [INFO ] Flatten gal took : 414 ms
[2026-05-25 11:29:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 138 ms.
[2026-05-25 11:29:25] [INFO ] Time to serialize gal into /tmp/LTL2977372548181598315.gal : 26 ms
[2026-05-25 11:29:25] [INFO ] Time to serialize properties into /tmp/LTL7906515293045761358.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2977372548181598315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7906515293045761358.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i11.i0.i1.u123.p409==0)||(i13.i1.i1.u145.p484==1))")U(X(X(X((G(F("((i0.u517.p1880==0)||(i30.i1.i1.u387.p1397==1))")))U("((i...210
Formula 0 simplified : XF(!"((i11.i0.i1.u123.p409==0)||(i13.i1.i1.u145.p484==1))" R XXX(FG!"((i0.u517.p1880==0)||(i30.i1.i1.u387.p1397==1))" R !"((i39.i1.i...196
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B07-LTLCardinality-13 finished in 178457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(p1))))'
Support contains 3 out of 1476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1476/1476 places, 6089/6089 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1461 transition count 6074
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1461 transition count 6074
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 1450 transition count 6063
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 1450 transition count 6063
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 1450 transition count 6062
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 63 place count 1440 transition count 6052
Iterating global reduction 1 with 10 rules applied. Total rules applied 73 place count 1440 transition count 6052
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 82 place count 1431 transition count 6043
Iterating global reduction 1 with 9 rules applied. Total rules applied 91 place count 1431 transition count 6043
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 99 place count 1423 transition count 6035
Iterating global reduction 1 with 8 rules applied. Total rules applied 107 place count 1423 transition count 6035
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 1423 transition count 6034
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 115 place count 1416 transition count 6027
Iterating global reduction 2 with 7 rules applied. Total rules applied 122 place count 1416 transition count 6027
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 128 place count 1410 transition count 6021
Iterating global reduction 2 with 6 rules applied. Total rules applied 134 place count 1410 transition count 6021
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 1410 transition count 6020
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 139 place count 1406 transition count 6016
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 1406 transition count 6016
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 147 place count 1402 transition count 6012
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 1402 transition count 6012
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 154 place count 1399 transition count 6009
Iterating global reduction 3 with 3 rules applied. Total rules applied 157 place count 1399 transition count 6009
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 1396 transition count 6006
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 1396 transition count 6006
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 164 place count 1396 transition count 6005
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 166 place count 1394 transition count 6003
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 1394 transition count 6003
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 170 place count 1392 transition count 6001
Iterating global reduction 4 with 2 rules applied. Total rules applied 172 place count 1392 transition count 6001
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 174 place count 1390 transition count 5999
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 1390 transition count 5999
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 178 place count 1388 transition count 5997
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 1388 transition count 5997
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 182 place count 1386 transition count 5995
Iterating global reduction 4 with 2 rules applied. Total rules applied 184 place count 1386 transition count 5995
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 186 place count 1384 transition count 5993
Iterating global reduction 4 with 2 rules applied. Total rules applied 188 place count 1384 transition count 5993
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 189 place count 1384 transition count 5992
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 1383 transition count 5991
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 1383 transition count 5991
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 192 place count 1382 transition count 5990
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 1382 transition count 5990
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 1381 transition count 5989
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 1381 transition count 5989
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 196 place count 1381 transition count 5988
Applied a total of 196 rules in 2141 ms. Remains 1381 /1476 variables (removed 95) and now considering 5988/6089 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6100410290642596780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6392715760707735903.kers'
[2026-05-25 11:29:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6100410290642596780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6392715760707735903.kers]
Culled 0 columns in 21 ms.
// Phase 1: matrix 5988 rows 1381 cols 66209 entries
Finished phase 1 with 1373 SingleSign rule and 0 generalized
[2026-05-25 11:29:43] [INFO ] Computed 8 invariants in 104 ms
Computed 8 P flows in 118 ms.
Exported basis to /tmp/petrispot-output-6392715760707735903.kers
Total runtime 137 ms.
[2026-05-25 11:29:45] [INFO ] Implicit Places using invariants in 2370 ms returned []
[2026-05-25 11:29:45] [INFO ] Invariant cache hit.
[2026-05-25 11:29:50] [INFO ] Implicit Places using invariants and state equation in 5519 ms returned []
Implicit Place search using SMT with State Equation took 7910 ms to find 0 implicit places.
Running 5987 sub problems to find dead transitions.
[2026-05-25 11:29:50] [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 1380/7369 variables, and 0 constraints, problems are : Problem set: 0 solved, 5987 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1381 constraints, PredecessorRefiner: 5987/1571 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5987 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1380/7369 variables, and 0 constraints, problems are : Problem set: 0 solved, 5987 unsolved in 30147 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1381 constraints, PredecessorRefiner: 4416/1571 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 70610ms problems are : Problem set: 0 solved, 5987 unsolved
Search for dead transitions found 0 dead transitions in 70631ms
Starting structural reductions in LTL mode, iteration 1 : 1381/1476 places, 5988/6089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80708 ms. Remains : 1381/1476 places, 5988/6089 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(p1))))'
Stuttering acceptance computed with spot in 476 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B07-LTLCardinality-14
Product exploration explored 100000 steps with 1911 reset in 538 ms.
Product exploration explored 100000 steps with 1917 reset in 459 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Detected a total of 287/1381 stabilizing places and 301/5988 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 6 factoid took 107 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (306 resets) in 297 ms. (134 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (46 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (43 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
[2026-05-25 11:31:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 596/599 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 782/1381 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1381 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5988/7369 variables, 1381/1389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7369 variables, 0/1389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7369 variables, 0/1389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7369/7369 variables, and 1389 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2452 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1381/1381 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 596/599 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 8454ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 5988/5988 transitions.
Graph (trivial) has 1371 edges and 1381 vertex of which 112 / 1381 are part of one of the 21 SCC in 1 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Graph (complete) has 2537 edges and 1290 vertex of which 1283 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 965 transitions
Trivial Post-agglo rules discarded 965 transitions
Performed 965 trivial Post agglomeration. Transition count delta: 965
Iterating post reduction 0 with 972 rules applied. Total rules applied 974 place count 1283 transition count 4890
Reduce places removed 965 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 986 rules applied. Total rules applied 1960 place count 318 transition count 4869
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 1969 place count 311 transition count 4867
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1971 place count 309 transition count 4867
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 81 Pre rules applied. Total rules applied 1971 place count 309 transition count 4786
Deduced a syphon composed of 81 places in 3 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 2133 place count 228 transition count 4786
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2134 place count 228 transition count 4785
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 2234 place count 178 transition count 4735
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2248 place count 178 transition count 4721
Discarding 42 places :
Symmetric choice reduction at 6 with 42 rule applications. Total rules 2290 place count 136 transition count 562
Iterating global reduction 6 with 42 rules applied. Total rules applied 2332 place count 136 transition count 562
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 2353 place count 136 transition count 541
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2374 place count 115 transition count 520
Iterating global reduction 7 with 21 rules applied. Total rules applied 2395 place count 115 transition count 520
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 2409 place count 101 transition count 506
Iterating global reduction 7 with 14 rules applied. Total rules applied 2423 place count 101 transition count 506
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2430 place count 101 transition count 499
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 2444 place count 94 transition count 492
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2450 place count 91 transition count 500
Free-agglomeration rule applied 38 times.
Iterating global reduction 8 with 38 rules applied. Total rules applied 2488 place count 91 transition count 462
Reduce places removed 38 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 8 with 167 rules applied. Total rules applied 2655 place count 53 transition count 333
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2662 place count 46 transition count 326
Iterating global reduction 9 with 7 rules applied. Total rules applied 2669 place count 46 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 133 transitions
Redundant transition composition rules discarded 133 transitions
Iterating global reduction 9 with 133 rules applied. Total rules applied 2802 place count 46 transition count 193
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 9 with 2 rules applied. Total rules applied 2804 place count 45 transition count 192
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2808 place count 43 transition count 210
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2810 place count 43 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2812 place count 41 transition count 208
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 2818 place count 41 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2822 place count 41 transition count 204
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2823 place count 40 transition count 202
Iterating global reduction 10 with 1 rules applied. Total rules applied 2824 place count 40 transition count 202
Applied a total of 2824 rules in 403 ms. Remains 40 /1381 variables (removed 1341) and now considering 202/5988 (removed 5786) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 403 ms. Remains : 40/1381 places, 202/5988 transitions.
RANDOM walk for 270 steps (0 resets) in 11 ms. (22 steps per ms) remains 0/2 properties
Knowledge based reduction with 6 factoid took 111 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2026-05-25 11:31:12] [INFO ] Invariant cache hit.
[2026-05-25 11:31:14] [INFO ] [Real]Absence check using 8 positive place invariants in 81 ms returned sat
[2026-05-25 11:31:27] [INFO ] [Real]Absence check using state equation in 12953 ms returned unknown
Could not prove EG (NOT p1)
Knowledge-based reduction took 24759 ms.
Stuttering acceptance computed with spot in 417 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 5988/5988 transitions.
Applied a total of 0 rules in 144 ms. Remains 1381 /1381 variables (removed 0) and now considering 5988/5988 (removed 0) transitions.
[2026-05-25 11:31:28] [INFO ] Invariant cache hit.
[2026-05-25 11:31:30] [INFO ] Implicit Places using invariants in 2252 ms returned []
[2026-05-25 11:31:30] [INFO ] Invariant cache hit.
[2026-05-25 11:31:35] [INFO ] Implicit Places using invariants and state equation in 4909 ms returned []
Implicit Place search using SMT with State Equation took 7165 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 7309 ms. Remains : 1381/1381 places, 5988/5988 transitions.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Detected a total of 287/1381 stabilizing places and 301/5988 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (309 resets) in 463 ms. (86 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (46 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (43 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
[2026-05-25 11:31:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 596/599 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 782/1381 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1381 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5988/7369 variables, 1381/1389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7369 variables, 0/1389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/7369 variables, 0/1389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7369/7369 variables, and 1389 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2235 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1381/1381 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 596/599 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 8493ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1381/1381 places, 5988/5988 transitions.
Graph (trivial) has 1371 edges and 1381 vertex of which 112 / 1381 are part of one of the 21 SCC in 1 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Graph (complete) has 2537 edges and 1290 vertex of which 1283 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 965 transitions
Trivial Post-agglo rules discarded 965 transitions
Performed 965 trivial Post agglomeration. Transition count delta: 965
Iterating post reduction 0 with 972 rules applied. Total rules applied 974 place count 1283 transition count 4890
Reduce places removed 965 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 986 rules applied. Total rules applied 1960 place count 318 transition count 4869
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 1969 place count 311 transition count 4867
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1971 place count 309 transition count 4867
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 81 Pre rules applied. Total rules applied 1971 place count 309 transition count 4786
Deduced a syphon composed of 81 places in 2 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 2133 place count 228 transition count 4786
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2134 place count 228 transition count 4785
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 2234 place count 178 transition count 4735
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2248 place count 178 transition count 4721
Discarding 42 places :
Symmetric choice reduction at 6 with 42 rule applications. Total rules 2290 place count 136 transition count 562
Iterating global reduction 6 with 42 rules applied. Total rules applied 2332 place count 136 transition count 562
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 2353 place count 136 transition count 541
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2374 place count 115 transition count 520
Iterating global reduction 7 with 21 rules applied. Total rules applied 2395 place count 115 transition count 520
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 2409 place count 101 transition count 506
Iterating global reduction 7 with 14 rules applied. Total rules applied 2423 place count 101 transition count 506
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 2430 place count 101 transition count 499
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 2444 place count 94 transition count 492
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2450 place count 91 transition count 500
Free-agglomeration rule applied 38 times.
Iterating global reduction 8 with 38 rules applied. Total rules applied 2488 place count 91 transition count 462
Reduce places removed 38 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 8 with 167 rules applied. Total rules applied 2655 place count 53 transition count 333
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 2662 place count 46 transition count 326
Iterating global reduction 9 with 7 rules applied. Total rules applied 2669 place count 46 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 133 transitions
Redundant transition composition rules discarded 133 transitions
Iterating global reduction 9 with 133 rules applied. Total rules applied 2802 place count 46 transition count 193
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 9 with 2 rules applied. Total rules applied 2804 place count 45 transition count 192
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2808 place count 43 transition count 210
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2810 place count 43 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2812 place count 41 transition count 208
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 2818 place count 41 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2822 place count 41 transition count 204
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2823 place count 40 transition count 202
Iterating global reduction 10 with 1 rules applied. Total rules applied 2824 place count 40 transition count 202
Applied a total of 2824 rules in 362 ms. Remains 40 /1381 variables (removed 1341) and now considering 202/5988 (removed 5786) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 40/1381 places, 202/5988 transitions.
RANDOM walk for 943 steps (0 resets) in 17 ms. (52 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2026-05-25 11:31:45] [INFO ] Invariant cache hit.
[2026-05-25 11:31:47] [INFO ] [Real]Absence check using 8 positive place invariants in 80 ms returned sat
[2026-05-25 11:31:59] [INFO ] [Real]Absence check using state equation in 12182 ms returned sat
[2026-05-25 11:31:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:32:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 48 ms returned sat
[2026-05-25 11:32:14] [INFO ] [Nat]Absence check using state equation in 12059 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:960)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:593)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:240)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 11:32:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Knowledge-based reduction took 39284 ms.
Stuttering acceptance computed with spot in 355 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 354 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1929 reset in 497 ms.
Product exploration explored 100000 steps with 1951 reset in 467 ms.
Spot run failed in 73 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin10195402808308857535
[2026-05-25 11:32:16] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10195402808308857535
Running compilation step : cd /tmp/ltsmin10195402808308857535;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10195402808308857535;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10195402808308857535;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1381 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1381/1381 places, 5988/5988 transitions.
Applied a total of 0 rules in 121 ms. Remains 1381 /1381 variables (removed 0) and now considering 5988/5988 (removed 0) transitions.
[2026-05-25 11:32:19] [INFO ] Invariant cache hit.
[2026-05-25 11:32:21] [INFO ] Implicit Places using invariants in 2083 ms returned []
[2026-05-25 11:32:21] [INFO ] Invariant cache hit.
[2026-05-25 11:32:27] [INFO ] Implicit Places using invariants and state equation in 5070 ms returned []
Implicit Place search using SMT with State Equation took 7178 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 7308 ms. Remains : 1381/1381 places, 5988/5988 transitions.
Built C files in :
/tmp/ltsmin11329034323079592517
[2026-05-25 11:32:27] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11329034323079592517
Running compilation step : cd /tmp/ltsmin11329034323079592517;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11329034323079592517;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11329034323079592517;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-25 11:32:30] [INFO ] Flatten gal took : 235 ms
[2026-05-25 11:32:30] [INFO ] Flatten gal took : 227 ms
[2026-05-25 11:32:30] [INFO ] Time to serialize gal into /tmp/LTL15897779847974230261.gal : 78 ms
[2026-05-25 11:32:30] [INFO ] Time to serialize properties into /tmp/LTL4783943986625872929.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15897779847974230261.gal' '-t' 'CGAL' '-hoa' '/tmp/aut230968748778087834.hoa' '-atoms' '/tmp/LTL4783943986625872929.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4783943986625872929.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut230968748778087834.hoa
Detected timeout of ITS tools.
[2026-05-25 11:32:46] [INFO ] Flatten gal took : 251 ms
[2026-05-25 11:32:46] [INFO ] Flatten gal took : 273 ms
[2026-05-25 11:32:46] [INFO ] Time to serialize gal into /tmp/LTL4750559747483181817.gal : 61 ms
[2026-05-25 11:32:46] [INFO ] Time to serialize properties into /tmp/LTL92482875700636169.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4750559747483181817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL92482875700636169.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !(((F("((p530==0)||(p1357==1))"))U(X(X("(p1806==1)")))))
Formula 0 simplified : G!"((p530==0)||(p1357==1))" R XX!"(p1806==1)"
Detected timeout of ITS tools.
[2026-05-25 11:33:02] [INFO ] Flatten gal took : 278 ms
[2026-05-25 11:33:02] [INFO ] Applying decomposition
[2026-05-25 11:33:02] [INFO ] Flatten gal took : 279 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10245864528907557278.txt' '-o' '/tmp/graph10245864528907557278.bin' '-w' '/tmp/graph10245864528907557278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10245864528907557278.bin' '-l' '-1' '-v' '-w' '/tmp/graph10245864528907557278.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:33:03] [INFO ] Decomposing Gal with order
[2026-05-25 11:33:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:33:04] [INFO ] Removed a total of 31744 redundant transitions.
[2026-05-25 11:33:04] [INFO ] Flatten gal took : 408 ms
[2026-05-25 11:33:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 115 ms.
[2026-05-25 11:33:04] [INFO ] Time to serialize gal into /tmp/LTL15504720656923134250.gal : 26 ms
[2026-05-25 11:33:04] [INFO ] Time to serialize properties into /tmp/LTL2916528929007828216.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15504720656923134250.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2916528929007828216.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("((i50.i2.i26.u146.p530==0)||(i36.i1.i1.u384.p1357==1))"))U(X(X("(i43.u494.p1806==1)")))))
Formula 0 simplified : G!"((i50.i2.i26.u146.p530==0)||(i36.i1.i1.u384.p1357==1))" R XX!"(i43.u494.p1806==1)"
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B07-LTLCardinality-14 finished in 218866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X(G(p1))) U p2)))'
Spot run failed in 74 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
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)))'
Spot run failed in 40 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
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(X(X((G(F(p1)) U p2))))))))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(p1))))'
Spot run failed in 35 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 11:33:20] [INFO ] Flatten gal took : 271 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13568578311611416013
[2026-05-25 11:33:20] [INFO ] Too many transitions (6089) to apply POR reductions. Disabling POR matrices.
[2026-05-25 11:33:20] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13568578311611416013
Running compilation step : cd /tmp/ltsmin13568578311611416013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '180' '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'
[2026-05-25 11:33:20] [INFO ] Applying decomposition
[2026-05-25 11:33:20] [INFO ] Flatten gal took : 288 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18275642256859837572.txt' '-o' '/tmp/graph18275642256859837572.bin' '-w' '/tmp/graph18275642256859837572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18275642256859837572.bin' '-l' '-1' '-v' '-w' '/tmp/graph18275642256859837572.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:33:22] [INFO ] Decomposing Gal with order
[2026-05-25 11:33:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:33:22] [INFO ] Removed a total of 31757 redundant transitions.
[2026-05-25 11:33:22] [INFO ] Flatten gal took : 513 ms
[2026-05-25 11:33:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 137 ms.
[2026-05-25 11:33:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality18013230399580340838.gal : 37 ms
[2026-05-25 11:33:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality17131290064143431972.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18013230399580340838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17131290064143431972.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 4 LTL properties
Checking formula 0 : !((X((("((i16.i1.i0.u216.p712==0)||(i46.i8.i10.u325.p1125==1))")&&(X(G("((i18.i1.i2.u241.p839==0)||(i18.i0.i2.u206.p680==1))"))))U("((...239
Formula 0 simplified : X((!"((i16.i1.i0.u216.p712==0)||(i46.i8.i10.u325.p1125==1))" | XF!"((i18.i1.i2.u241.p839==0)||(i18.i0.i2.u206.p680==1))") R !"((i9.i...232
Compilation finished in 31650 ms.
Running link step : cd /tmp/ltsmin13568578311611416013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 131 ms.
Running LTSmin : cd /tmp/ltsmin13568578311611416013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X((((LTLAPp0==true)&&X([]((LTLAPp1==true)))) U (LTLAPp2==true)))' '--buchi-type=spotba'
LTSmin run took 1252 ms.
FORMULA MedleyB-PT-B07-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin13568578311611416013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin13568578311611416013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13568578311611416013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([](((LTLAPp4==true) U X(X(X(([](<>((LTLAPp5==true))) U (LTLAPp6==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin13568578311611416013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([](((LTLAPp4==true) U X(X(X(([](<>((LTLAPp5==true))) U (LTLAPp6==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13568578311611416013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>((LTLAPp7==true)) U X(X((LTLAPp8==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin13568578311611416013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>((LTLAPp7==true)) U X(X((LTLAPp8==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin13568578311611416013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 11:59:36] [INFO ] Applying decomposition
[2026-05-25 11:59:38] [INFO ] Flatten gal took : 2475 ms
[2026-05-25 11:59:39] [INFO ] Decomposing Gal with order
[2026-05-25 11:59:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:59:57] [INFO ] Removed a total of 31580 redundant transitions.
[2026-05-25 11:59:58] [INFO ] Flatten gal took : 14991 ms
[2026-05-25 12:00:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 697 labels/synchronizations in 1177 ms.
[2026-05-25 12:00:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality15021888526055349562.gal : 57 ms
[2026-05-25 12:00:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality6202943315346434685.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15021888526055349562.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6202943315346434685.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((F(G("((i0.i0.i0.i0.i0.i0.u8.p458==0)||(i0.i0.i0.i0.i0.u9.p887==1))"))))
Formula 0 simplified : GF!"((i0.i0.i0.i0.i0.i0.u8.p458==0)||(i0.i0.i0.i0.i0.u9.p887==1))"
Reverse transition relation is NOT exact ! Due to transitions t1427, i0.u13.t103, i0.u13.t127, i0.u13.t138, i0.u13.t140, i0.u13.t194, i0.u13.t195, i0.u13.t...1612
Computing Next relation with stutter on 2.34832e+08 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyB-PT-B07"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is MedleyB-PT-B07, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-oct2-177969020100331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B07.tgz
mv MedleyB-PT-B07 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;