About the Execution of ITS-Tools for DiscoveryGPU-PT-11b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 570.092 | 299373.00 | 356765.00 | 1305.80 | FFFTFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695500324.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DiscoveryGPU-PT-11b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500324
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 9.2K Mar 6 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 6 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 6 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 6 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 09:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 09:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 6 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 6 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 6 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 6 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:13 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 82K 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 DiscoveryGPU-PT-11b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779599916014
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-11b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 05:18:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 05:18:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:18:37] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2026-05-24 05:18:37] [INFO ] Transformed 324 places.
[2026-05-24 05:18:37] [INFO ] Transformed 344 transitions.
[2026-05-24 05:18:37] [INFO ] Found NUPN structural information;
[2026-05-24 05:18:37] [INFO ] Parsed PT model containing 324 places and 344 transitions and 898 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 344/344 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 302 transition count 344
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 70 place count 254 transition count 296
Iterating global reduction 1 with 48 rules applied. Total rules applied 118 place count 254 transition count 296
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 128 place count 244 transition count 286
Iterating global reduction 1 with 10 rules applied. Total rules applied 138 place count 244 transition count 286
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 147 place count 235 transition count 277
Iterating global reduction 1 with 9 rules applied. Total rules applied 156 place count 235 transition count 277
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 164 place count 227 transition count 269
Iterating global reduction 1 with 8 rules applied. Total rules applied 172 place count 227 transition count 269
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 179 place count 220 transition count 255
Iterating global reduction 1 with 7 rules applied. Total rules applied 186 place count 220 transition count 255
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 192 place count 214 transition count 249
Iterating global reduction 1 with 6 rules applied. Total rules applied 198 place count 214 transition count 249
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 204 place count 208 transition count 243
Iterating global reduction 1 with 6 rules applied. Total rules applied 210 place count 208 transition count 243
Applied a total of 210 rules in 84 ms. Remains 208 /324 variables (removed 116) and now considering 243/344 (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-13661298173801011914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1436074678814132063.kers'
[2026-05-24 05:18:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13661298173801011914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1436074678814132063.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 243 rows 208 cols 647 entries
Finished phase 1 with 206 SingleSign rule and 0 generalized
[2026-05-24 05:18:37] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1436074678814132063.kers
Total runtime 1 ms.
[2026-05-24 05:18:37] [INFO ] Implicit Places using invariants in 237 ms returned []
[2026-05-24 05:18:37] [INFO ] Invariant cache hit.
[2026-05-24 05:18:37] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-24 05:18:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 243/451 variables, 208/210 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 12/222 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 0/451 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 222 constraints, problems are : Problem set: 0 solved, 242 unsolved in 15433 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 243/451 variables, 208/222 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 242/464 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 0/451 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 464 constraints, problems are : Problem set: 0 solved, 242 unsolved in 21184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36726ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 36743ms
Starting structural reductions in LTL mode, iteration 1 : 208/324 places, 243/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37304 ms. Remains : 208/324 places, 243/344 transitions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 243/243 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2026-05-24 05:19:14] [INFO ] Invariant cache hit.
[2026-05-24 05:19:14] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-24 05:19:14] [INFO ] Invariant cache hit.
[2026-05-24 05:19:14] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 208/208 places, 243/243 transitions.
Support contains 38 out of 208 places after structural reductions.
[2026-05-24 05:19:15] [INFO ] Flatten gal took : 38 ms
[2026-05-24 05:19:15] [INFO ] Flatten gal took : 17 ms
[2026-05-24 05:19:15] [INFO ] Input system was already deterministic with 243 transitions.
Support contains 37 out of 208 places (down from 38) after GAL structural reductions.
RANDOM walk for 20958 steps (56 resets) in 573 ms. (36 steps per ms) remains 0/36 properties
FORMULA DiscoveryGPU-PT-11b-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 40 stabilizing places and 40 stable transitions
Graph (complete) has 408 edges and 208 vertex of which 205 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(p1)))&&X(X(G(p2)))))'
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 243/243 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 195 transition count 229
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 195 transition count 229
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 189 transition count 223
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 189 transition count 223
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 186 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 186 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 184 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 184 transition count 217
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 182 transition count 214
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 182 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 181 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 181 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 180 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 180 transition count 212
Applied a total of 56 rules in 28 ms. Remains 180 /208 variables (removed 28) and now considering 212/243 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17887888650299165935.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16824348709469790598.kers'
[2026-05-24 05:19:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17887888650299165935.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16824348709469790598.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 180 cols 573 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 05:19:15] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16824348709469790598.kers
Total runtime 1 ms.
[2026-05-24 05:19:16] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-24 05:19:16] [INFO ] Invariant cache hit.
[2026-05-24 05:19:16] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2026-05-24 05:19:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 212/392 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 11/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 193 constraints, problems are : Problem set: 0 solved, 211 unsolved in 11758 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/392 variables, 180/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 211/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/392 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 404 constraints, problems are : Problem set: 0 solved, 211 unsolved in 16602 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28393ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 28394ms
Starting structural reductions in LTL mode, iteration 1 : 180/208 places, 212/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28599 ms. Remains : 180/208 places, 212/243 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||X(p1)))&&X(X(G(p2)))))'
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p2), true]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 62 steps with 3 reset in 4 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-00 finished in 29032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(((p1 U (p2||G(p1))) U ((X(!p3)&&(p1 U (p2||G(p1))))||G((p1 U (p2||G(p1)))))))))'
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 243/243 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 196 transition count 230
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 196 transition count 230
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 190 transition count 224
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 190 transition count 224
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 188 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 188 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 187 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 187 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 186 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 186 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 185 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 185 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 184 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 184 transition count 217
Applied a total of 48 rules in 26 ms. Remains 184 /208 variables (removed 24) and now considering 217/243 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-69970492714287020.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6363571005166415045.kers'
[2026-05-24 05:19:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-69970492714287020.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6363571005166415045.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 184 cols 585 entries
Finished phase 1 with 182 SingleSign rule and 0 generalized
[2026-05-24 05:19:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6363571005166415045.kers
Total runtime 1 ms.
[2026-05-24 05:19:45] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-24 05:19:45] [INFO ] Invariant cache hit.
[2026-05-24 05:19:45] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-24 05:19:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/401 variables, 184/186 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 11/197 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 197 constraints, problems are : Problem set: 0 solved, 216 unsolved in 12006 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/401 variables, 184/197 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 216/413 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 413 constraints, problems are : Problem set: 0 solved, 216 unsolved in 17310 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29346ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 29348ms
Starting structural reductions in LTL mode, iteration 1 : 184/208 places, 217/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29550 ms. Remains : 184/208 places, 217/243 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)&&X(((p1 U (p2||G(p1))) U ((X(!p3)&&(p1 U (p2||G(p1))))||G((p1 U (p2||G(p1)))))))))'
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), true, (AND (NOT p2) (NOT p1) p3), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-01
Product exploration explored 100000 steps with 2322 reset in 290 ms.
Stack based approach found an accepted trace after 211 steps with 18 reset with depth 38 and stack size 38 in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-01 finished in 30092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 243/243 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 196 transition count 230
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 196 transition count 230
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 190 transition count 224
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 190 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 187 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 187 transition count 220
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 185 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 185 transition count 218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 183 transition count 215
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 183 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 182 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 182 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 181 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 181 transition count 213
Applied a total of 54 rules in 24 ms. Remains 181 /208 variables (removed 27) and now considering 213/243 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7781947153982135461.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-407622524655968038.kers'
[2026-05-24 05:20:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7781947153982135461.kers, --Pflows, --basisKERS=/tmp/petrispot-output-407622524655968038.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 213 rows 181 cols 574 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-24 05:20:15] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-407622524655968038.kers
Total runtime 1 ms.
[2026-05-24 05:20:15] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-24 05:20:15] [INFO ] Invariant cache hit.
[2026-05-24 05:20:15] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2026-05-24 05:20:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 213/394 variables, 181/183 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 11/194 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 194 constraints, problems are : Problem set: 0 solved, 212 unsolved in 11733 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/394 variables, 181/194 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 212/406 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 406 constraints, problems are : Problem set: 0 solved, 212 unsolved in 13859 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25619ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 25620ms
Starting structural reductions in LTL mode, iteration 1 : 181/208 places, 213/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25805 ms. Remains : 181/208 places, 213/243 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))))'
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-02 finished in 25963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U p1))&&F((p2&&F(p3)))))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 243/243 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 196 transition count 231
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 196 transition count 231
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 191 transition count 226
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 191 transition count 226
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 189 transition count 223
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 189 transition count 223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 187 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 187 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 185 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 185 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 184 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 184 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 183 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 183 transition count 216
Applied a total of 50 rules in 15 ms. Remains 183 /208 variables (removed 25) and now considering 216/243 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7342957239049670184.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17450104525310388263.kers'
[2026-05-24 05:20:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7342957239049670184.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17450104525310388263.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 183 cols 583 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-24 05:20:41] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17450104525310388263.kers
Total runtime 1 ms.
[2026-05-24 05:20:41] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-24 05:20:41] [INFO ] Invariant cache hit.
[2026-05-24 05:20:41] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2026-05-24 05:20:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/399 variables, 183/185 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 11/196 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/399 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 196 constraints, problems are : Problem set: 0 solved, 215 unsolved in 11775 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/399 variables, 183/196 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 215/411 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/399 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 411 constraints, problems are : Problem set: 0 solved, 215 unsolved in 14982 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26779ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 26779ms
Starting structural reductions in LTL mode, iteration 1 : 183/208 places, 216/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26967 ms. Remains : 183/208 places, 216/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U p1))&&F((p2&&F(p3)))))'
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-04
Stuttering criterion allowed to conclude after 438 steps with 3 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-04 finished in 27226 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 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 243/243 transitions.
Graph (complete) has 408 edges and 208 vertex of which 206 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 205 transition count 205
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 170 transition count 205
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 71 place count 170 transition count 174
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 133 place count 139 transition count 174
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 139 place count 133 transition count 167
Iterating global reduction 2 with 6 rules applied. Total rules applied 145 place count 133 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 145 place count 133 transition count 166
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 132 transition count 166
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 130 transition count 164
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 130 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 129 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 129 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 128 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 128 transition count 161
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 257 place count 77 transition count 110
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 267 place count 67 transition count 91
Iterating global reduction 2 with 10 rules applied. Total rules applied 277 place count 67 transition count 91
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 287 place count 57 transition count 80
Iterating global reduction 2 with 10 rules applied. Total rules applied 297 place count 57 transition count 80
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 306 place count 48 transition count 62
Iterating global reduction 2 with 9 rules applied. Total rules applied 315 place count 48 transition count 62
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 324 place count 39 transition count 53
Iterating global reduction 2 with 9 rules applied. Total rules applied 333 place count 39 transition count 53
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 342 place count 30 transition count 35
Iterating global reduction 2 with 9 rules applied. Total rules applied 351 place count 30 transition count 35
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 360 place count 21 transition count 26
Iterating global reduction 2 with 9 rules applied. Total rules applied 369 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 370 place count 20 transition count 24
Iterating global reduction 2 with 1 rules applied. Total rules applied 371 place count 20 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 372 place count 19 transition count 23
Iterating global reduction 2 with 1 rules applied. Total rules applied 373 place count 19 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 374 place count 19 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 375 place count 19 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 377 place count 17 transition count 20
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 17 edges and 15 vertex of which 12 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 382 place count 12 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 384 place count 10 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 390 place count 7 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 391 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 393 place count 5 transition count 9
Applied a total of 393 rules in 47 ms. Remains 5 /208 variables (removed 203) and now considering 9/243 (removed 234) transitions.
[2026-05-24 05:21:08] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8334645892612468008.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15357050039926415051.kers'
[2026-05-24 05:21:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8334645892612468008.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15357050039926415051.kers]
Normalized transition count is 6 out of 7 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 6 rows 5 cols 10 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 05:21:08] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15357050039926415051.kers
Total runtime 1 ms.
[2026-05-24 05:21:08] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-24 05:21:08] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2026-05-24 05:21:08] [INFO ] Invariant cache hit.
[2026-05-24 05:21:08] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2026-05-24 05:21:08] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-24 05:21:08] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2026-05-24 05:21:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/12 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 35 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/11 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/12 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 34 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 70ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/208 places, 9/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 5/208 places, 9/243 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 38 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-05
Stuttering criterion allowed to conclude after 41 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-05 finished in 212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&G((p1||G(p2)))))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 243/243 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 197 transition count 231
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 197 transition count 231
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 191 transition count 225
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 191 transition count 225
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 188 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 188 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 186 transition count 219
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 186 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 185 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 185 transition count 218
Applied a total of 46 rules in 20 ms. Remains 185 /208 variables (removed 23) and now considering 218/243 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12640053556026603516.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14130694704156181406.kers'
[2026-05-24 05:21:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12640053556026603516.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14130694704156181406.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 185 cols 587 entries
Finished phase 1 with 183 SingleSign rule and 0 generalized
[2026-05-24 05:21:08] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14130694704156181406.kers
Total runtime 1 ms.
[2026-05-24 05:21:08] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-24 05:21:08] [INFO ] Invariant cache hit.
[2026-05-24 05:21:08] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-24 05:21:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/403 variables, 185/187 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 11/198 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/403 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 198 constraints, problems are : Problem set: 0 solved, 217 unsolved in 12197 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/403 variables, 185/198 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 217/415 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 415 constraints, problems are : Problem set: 0 solved, 217 unsolved in 17579 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29807ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 29808ms
Starting structural reductions in LTL mode, iteration 1 : 185/208 places, 218/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29995 ms. Remains : 185/208 places, 218/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&G((p1||G(p2)))))'
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-06 finished in 30269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||X(p1)) U G(p2)) U X(p3)))'
Support contains 6 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 243/243 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 197 transition count 231
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 197 transition count 231
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 192 transition count 226
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 192 transition count 226
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 189 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 189 transition count 222
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 187 transition count 220
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 187 transition count 220
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 185 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 185 transition count 217
Applied a total of 46 rules in 10 ms. Remains 185 /208 variables (removed 23) and now considering 217/243 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1140761307216654489.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1151134494758081327.kers'
[2026-05-24 05:21:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1140761307216654489.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1151134494758081327.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 185 cols 585 entries
Finished phase 1 with 183 SingleSign rule and 0 generalized
[2026-05-24 05:21:38] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1151134494758081327.kers
Total runtime 1 ms.
[2026-05-24 05:21:38] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-24 05:21:38] [INFO ] Invariant cache hit.
[2026-05-24 05:21:38] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-24 05:21:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/402 variables, 185/187 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 11/198 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 0/402 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 198 constraints, problems are : Problem set: 0 solved, 216 unsolved in 12046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/402 variables, 185/198 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 216/414 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/402 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 414 constraints, problems are : Problem set: 0 solved, 216 unsolved in 15823 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27897ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 27897ms
Starting structural reductions in LTL mode, iteration 1 : 185/208 places, 217/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28057 ms. Remains : 185/208 places, 217/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(p0)||p1) U G(p2)) U X(p3)))'
Stuttering acceptance computed with spot in 287 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p0) (NOT p3)), true, (NOT p0), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 13252 steps with 4059 reset in 21 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-07 finished in 28405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0)) U (p0 U p1))||F((G(F(p2))||(F(p2)&&X(p1))))))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 243/243 transitions.
Graph (complete) has 408 edges and 208 vertex of which 205 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 204 transition count 206
Reduce places removed 33 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 171 transition count 204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 169 transition count 204
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 71 place count 169 transition count 173
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 133 place count 138 transition count 173
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 139 place count 132 transition count 166
Iterating global reduction 3 with 6 rules applied. Total rules applied 145 place count 132 transition count 166
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 145 place count 132 transition count 165
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 131 transition count 165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 129 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 129 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 152 place count 128 transition count 161
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 128 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 127 transition count 160
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 127 transition count 160
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 253 place count 78 transition count 111
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 262 place count 69 transition count 94
Iterating global reduction 3 with 9 rules applied. Total rules applied 271 place count 69 transition count 94
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 279 place count 61 transition count 85
Iterating global reduction 3 with 8 rules applied. Total rules applied 287 place count 61 transition count 85
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 295 place count 53 transition count 69
Iterating global reduction 3 with 8 rules applied. Total rules applied 303 place count 53 transition count 69
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 311 place count 45 transition count 61
Iterating global reduction 3 with 8 rules applied. Total rules applied 319 place count 45 transition count 61
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 327 place count 37 transition count 45
Iterating global reduction 3 with 8 rules applied. Total rules applied 335 place count 37 transition count 45
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 343 place count 29 transition count 37
Iterating global reduction 3 with 8 rules applied. Total rules applied 351 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 352 place count 28 transition count 35
Iterating global reduction 3 with 1 rules applied. Total rules applied 353 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 354 place count 27 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 355 place count 27 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 356 place count 27 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 358 place count 25 transition count 31
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 27 edges and 23 vertex of which 20 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 365 place count 20 transition count 24
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 370 place count 16 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 371 place count 15 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 375 place count 13 transition count 21
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 376 place count 13 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 379 place count 10 transition count 17
Applied a total of 379 rules in 35 ms. Remains 10 /208 variables (removed 198) and now considering 17/243 (removed 226) transitions.
[2026-05-24 05:22:07] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10007186104415870035.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-763798383636544062.kers'
[2026-05-24 05:22:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10007186104415870035.kers, --Pflows, --basisKERS=/tmp/petrispot-output-763798383636544062.kers]
Normalized transition count is 13 out of 14 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 13 rows 10 cols 22 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-24 05:22:07] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-763798383636544062.kers
Total runtime 0 ms.
[2026-05-24 05:22:07] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-24 05:22:07] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2026-05-24 05:22:07] [INFO ] Invariant cache hit.
[2026-05-24 05:22:07] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2026-05-24 05:22:07] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-24 05:22:07] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2026-05-24 05:22:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/23 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/24 variables, and 10 constraints, problems are : Problem set: 0 solved, 10 unsolved in 89 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 4/23 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/24 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 79 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 178ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/208 places, 17/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 10/208 places, 17/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0)) U (p0 U p1))||F((G(F(p2))||(F(p2)&&X(p1))))))'
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-08
Stuttering criterion allowed to conclude after 20 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-08 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))&&F(p2)))'
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 243/243 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 195 transition count 229
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 195 transition count 229
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 189 transition count 223
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 189 transition count 223
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 186 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 186 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 184 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 184 transition count 217
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 182 transition count 214
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 182 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 181 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 181 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 180 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 180 transition count 212
Applied a total of 56 rules in 23 ms. Remains 180 /208 variables (removed 28) and now considering 212/243 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11648691437745836360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5343116479048342935.kers'
[2026-05-24 05:22:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11648691437745836360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5343116479048342935.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 180 cols 573 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 05:22:07] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5343116479048342935.kers
Total runtime 3 ms.
[2026-05-24 05:22:07] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 05:22:07] [INFO ] Invariant cache hit.
[2026-05-24 05:22:07] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2026-05-24 05:22:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 212/392 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 11/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 193 constraints, problems are : Problem set: 0 solved, 211 unsolved in 11842 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/392 variables, 180/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 211/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/392 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 404 constraints, problems are : Problem set: 0 solved, 211 unsolved in 16573 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28434ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 28435ms
Starting structural reductions in LTL mode, iteration 1 : 180/208 places, 212/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28619 ms. Remains : 180/208 places, 212/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))&&F(p2)))'
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-10
Product exploration explored 100000 steps with 1941 reset in 161 ms.
Stack based approach found an accepted trace after 790 steps with 23 reset with depth 62 and stack size 62 in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-10 finished in 28987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 243/243 transitions.
Graph (complete) has 408 edges and 208 vertex of which 206 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 205 transition count 205
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 170 transition count 205
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 71 place count 170 transition count 175
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 131 place count 140 transition count 175
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 135 place count 136 transition count 170
Iterating global reduction 2 with 4 rules applied. Total rules applied 139 place count 136 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 139 place count 136 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 135 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 134 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 134 transition count 168
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 251 place count 80 transition count 114
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 259 place count 72 transition count 98
Iterating global reduction 2 with 8 rules applied. Total rules applied 267 place count 72 transition count 98
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 275 place count 64 transition count 90
Iterating global reduction 2 with 8 rules applied. Total rules applied 283 place count 64 transition count 90
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 291 place count 56 transition count 74
Iterating global reduction 2 with 8 rules applied. Total rules applied 299 place count 56 transition count 74
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 307 place count 48 transition count 66
Iterating global reduction 2 with 8 rules applied. Total rules applied 315 place count 48 transition count 66
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 323 place count 40 transition count 50
Iterating global reduction 2 with 8 rules applied. Total rules applied 331 place count 40 transition count 50
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 339 place count 32 transition count 42
Iterating global reduction 2 with 8 rules applied. Total rules applied 347 place count 32 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 349 place count 32 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 351 place count 30 transition count 38
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 33 edges and 28 vertex of which 25 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 2 with 11 rules applied. Total rules applied 362 place count 25 transition count 27
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 370 place count 17 transition count 27
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 378 place count 13 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 380 place count 13 transition count 21
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 383 place count 10 transition count 18
Applied a total of 383 rules in 26 ms. Remains 10 /208 variables (removed 198) and now considering 18/243 (removed 225) transitions.
[2026-05-24 05:22:36] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2401051083752591395.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8788066224784554517.kers'
[2026-05-24 05:22:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2401051083752591395.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8788066224784554517.kers]
Normalized transition count is 12 out of 13 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 10 cols 19 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-24 05:22:36] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8788066224784554517.kers
Total runtime 1 ms.
[2026-05-24 05:22:36] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 05:22:36] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
[2026-05-24 05:22:36] [INFO ] Invariant cache hit.
[2026-05-24 05:22:36] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2026-05-24 05:22:36] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2026-05-24 05:22:36] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
[2026-05-24 05:22:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/22 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/23 variables, and 10 constraints, problems are : Problem set: 0 solved, 11 unsolved in 75 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 4/22 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 21 constraints, problems are : Problem set: 0 solved, 11 unsolved in 75 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 168ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/208 places, 18/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 263 ms. Remains : 10/208 places, 18/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-11 finished in 349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 243/243 transitions.
Graph (complete) has 408 edges and 208 vertex of which 205 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 204 transition count 205
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 170 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 169 transition count 204
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 71 place count 169 transition count 173
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 133 place count 138 transition count 173
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 139 place count 132 transition count 166
Iterating global reduction 3 with 6 rules applied. Total rules applied 145 place count 132 transition count 166
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 145 place count 132 transition count 165
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 131 transition count 165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 129 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 129 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 152 place count 128 transition count 161
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 128 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 127 transition count 160
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 127 transition count 160
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 257 place count 76 transition count 109
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 267 place count 66 transition count 90
Iterating global reduction 3 with 10 rules applied. Total rules applied 277 place count 66 transition count 90
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 287 place count 56 transition count 79
Iterating global reduction 3 with 10 rules applied. Total rules applied 297 place count 56 transition count 79
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 307 place count 46 transition count 59
Iterating global reduction 3 with 10 rules applied. Total rules applied 317 place count 46 transition count 59
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 327 place count 36 transition count 49
Iterating global reduction 3 with 10 rules applied. Total rules applied 337 place count 36 transition count 49
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 346 place count 27 transition count 31
Iterating global reduction 3 with 9 rules applied. Total rules applied 355 place count 27 transition count 31
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 364 place count 18 transition count 22
Iterating global reduction 3 with 9 rules applied. Total rules applied 373 place count 18 transition count 22
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 374 place count 17 transition count 20
Iterating global reduction 3 with 1 rules applied. Total rules applied 375 place count 17 transition count 20
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 376 place count 16 transition count 19
Iterating global reduction 3 with 1 rules applied. Total rules applied 377 place count 16 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 378 place count 16 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 380 place count 14 transition count 16
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 14 edges and 12 vertex of which 9 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 384 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 385 place count 8 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 385 place count 8 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 387 place count 7 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 389 place count 6 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 391 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 393 place count 4 transition count 7
Applied a total of 393 rules in 28 ms. Remains 4 /208 variables (removed 204) and now considering 7/243 (removed 236) transitions.
[2026-05-24 05:22:36] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15112895251593015442.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1736148912130328368.kers'
[2026-05-24 05:22:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15112895251593015442.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1736148912130328368.kers]
Normalized transition count is 5 out of 6 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-24 05:22:36] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1736148912130328368.kers
Total runtime 0 ms.
[2026-05-24 05:22:36] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-24 05:22:36] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2026-05-24 05:22:36] [INFO ] Invariant cache hit.
[2026-05-24 05:22:36] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2026-05-24 05:22:36] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-24 05:22:36] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2026-05-24 05:22:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 4 constraints, problems are : Problem set: 0 solved, 4 unsolved in 40 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 33 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 84ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/208 places, 7/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 4/208 places, 7/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-12 finished in 233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(G(p1))))))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 243/243 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 195 transition count 229
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 195 transition count 229
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 189 transition count 223
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 189 transition count 223
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 186 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 186 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 184 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 184 transition count 217
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 182 transition count 214
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 182 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 181 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 181 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 180 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 180 transition count 212
Applied a total of 56 rules in 23 ms. Remains 180 /208 variables (removed 28) and now considering 212/243 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7637371065492164568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5743109505911285572.kers'
[2026-05-24 05:22:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7637371065492164568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5743109505911285572.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 180 cols 573 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-24 05:22:37] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5743109505911285572.kers
Total runtime 1 ms.
[2026-05-24 05:22:37] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 05:22:37] [INFO ] Invariant cache hit.
[2026-05-24 05:22:37] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2026-05-24 05:22:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 212/392 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 11/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 193 constraints, problems are : Problem set: 0 solved, 211 unsolved in 11353 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/392 variables, 180/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 211/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/392 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 404 constraints, problems are : Problem set: 0 solved, 211 unsolved in 16375 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27750ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 27754ms
Starting structural reductions in LTL mode, iteration 1 : 180/208 places, 212/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27923 ms. Remains : 180/208 places, 212/243 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((p0||F(G(p1))))))'
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-13
Stuttering criterion allowed to conclude after 391 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-13 finished in 28119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(((!p1&&F((p2&&F(p3)&&G(!p4))))||G((F(p3)&&F(p2)&&F(G(!p4)))))))))'
Support contains 6 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 243/243 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 197 transition count 231
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 197 transition count 231
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 192 transition count 226
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 192 transition count 226
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 189 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 189 transition count 222
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 187 transition count 220
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 187 transition count 220
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 185 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 185 transition count 217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 184 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 184 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 183 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 183 transition count 215
Applied a total of 50 rules in 17 ms. Remains 183 /208 variables (removed 25) and now considering 215/243 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2671108548657899213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2283487923725636006.kers'
[2026-05-24 05:23:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2671108548657899213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2283487923725636006.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 215 rows 183 cols 579 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-24 05:23:05] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2283487923725636006.kers
Total runtime 1 ms.
[2026-05-24 05:23:05] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-24 05:23:05] [INFO ] Invariant cache hit.
[2026-05-24 05:23:05] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2026-05-24 05:23:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 215/398 variables, 183/185 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/398 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 197 constraints, problems are : Problem set: 0 solved, 214 unsolved in 12360 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/398 variables, 183/197 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 214/411 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 0/398 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 411 constraints, problems are : Problem set: 0 solved, 214 unsolved in 16849 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29230ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 29230ms
Starting structural reductions in LTL mode, iteration 1 : 183/208 places, 215/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29410 ms. Remains : 183/208 places, 215/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(((p1&&F((p2&&F(p3)&&G(p4))))||G((F(p3)&&F(p2)&&F(G(p4)))))))))'
Stuttering acceptance computed with spot in 495 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (NOT p3) (NOT p2) (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (NOT p3), (NOT p2), (NOT p4), (OR (NOT p3) (NOT p2) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4))), (AND (NOT p0) (NOT p4))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-14
Product exploration explored 100000 steps with 291 reset in 167 ms.
Stack based approach found an accepted trace after 568 steps with 1 reset with depth 178 and stack size 178 in 2 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-14 finished in 30150 ms.
All properties solved by simple procedures.
Total runtime 298228 ms.
BK_STOP 1779600215387
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-11b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-11b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695500324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11b.tgz
mv DiscoveryGPU-PT-11b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;