fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r098-tall-177955695500339
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DiscoveryGPU-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
547.231 222072.00 270521.00 1478.70 TFFFFFFFFFFFFFFF 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-177955695500339.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-12b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500339
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.1K Mar 6 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 6 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 6 16:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 16:15 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.8K Mar 15 09:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 09:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 6 16:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 6 16:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 6 16:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 16:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:14 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 89K 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-12b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779601652917

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 05:47:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 05:47:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:47:34] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2026-05-24 05:47:34] [INFO ] Transformed 352 places.
[2026-05-24 05:47:34] [INFO ] Transformed 374 transitions.
[2026-05-24 05:47:34] [INFO ] Found NUPN structural information;
[2026-05-24 05:47:34] [INFO ] Parsed PT model containing 352 places and 374 transitions and 977 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 374/374 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 329 transition count 374
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 75 place count 277 transition count 322
Iterating global reduction 1 with 52 rules applied. Total rules applied 127 place count 277 transition count 322
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 138 place count 266 transition count 311
Iterating global reduction 1 with 11 rules applied. Total rules applied 149 place count 266 transition count 311
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 158 place count 257 transition count 302
Iterating global reduction 1 with 9 rules applied. Total rules applied 167 place count 257 transition count 302
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 174 place count 250 transition count 295
Iterating global reduction 1 with 7 rules applied. Total rules applied 181 place count 250 transition count 295
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 185 place count 246 transition count 287
Iterating global reduction 1 with 4 rules applied. Total rules applied 189 place count 246 transition count 287
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 193 place count 242 transition count 283
Iterating global reduction 1 with 4 rules applied. Total rules applied 197 place count 242 transition count 283
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 201 place count 238 transition count 279
Iterating global reduction 1 with 4 rules applied. Total rules applied 205 place count 238 transition count 279
Applied a total of 205 rules in 108 ms. Remains 238 /352 variables (removed 114) and now considering 279/374 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12737271402617259012.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3870730795377203593.kers'
[2026-05-24 05:47:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12737271402617259012.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3870730795377203593.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 238 cols 745 entries
Finished phase 1 with 236 SingleSign rule and 0 generalized
[2026-05-24 05:47:34] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3870730795377203593.kers
Total runtime 2 ms.
[2026-05-24 05:47:34] [INFO ] Implicit Places using invariants in 380 ms returned []
[2026-05-24 05:47:34] [INFO ] Invariant cache hit.
[2026-05-24 05:47:35] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2026-05-24 05:47:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/516 variables, 237/239 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 1/517 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (OVERLAPS) 0/517 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 264 constraints, problems are : Problem set: 0 solved, 278 unsolved in 29240 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 279/516 variables, 237/263 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 277/540 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 1/517 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/517 variables, and 542 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59462ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 59492ms
Starting structural reductions in LTL mode, iteration 1 : 238/352 places, 279/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60421 ms. Remains : 238/352 places, 279/374 transitions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Applied a total of 0 rules in 9 ms. Remains 238 /238 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2026-05-24 05:48:34] [INFO ] Invariant cache hit.
[2026-05-24 05:48:34] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-24 05:48:34] [INFO ] Invariant cache hit.
[2026-05-24 05:48:35] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 279 ms. Remains : 238/238 places, 279/279 transitions.
Support contains 25 out of 238 places after structural reductions.
[2026-05-24 05:48:35] [INFO ] Flatten gal took : 42 ms
[2026-05-24 05:48:35] [INFO ] Flatten gal took : 18 ms
[2026-05-24 05:48:35] [INFO ] Input system was already deterministic with 279 transitions.
Support contains 23 out of 238 places (down from 25) after GAL structural reductions.
RANDOM walk for 11902 steps (28 resets) in 484 ms. (24 steps per ms) remains 0/15 properties
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 469 edges and 238 vertex of which 234 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 279
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 223 transition count 264
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 223 transition count 264
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 216 transition count 254
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 216 transition count 254
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 209 transition count 246
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 209 transition count 246
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 63 place count 203 transition count 240
Iterating global reduction 1 with 6 rules applied. Total rules applied 69 place count 203 transition count 240
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 200 transition count 235
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 200 transition count 235
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 198 transition count 233
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 198 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 196 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 196 transition count 231
Applied a total of 83 rules in 19 ms. Remains 196 /238 variables (removed 42) and now considering 231/279 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18005724231899372697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7350054429164396175.kers'
[2026-05-24 05:48:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18005724231899372697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7350054429164396175.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 231 rows 196 cols 624 entries
Finished phase 1 with 194 SingleSign rule and 0 generalized
[2026-05-24 05:48:35] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7350054429164396175.kers
Total runtime 3 ms.
[2026-05-24 05:48:35] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-24 05:48:35] [INFO ] Invariant cache hit.
[2026-05-24 05:48:36] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2026-05-24 05:48:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 231/427 variables, 196/198 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 0/427 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 222 constraints, problems are : Problem set: 0 solved, 230 unsolved in 14924 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 231/427 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 230/452 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 0/427 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 452 constraints, problems are : Problem set: 0 solved, 230 unsolved in 22425 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37388ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 37390ms
Starting structural reductions in LTL mode, iteration 1 : 196/238 places, 231/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37607 ms. Remains : 196/238 places, 231/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-01
Product exploration explored 100000 steps with 20861 reset in 236 ms.
Stack based approach found an accepted trace after 28867 steps with 6056 reset with depth 14 and stack size 14 in 42 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-01 finished in 38244 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)))'
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 279
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 224 transition count 265
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 224 transition count 265
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 216 transition count 254
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 216 transition count 254
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 209 transition count 246
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 209 transition count 246
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 63 place count 203 transition count 240
Iterating global reduction 1 with 6 rules applied. Total rules applied 69 place count 203 transition count 240
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 200 transition count 235
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 200 transition count 235
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 198 transition count 233
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 198 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 196 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 196 transition count 231
Applied a total of 83 rules in 30 ms. Remains 196 /238 variables (removed 42) and now considering 231/279 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11993608771466682635.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12440941607741080044.kers'
[2026-05-24 05:49:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11993608771466682635.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12440941607741080044.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 231 rows 196 cols 624 entries
Finished phase 1 with 194 SingleSign rule and 0 generalized
[2026-05-24 05:49:14] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12440941607741080044.kers
Total runtime 1 ms.
[2026-05-24 05:49:14] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-24 05:49:14] [INFO ] Invariant cache hit.
[2026-05-24 05:49:14] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 196/238 places, 231/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 196/238 places, 231/279 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)))'
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-03
Stuttering criterion allowed to conclude after 538 steps with 2 reset in 4 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-03 finished in 334 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 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Graph (complete) has 469 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 234 transition count 236
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 194 transition count 236
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 81 place count 194 transition count 202
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 149 place count 160 transition count 202
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 155 place count 154 transition count 194
Iterating global reduction 2 with 6 rules applied. Total rules applied 161 place count 154 transition count 194
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 161 place count 154 transition count 193
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 163 place count 153 transition count 193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 167 place count 149 transition count 188
Iterating global reduction 2 with 4 rules applied. Total rules applied 171 place count 149 transition count 188
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 173 place count 147 transition count 185
Iterating global reduction 2 with 2 rules applied. Total rules applied 175 place count 147 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 146 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 146 transition count 184
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 297 place count 86 transition count 124
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 307 place count 76 transition count 105
Iterating global reduction 2 with 10 rules applied. Total rules applied 317 place count 76 transition count 105
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 327 place count 66 transition count 93
Iterating global reduction 2 with 10 rules applied. Total rules applied 337 place count 66 transition count 93
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 347 place count 56 transition count 74
Iterating global reduction 2 with 10 rules applied. Total rules applied 357 place count 56 transition count 74
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 367 place count 46 transition count 63
Iterating global reduction 2 with 10 rules applied. Total rules applied 377 place count 46 transition count 63
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 387 place count 36 transition count 44
Iterating global reduction 2 with 10 rules applied. Total rules applied 397 place count 36 transition count 44
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 407 place count 26 transition count 33
Iterating global reduction 2 with 10 rules applied. Total rules applied 417 place count 26 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 419 place count 24 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 421 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 422 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 423 place count 23 transition count 29
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 425 place count 23 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 427 place count 21 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 19 vertex of which 16 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 436 place count 16 transition count 16
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 442 place count 10 transition count 16
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 4 with 4 rules applied. Total rules applied 446 place count 8 transition count 14
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 447 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 449 place count 6 transition count 11
Applied a total of 449 rules in 76 ms. Remains 6 /238 variables (removed 232) and now considering 11/279 (removed 268) transitions.
[2026-05-24 05:49:14] [INFO ] Flow matrix only has 8 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-11422393469864025316.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12871603269542663170.kers'
[2026-05-24 05:49:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11422393469864025316.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12871603269542663170.kers]
Normalized transition count is 7 out of 8 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 6 cols 11 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 05:49:14] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12871603269542663170.kers
Total runtime 0 ms.
[2026-05-24 05:49:14] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-24 05:49:14] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 05:49:14] [INFO ] Invariant cache hit.
[2026-05-24 05:49:14] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2026-05-24 05:49:14] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-24 05:49:14] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 05:49:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 74 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/13 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/238 places, 11/279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 6/238 places, 11/279 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 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-04
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-04 finished in 377 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)||(p0&&F(!p1)))))'
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Graph (complete) has 469 edges and 238 vertex of which 234 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 233 transition count 237
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 195 transition count 237
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 77 place count 195 transition count 203
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 145 place count 161 transition count 203
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 151 place count 155 transition count 195
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 155 transition count 195
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 157 place count 155 transition count 194
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 159 place count 154 transition count 194
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 163 place count 150 transition count 189
Iterating global reduction 2 with 4 rules applied. Total rules applied 167 place count 150 transition count 189
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 169 place count 148 transition count 186
Iterating global reduction 2 with 2 rules applied. Total rules applied 171 place count 148 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 147 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 147 transition count 185
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 289 place count 89 transition count 127
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 299 place count 79 transition count 108
Iterating global reduction 2 with 10 rules applied. Total rules applied 309 place count 79 transition count 108
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 319 place count 69 transition count 96
Iterating global reduction 2 with 10 rules applied. Total rules applied 329 place count 69 transition count 96
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 338 place count 60 transition count 79
Iterating global reduction 2 with 9 rules applied. Total rules applied 347 place count 60 transition count 79
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 356 place count 51 transition count 69
Iterating global reduction 2 with 9 rules applied. Total rules applied 365 place count 51 transition count 69
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 373 place count 43 transition count 54
Iterating global reduction 2 with 8 rules applied. Total rules applied 381 place count 43 transition count 54
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 389 place count 35 transition count 45
Iterating global reduction 2 with 8 rules applied. Total rules applied 397 place count 35 transition count 45
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 399 place count 33 transition count 42
Iterating global reduction 2 with 2 rules applied. Total rules applied 401 place count 33 transition count 42
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 402 place count 32 transition count 41
Iterating global reduction 2 with 1 rules applied. Total rules applied 403 place count 32 transition count 41
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 404 place count 32 transition count 40
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 406 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 408 place count 30 transition count 38
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 34 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 414 place count 25 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 417 place count 22 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 417 place count 22 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 419 place count 21 transition count 31
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 427 place count 17 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 431 place count 15 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 435 place count 15 transition count 24
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 438 place count 12 transition count 21
Applied a total of 438 rules in 58 ms. Remains 12 /238 variables (removed 226) and now considering 21/279 (removed 258) transitions.
[2026-05-24 05:49:14] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5284750267063434023.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12363115963587626707.kers'
[2026-05-24 05:49:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5284750267063434023.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12363115963587626707.kers]
Normalized transition count is 16 out of 17 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 16 rows 12 cols 28 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-24 05:49:14] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12363115963587626707.kers
Total runtime 0 ms.
[2026-05-24 05:49:14] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-24 05:49:14] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
[2026-05-24 05:49:14] [INFO ] Invariant cache hit.
[2026-05-24 05:49:14] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2026-05-24 05:49:14] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2026-05-24 05:49:14] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
[2026-05-24 05:49:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 5/28 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/29 variables, and 12 constraints, problems are : Problem set: 0 solved, 12 unsolved in 93 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 5/28 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/29 variables, and 24 constraints, problems are : Problem set: 0 solved, 12 unsolved in 99 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 195ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 196ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/238 places, 21/279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 297 ms. Remains : 12/238 places, 21/279 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)||(p0&&F(p1)))))'
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-05
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-05 finished in 420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((X(!p0) U ((p1&&X(!p0))||X(G(!p0))))&&F((G(F(!p2))||(p3&&F(!p2)))))))))'
Support contains 6 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 228 transition count 269
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 228 transition count 269
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 223 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 223 transition count 262
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 219 transition count 257
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 219 transition count 257
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 215 transition count 253
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 215 transition count 253
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 213 transition count 250
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 213 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 212 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 212 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 211 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 211 transition count 248
Applied a total of 54 rules in 49 ms. Remains 211 /238 variables (removed 27) and now considering 248/279 (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-14230383794893312340.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12486757454325532721.kers'
[2026-05-24 05:49:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14230383794893312340.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12486757454325532721.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 211 cols 668 entries
Finished phase 1 with 209 SingleSign rule and 0 generalized
[2026-05-24 05:49:15] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12486757454325532721.kers
Total runtime 1 ms.
[2026-05-24 05:49:15] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-24 05:49:15] [INFO ] Invariant cache hit.
[2026-05-24 05:49:15] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2026-05-24 05:49:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/458 variables, 210/212 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 1/459 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 0/459 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 225 constraints, problems are : Problem set: 0 solved, 247 unsolved in 18742 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/458 variables, 210/224 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 246/470 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 10 (OVERLAPS) 0/459 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 472 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48815ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 48816ms
Starting structural reductions in LTL mode, iteration 1 : 211/238 places, 248/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49052 ms. Remains : 211/238 places, 248/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((X(!p0) U ((p1&&X(!p0))||X(G(!p0))))&&F((G(F(p2))||(p3&&F(p2)))))))))'
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p0, false, (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-08
Stuttering criterion allowed to conclude after 417 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-08 finished in 49388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (!p1&&X(G(!p0))))))'
Support contains 5 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Graph (complete) has 469 edges and 238 vertex of which 234 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 233 transition count 237
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 195 transition count 237
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 77 place count 195 transition count 205
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 141 place count 163 transition count 205
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 148 place count 156 transition count 196
Iterating global reduction 2 with 7 rules applied. Total rules applied 155 place count 156 transition count 196
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 155 place count 156 transition count 195
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 157 place count 155 transition count 195
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 162 place count 150 transition count 189
Iterating global reduction 2 with 5 rules applied. Total rules applied 167 place count 150 transition count 189
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 170 place count 147 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 173 place count 147 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 175 place count 145 transition count 182
Iterating global reduction 2 with 2 rules applied. Total rules applied 177 place count 145 transition count 182
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 289 place count 89 transition count 126
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 298 place count 80 transition count 109
Iterating global reduction 2 with 9 rules applied. Total rules applied 307 place count 80 transition count 109
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 315 place count 72 transition count 99
Iterating global reduction 2 with 8 rules applied. Total rules applied 323 place count 72 transition count 99
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 331 place count 64 transition count 84
Iterating global reduction 2 with 8 rules applied. Total rules applied 339 place count 64 transition count 84
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 347 place count 56 transition count 75
Iterating global reduction 2 with 8 rules applied. Total rules applied 355 place count 56 transition count 75
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 361 place count 50 transition count 64
Iterating global reduction 2 with 6 rules applied. Total rules applied 367 place count 50 transition count 64
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 373 place count 44 transition count 57
Iterating global reduction 2 with 6 rules applied. Total rules applied 379 place count 44 transition count 57
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 381 place count 42 transition count 54
Iterating global reduction 2 with 2 rules applied. Total rules applied 383 place count 42 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 384 place count 41 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 385 place count 41 transition count 53
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 386 place count 41 transition count 52
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 388 place count 41 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 39 transition count 50
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 45 edges and 37 vertex of which 34 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 399 place count 34 transition count 41
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 405 place count 28 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 405 place count 28 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 407 place count 27 transition count 40
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 413 place count 24 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 417 place count 22 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 418 place count 22 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 421 place count 22 transition count 34
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 427 place count 16 transition count 28
Applied a total of 427 rules in 53 ms. Remains 16 /238 variables (removed 222) and now considering 28/279 (removed 251) transitions.
[2026-05-24 05:50:04] [INFO ] Flow matrix only has 23 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-2700613905011544848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17573181268665305645.kers'
[2026-05-24 05:50:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2700613905011544848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17573181268665305645.kers]
Normalized transition count is 22 out of 23 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 22 rows 16 cols 38 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-05-24 05:50:04] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17573181268665305645.kers
Total runtime 0 ms.
[2026-05-24 05:50:04] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-24 05:50:04] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
[2026-05-24 05:50:04] [INFO ] Invariant cache hit.
[2026-05-24 05:50:04] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2026-05-24 05:50:04] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2026-05-24 05:50:04] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
[2026-05-24 05:50:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 19/29 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/38 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/39 variables, and 16 constraints, problems are : Problem set: 0 solved, 14 unsolved in 128 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 19/29 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 9/38 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/39 variables, and 30 constraints, problems are : Problem set: 0 solved, 14 unsolved in 186 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 324ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/238 places, 28/279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 421 ms. Remains : 16/238 places, 28/279 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (!p1&&X(G(!p0))))))'
Stuttering acceptance computed with spot in 73 ms :[(OR p0 p1), true, (OR p0 p1)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-10 finished in 526 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)) U ((p1&&X(X(!p0)))||X(X(G(!p0))))))'
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 279
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 225 transition count 266
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 225 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 219 transition count 258
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 219 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 213 transition count 251
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 213 transition count 251
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 208 transition count 246
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 208 transition count 246
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 205 transition count 241
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 205 transition count 241
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 203 transition count 239
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 203 transition count 239
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 201 transition count 237
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 201 transition count 237
Applied a total of 73 rules in 15 ms. Remains 201 /238 variables (removed 37) and now considering 237/279 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14693086904833786554.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17073085693907446833.kers'
[2026-05-24 05:50:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14693086904833786554.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17073085693907446833.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 237 rows 201 cols 640 entries
Finished phase 1 with 199 SingleSign rule and 0 generalized
[2026-05-24 05:50:05] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17073085693907446833.kers
Total runtime 1 ms.
[2026-05-24 05:50:05] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-24 05:50:05] [INFO ] Invariant cache hit.
[2026-05-24 05:50:05] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2026-05-24 05:50:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 237/438 variables, 201/203 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/438 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 227 constraints, problems are : Problem set: 0 solved, 236 unsolved in 15996 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 237/438 variables, 201/227 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 236/463 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/438 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 463 constraints, problems are : Problem set: 0 solved, 236 unsolved in 20895 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36955ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 36957ms
Starting structural reductions in LTL mode, iteration 1 : 201/238 places, 237/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37198 ms. Remains : 201/238 places, 237/279 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)) U (X(X(G(!p0)))||(X(X(!p0))&&p1))))'
Stuttering acceptance computed with spot in 121 ms :[p0, p0, p0, true]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-14 finished in 37360 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 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 279
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 224 transition count 265
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 224 transition count 265
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 217 transition count 256
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 217 transition count 256
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 211 transition count 249
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 211 transition count 249
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 206 transition count 244
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 206 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 203 transition count 239
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 203 transition count 239
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 201 transition count 237
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 201 transition count 237
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 199 transition count 235
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 199 transition count 235
Applied a total of 77 rules in 17 ms. Remains 199 /238 variables (removed 39) and now considering 235/279 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1991358674754146210.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16859954302799513759.kers'
[2026-05-24 05:50:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1991358674754146210.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16859954302799513759.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 235 rows 199 cols 634 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-24 05:50:42] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16859954302799513759.kers
Total runtime 1 ms.
[2026-05-24 05:50:42] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-24 05:50:42] [INFO ] Invariant cache hit.
[2026-05-24 05:50:42] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2026-05-24 05:50:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 235/434 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 12/213 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 213 constraints, problems are : Problem set: 0 solved, 234 unsolved in 14218 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 235/434 variables, 199/213 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 234/447 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 447 constraints, problems are : Problem set: 0 solved, 234 unsolved in 17861 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32104ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 32104ms
Starting structural reductions in LTL mode, iteration 1 : 199/238 places, 235/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32353 ms. Remains : 199/238 places, 235/279 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 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-15 finished in 32542 ms.
All properties solved by simple procedures.
Total runtime 220881 ms.

BK_STOP 1779601874989

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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