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-177955695500371.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-14b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.8K Mar 6 16:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 6 16:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 6 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 6 16:12 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:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 09:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 6 16:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 6 16:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 16:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Mar 6 16:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:15 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 104K 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-14b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779603858959

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-14b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 06:24:20] [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 06:24:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 06:24:20] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2026-05-24 06:24:20] [INFO ] Transformed 408 places.
[2026-05-24 06:24:20] [INFO ] Transformed 434 transitions.
[2026-05-24 06:24:20] [INFO ] Found NUPN structural information;
[2026-05-24 06:24:20] [INFO ] Parsed PT model containing 408 places and 434 transitions and 1135 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 434/434 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 381 transition count 434
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 92 place count 316 transition count 369
Iterating global reduction 1 with 65 rules applied. Total rules applied 157 place count 316 transition count 369
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 170 place count 303 transition count 356
Iterating global reduction 1 with 13 rules applied. Total rules applied 183 place count 303 transition count 356
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 192 place count 294 transition count 347
Iterating global reduction 1 with 9 rules applied. Total rules applied 201 place count 294 transition count 347
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 210 place count 285 transition count 338
Iterating global reduction 1 with 9 rules applied. Total rules applied 219 place count 285 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 225 place count 279 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 231 place count 279 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 236 place count 274 transition count 321
Iterating global reduction 1 with 5 rules applied. Total rules applied 241 place count 274 transition count 321
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 246 place count 269 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 251 place count 269 transition count 316
Applied a total of 251 rules in 125 ms. Remains 269 /408 variables (removed 139) and now considering 316/434 (removed 118) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-830283757989189235.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15778156110185676078.kers'
[2026-05-24 06:24:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-830283757989189235.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15778156110185676078.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 316 rows 269 cols 848 entries
Finished phase 1 with 267 SingleSign rule and 0 generalized
[2026-05-24 06:24:20] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15778156110185676078.kers
Total runtime 2 ms.
[2026-05-24 06:24:20] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-05-24 06:24:20] [INFO ] Invariant cache hit.
[2026-05-24 06:24:21] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2026-05-24 06:24:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (OVERLAPS) 316/584 variables, 268/270 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 14/284 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (OVERLAPS) 1/585 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/585 variables, and 285 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/584 variables, 268/284 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 314/598 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 1/585 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/585 variables, and 600 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in LTL mode, iteration 1 : 269/408 places, 316/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60885 ms. Remains : 269/408 places, 316/434 transitions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 316/316 transitions.
Applied a total of 0 rules in 6 ms. Remains 269 /269 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2026-05-24 06:25:21] [INFO ] Invariant cache hit.
[2026-05-24 06:25:21] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-24 06:25:21] [INFO ] Invariant cache hit.
[2026-05-24 06:25:21] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 269/269 places, 316/316 transitions.
Support contains 32 out of 269 places after structural reductions.
[2026-05-24 06:25:21] [INFO ] Flatten gal took : 45 ms
[2026-05-24 06:25:21] [INFO ] Flatten gal took : 18 ms
[2026-05-24 06:25:21] [INFO ] Input system was already deterministic with 316 transitions.
RANDOM walk for 40000 steps (88 resets) in 1461 ms. (27 steps per ms) remains 1/18 properties
BEST_FIRST walk for 37887 steps (11 resets) in 130 ms. (289 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 46 stabilizing places and 46 stable transitions
Graph (complete) has 535 edges and 269 vertex of which 264 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.15 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(p1)&&p0))))'
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 316/316 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 268 transition count 316
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 258 transition count 306
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 258 transition count 306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 29 place count 250 transition count 295
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 250 transition count 295
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 243 transition count 287
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 243 transition count 287
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 236 transition count 280
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 236 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 232 transition count 273
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 232 transition count 273
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 229 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 229 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 226 transition count 267
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 226 transition count 267
Applied a total of 85 rules in 29 ms. Remains 226 /269 variables (removed 43) and now considering 267/316 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16325149772759334727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17750520719072800388.kers'
[2026-05-24 06:25:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16325149772759334727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17750520719072800388.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 226 cols 722 entries
Finished phase 1 with 224 SingleSign rule and 0 generalized
[2026-05-24 06:25:22] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17750520719072800388.kers
Total runtime 2 ms.
[2026-05-24 06:25:22] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-24 06:25:22] [INFO ] Invariant cache hit.
[2026-05-24 06:25:22] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2026-05-24 06:25:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 267/493 variables, 226/228 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 14/242 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 0/493 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 242 constraints, problems are : Problem set: 0 solved, 266 unsolved in 18162 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 267/493 variables, 226/242 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 266/508 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 0/493 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 508 constraints, problems are : Problem set: 0 solved, 266 unsolved in 27945 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46174ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 46177ms
Starting structural reductions in LTL mode, iteration 1 : 226/269 places, 267/316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46423 ms. Remains : 226/269 places, 267/316 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(p1)&&p0))))'
Stuttering acceptance computed with spot in 316 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 791 steps with 1 reset in 12 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-00 finished in 46832 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 p1))'
Support contains 3 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 316/316 transitions.
Graph (complete) has 535 edges and 269 vertex of which 264 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 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 263 transition count 271
Reduce places removed 40 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 223 transition count 269
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 221 transition count 269
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 85 place count 221 transition count 224
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 175 place count 176 transition count 224
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 182 place count 169 transition count 215
Iterating global reduction 3 with 7 rules applied. Total rules applied 189 place count 169 transition count 215
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 194 place count 164 transition count 210
Iterating global reduction 3 with 5 rules applied. Total rules applied 199 place count 164 transition count 210
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 202 place count 161 transition count 204
Iterating global reduction 3 with 3 rules applied. Total rules applied 205 place count 161 transition count 204
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 208 place count 158 transition count 201
Iterating global reduction 3 with 3 rules applied. Total rules applied 211 place count 158 transition count 201
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 333 place count 97 transition count 140
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 345 place count 85 transition count 117
Iterating global reduction 3 with 12 rules applied. Total rules applied 357 place count 85 transition count 117
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 369 place count 73 transition count 103
Iterating global reduction 3 with 12 rules applied. Total rules applied 381 place count 73 transition count 103
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 393 place count 61 transition count 80
Iterating global reduction 3 with 12 rules applied. Total rules applied 405 place count 61 transition count 80
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 417 place count 49 transition count 67
Iterating global reduction 3 with 12 rules applied. Total rules applied 429 place count 49 transition count 67
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 440 place count 38 transition count 46
Iterating global reduction 3 with 11 rules applied. Total rules applied 451 place count 38 transition count 46
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 462 place count 27 transition count 34
Iterating global reduction 3 with 11 rules applied. Total rules applied 473 place count 27 transition count 34
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 475 place count 25 transition count 31
Iterating global reduction 3 with 2 rules applied. Total rules applied 477 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 478 place count 24 transition count 30
Iterating global reduction 3 with 1 rules applied. Total rules applied 479 place count 24 transition count 30
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 480 place count 24 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 482 place count 22 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 24 edges and 20 vertex of which 17 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 3 with 5 rules applied. Total rules applied 487 place count 17 transition count 22
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 490 place count 15 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 491 place count 14 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 491 place count 14 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 493 place count 13 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 495 place count 12 transition count 19
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 6 with 2 rules applied. Total rules applied 497 place count 11 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 499 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 502 place count 8 transition count 14
Applied a total of 502 rules in 101 ms. Remains 8 /269 variables (removed 261) and now considering 14/316 (removed 302) transitions.
[2026-05-24 06:26:09] [INFO ] Flow matrix only has 13 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-15907984188199196259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14612756567681131097.kers'
[2026-05-24 06:26:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15907984188199196259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14612756567681131097.kers]
Normalized transition count is 12 out of 13 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 8 cols 21 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 06:26:09] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14612756567681131097.kers
Total runtime 4 ms.
[2026-05-24 06:26:09] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-24 06:26:09] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2026-05-24 06:26:09] [INFO ] Invariant cache hit.
[2026-05-24 06:26:09] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-24 06:26:09] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-24 06:26:09] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2026-05-24 06:26:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/21 variables, and 8 constraints, problems are : Problem set: 0 solved, 10 unsolved in 74 ms.
Refiners :[State Equation: 8/8 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/20 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 18 constraints, problems are : Problem set: 0 solved, 10 unsolved in 75 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 152ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 152ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/269 places, 14/316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 8/269 places, 14/316 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 p1))'
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-01 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)))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 316/316 transitions.
Graph (complete) has 535 edges and 269 vertex of which 264 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 263 transition count 269
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 221 transition count 269
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 85 place count 221 transition count 224
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 175 place count 176 transition count 224
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 182 place count 169 transition count 215
Iterating global reduction 2 with 7 rules applied. Total rules applied 189 place count 169 transition count 215
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 194 place count 164 transition count 210
Iterating global reduction 2 with 5 rules applied. Total rules applied 199 place count 164 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 202 place count 161 transition count 204
Iterating global reduction 2 with 3 rules applied. Total rules applied 205 place count 161 transition count 204
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 208 place count 158 transition count 201
Iterating global reduction 2 with 3 rules applied. Total rules applied 211 place count 158 transition count 201
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 335 place count 96 transition count 139
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 347 place count 84 transition count 116
Iterating global reduction 2 with 12 rules applied. Total rules applied 359 place count 84 transition count 116
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 371 place count 72 transition count 102
Iterating global reduction 2 with 12 rules applied. Total rules applied 383 place count 72 transition count 102
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 395 place count 60 transition count 79
Iterating global reduction 2 with 12 rules applied. Total rules applied 407 place count 60 transition count 79
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 419 place count 48 transition count 66
Iterating global reduction 2 with 12 rules applied. Total rules applied 431 place count 48 transition count 66
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 443 place count 36 transition count 43
Iterating global reduction 2 with 12 rules applied. Total rules applied 455 place count 36 transition count 43
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 466 place count 25 transition count 31
Iterating global reduction 2 with 11 rules applied. Total rules applied 477 place count 25 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 479 place count 23 transition count 28
Iterating global reduction 2 with 2 rules applied. Total rules applied 481 place count 23 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 482 place count 22 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 483 place count 22 transition count 27
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 484 place count 22 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 486 place count 20 transition count 24
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 18 vertex of which 15 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 2 with 7 rules applied. Total rules applied 493 place count 15 transition count 17
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 497 place count 11 transition count 17
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 501 place count 9 transition count 15
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 502 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 7 transition count 12
Applied a total of 504 rules in 54 ms. Remains 7 /269 variables (removed 262) and now considering 12/316 (removed 304) transitions.
[2026-05-24 06:26:09] [INFO ] Flow matrix only has 10 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-11871418208262609674.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12497605186389970379.kers'
[2026-05-24 06:26:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11871418208262609674.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12497605186389970379.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 7 cols 15 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 06:26:09] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12497605186389970379.kers
Total runtime 0 ms.
[2026-05-24 06:26:09] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-24 06:26:09] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2026-05-24 06:26:09] [INFO ] Invariant cache hit.
[2026-05-24 06:26:09] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2026-05-24 06:26:09] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-24 06:26:09] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2026-05-24 06:26:09] [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) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[State Equation: 7/7 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) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 66 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 129ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/269 places, 12/316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 7/269 places, 12/316 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 34 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-07 finished in 279 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(X(p0))&&(G(p2)||p1)))))'
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 316/316 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 268 transition count 316
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 258 transition count 306
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 258 transition count 306
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 251 transition count 296
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 251 transition count 296
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 244 transition count 288
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 244 transition count 288
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 237 transition count 281
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 237 transition count 281
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 233 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 233 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 230 transition count 271
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 230 transition count 271
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 227 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 227 transition count 268
Applied a total of 83 rules in 33 ms. Remains 227 /269 variables (removed 42) and now considering 268/316 (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-8489805752870518265.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4148011674442861537.kers'
[2026-05-24 06:26:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8489805752870518265.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4148011674442861537.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 227 cols 726 entries
Finished phase 1 with 225 SingleSign rule and 0 generalized
[2026-05-24 06:26:10] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4148011674442861537.kers
Total runtime 2 ms.
[2026-05-24 06:26:10] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-24 06:26:10] [INFO ] Invariant cache hit.
[2026-05-24 06:26:10] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2026-05-24 06:26:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 268/495 variables, 227/229 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 14/243 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 0/495 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 243 constraints, problems are : Problem set: 0 solved, 267 unsolved in 18066 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/495 variables, 227/243 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 267/510 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/495 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Int declared 495/495 variables, and 510 constraints, problems are : Problem set: 0 solved, 267 unsolved in 22168 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40290ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 40292ms
Starting structural reductions in LTL mode, iteration 1 : 227/269 places, 268/316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40545 ms. Remains : 227/269 places, 268/316 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(p0))&&(G(p2)||p1)))))'
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-08 finished in 40847 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 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 316/316 transitions.
Graph (complete) has 535 edges and 269 vertex of which 264 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 263 transition count 270
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 222 transition count 270
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 83 place count 222 transition count 224
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 175 place count 176 transition count 224
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 182 place count 169 transition count 215
Iterating global reduction 2 with 7 rules applied. Total rules applied 189 place count 169 transition count 215
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 194 place count 164 transition count 210
Iterating global reduction 2 with 5 rules applied. Total rules applied 199 place count 164 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 202 place count 161 transition count 204
Iterating global reduction 2 with 3 rules applied. Total rules applied 205 place count 161 transition count 204
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 208 place count 158 transition count 201
Iterating global reduction 2 with 3 rules applied. Total rules applied 211 place count 158 transition count 201
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 335 place count 96 transition count 139
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 347 place count 84 transition count 116
Iterating global reduction 2 with 12 rules applied. Total rules applied 359 place count 84 transition count 116
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 371 place count 72 transition count 102
Iterating global reduction 2 with 12 rules applied. Total rules applied 383 place count 72 transition count 102
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 395 place count 60 transition count 79
Iterating global reduction 2 with 12 rules applied. Total rules applied 407 place count 60 transition count 79
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 419 place count 48 transition count 66
Iterating global reduction 2 with 12 rules applied. Total rules applied 431 place count 48 transition count 66
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 443 place count 36 transition count 43
Iterating global reduction 2 with 12 rules applied. Total rules applied 455 place count 36 transition count 43
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 467 place count 24 transition count 30
Iterating global reduction 2 with 12 rules applied. Total rules applied 479 place count 24 transition count 30
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 481 place count 22 transition count 27
Iterating global reduction 2 with 2 rules applied. Total rules applied 483 place count 22 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 484 place count 21 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 485 place count 21 transition count 26
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 486 place count 21 transition count 25
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 487 place count 21 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 489 place count 19 transition count 23
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 20 edges and 17 vertex of which 14 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 2 with 7 rules applied. Total rules applied 496 place count 14 transition count 16
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 500 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 504 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 505 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 507 place count 6 transition count 11
Applied a total of 507 rules in 41 ms. Remains 6 /269 variables (removed 263) and now considering 11/316 (removed 305) transitions.
[2026-05-24 06:26:50] [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-13057390295709476313.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17909729537009953735.kers'
[2026-05-24 06:26:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13057390295709476313.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17909729537009953735.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 06:26:50] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17909729537009953735.kers
Total runtime 0 ms.
[2026-05-24 06:26:50] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 06:26:50] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 06:26:50] [INFO ] Invariant cache hit.
[2026-05-24 06:26:50] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-24 06:26:50] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-24 06:26:50] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 06:26:50] [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 48 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 50 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 99ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/269 places, 11/316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 6/269 places, 11/316 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 43 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-09
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-09 finished in 263 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(F(p0)))))'
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 316/316 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 268 transition count 316
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 257 transition count 305
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 257 transition count 305
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 249 transition count 294
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 249 transition count 294
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 242 transition count 286
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 242 transition count 286
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 235 transition count 279
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 235 transition count 279
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 231 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 231 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 228 transition count 269
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 228 transition count 269
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 225 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 225 transition count 266
Applied a total of 87 rules in 33 ms. Remains 225 /269 variables (removed 44) and now considering 266/316 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9805489427612168134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3579260515861120662.kers'
[2026-05-24 06:26:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9805489427612168134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3579260515861120662.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 225 cols 720 entries
Finished phase 1 with 223 SingleSign rule and 0 generalized
[2026-05-24 06:26:51] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3579260515861120662.kers
Total runtime 3 ms.
[2026-05-24 06:26:51] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-24 06:26:51] [INFO ] Invariant cache hit.
[2026-05-24 06:26:51] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2026-05-24 06:26:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/491 variables, 225/227 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 14/241 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 0/491 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 241 constraints, problems are : Problem set: 0 solved, 265 unsolved in 18591 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 266/491 variables, 225/241 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 265/506 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 0/491 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 506 constraints, problems are : Problem set: 0 solved, 265 unsolved in 21827 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40459ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 40460ms
Starting structural reductions in LTL mode, iteration 1 : 225/269 places, 266/316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40722 ms. Remains : 225/269 places, 266/316 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(F(p0)))))'
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-11
Product exploration explored 100000 steps with 25000 reset in 170 ms.
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 458 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge based reduction with 1 factoid took 49 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 966 steps (0 resets) in 7 ms. (120 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 53 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 260 ms.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 266/266 transitions.
Applied a total of 0 rules in 7 ms. Remains 225 /225 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2026-05-24 06:27:32] [INFO ] Invariant cache hit.
[2026-05-24 06:27:32] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-24 06:27:32] [INFO ] Invariant cache hit.
[2026-05-24 06:27:33] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 225/225 places, 266/266 transitions.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 458 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge based reduction with 1 factoid took 52 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 1410 steps (0 resets) in 19 ms. (70 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 303 ms.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 89 ms.
Product exploration explored 100000 steps with 25000 reset in 94 ms.
Spot run failed in 78 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8874174922225443615
[2026-05-24 06:27:34] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8874174922225443615
Running compilation step : cd /tmp/ltsmin8874174922225443615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 569 ms.
Running link step : cd /tmp/ltsmin8874174922225443615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin8874174922225443615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10736159397192648953.hoa' '--buchi-type=spotba'
LTSmin run took 59 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-11 finished in 43591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((X(X(F(!p1)))&&F(p2))||G(F(!p1)))))'
Support contains 8 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 316/316 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 262 transition count 309
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 262 transition count 309
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 258 transition count 305
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 258 transition count 305
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 255 transition count 301
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 255 transition count 301
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 252 transition count 298
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 252 transition count 298
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 249 transition count 293
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 249 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 248 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 248 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 247 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 247 transition count 291
Applied a total of 44 rules in 41 ms. Remains 247 /269 variables (removed 22) and now considering 291/316 (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-1776506489313029083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4872126585620734594.kers'
[2026-05-24 06:27:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1776506489313029083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4872126585620734594.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 291 rows 247 cols 784 entries
Finished phase 1 with 245 SingleSign rule and 0 generalized
[2026-05-24 06:27:34] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4872126585620734594.kers
Total runtime 2 ms.
[2026-05-24 06:27:34] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-24 06:27:34] [INFO ] Invariant cache hit.
[2026-05-24 06:27:35] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2026-05-24 06:27:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 291/537 variables, 246/248 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 14/262 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 1/538 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 0/538 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 263 constraints, problems are : Problem set: 0 solved, 290 unsolved in 26101 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 291/537 variables, 246/262 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 289/551 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/538 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/538 variables, and 553 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56164ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 56164ms
Starting structural reductions in LTL mode, iteration 1 : 247/269 places, 291/316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56475 ms. Remains : 247/269 places, 291/316 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)&&(G(F(p1))||(X(X(F(p1)))&&F(p2)))))'
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-12
Stuttering criterion allowed to conclude after 449 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-12 finished in 56766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 316/316 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 268 transition count 316
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 260 transition count 308
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 260 transition count 308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 254 transition count 299
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 254 transition count 299
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 249 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 249 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 244 transition count 289
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 244 transition count 289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 242 transition count 285
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 242 transition count 285
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 240 transition count 283
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 240 transition count 283
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 238 transition count 281
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 238 transition count 281
Applied a total of 61 rules in 19 ms. Remains 238 /269 variables (removed 31) and now considering 281/316 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5379391086638484585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16105833773917890027.kers'
[2026-05-24 06:28:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5379391086638484585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16105833773917890027.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 281 rows 238 cols 759 entries
Finished phase 1 with 236 SingleSign rule and 0 generalized
[2026-05-24 06:28:31] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16105833773917890027.kers
Total runtime 1 ms.
[2026-05-24 06:28:31] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-24 06:28:31] [INFO ] Invariant cache hit.
[2026-05-24 06:28:31] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2026-05-24 06:28:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 281/519 variables, 238/240 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 14/254 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (OVERLAPS) 0/519 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 254 constraints, problems are : Problem set: 0 solved, 280 unsolved in 19889 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 281/519 variables, 238/254 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 280/534 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 0/519 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 519/519 variables, and 534 constraints, problems are : Problem set: 0 solved, 280 unsolved in 25071 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44991ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 44993ms
Starting structural reductions in LTL mode, iteration 1 : 238/269 places, 281/316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45239 ms. Remains : 238/269 places, 281/316 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(!p1 U (p2||G(!p1)))))))'
Stuttering acceptance computed with spot in 145 ms :[true, (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-14 finished in 45429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 269/269 places, 316/316 transitions.
Graph (complete) has 535 edges and 269 vertex of which 264 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 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 263 transition count 271
Reduce places removed 40 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 223 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 222 transition count 270
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 83 place count 222 transition count 224
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 175 place count 176 transition count 224
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 182 place count 169 transition count 215
Iterating global reduction 3 with 7 rules applied. Total rules applied 189 place count 169 transition count 215
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 194 place count 164 transition count 210
Iterating global reduction 3 with 5 rules applied. Total rules applied 199 place count 164 transition count 210
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 202 place count 161 transition count 204
Iterating global reduction 3 with 3 rules applied. Total rules applied 205 place count 161 transition count 204
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 208 place count 158 transition count 201
Iterating global reduction 3 with 3 rules applied. Total rules applied 211 place count 158 transition count 201
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 333 place count 97 transition count 140
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 345 place count 85 transition count 117
Iterating global reduction 3 with 12 rules applied. Total rules applied 357 place count 85 transition count 117
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 369 place count 73 transition count 103
Iterating global reduction 3 with 12 rules applied. Total rules applied 381 place count 73 transition count 103
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 393 place count 61 transition count 80
Iterating global reduction 3 with 12 rules applied. Total rules applied 405 place count 61 transition count 80
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 417 place count 49 transition count 67
Iterating global reduction 3 with 12 rules applied. Total rules applied 429 place count 49 transition count 67
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 441 place count 37 transition count 44
Iterating global reduction 3 with 12 rules applied. Total rules applied 453 place count 37 transition count 44
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 465 place count 25 transition count 31
Iterating global reduction 3 with 12 rules applied. Total rules applied 477 place count 25 transition count 31
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 479 place count 23 transition count 28
Iterating global reduction 3 with 2 rules applied. Total rules applied 481 place count 23 transition count 28
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 482 place count 22 transition count 27
Iterating global reduction 3 with 1 rules applied. Total rules applied 483 place count 22 transition count 27
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 484 place count 22 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 485 place count 22 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 487 place count 20 transition count 24
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 18 vertex of which 15 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 494 place count 15 transition count 17
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 498 place count 11 transition count 17
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 5 with 4 rules applied. Total rules applied 502 place count 9 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 504 place count 8 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 505 place count 8 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 506 place count 7 transition count 14
Applied a total of 506 rules in 24 ms. Remains 7 /269 variables (removed 262) and now considering 14/316 (removed 302) transitions.
[2026-05-24 06:29:16] [INFO ] Flow matrix only has 13 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-9292593178802186863.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6373105925980250708.kers'
[2026-05-24 06:29:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9292593178802186863.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6373105925980250708.kers]
Normalized transition count is 12 out of 13 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 7 cols 20 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 06:29:16] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6373105925980250708.kers
Total runtime 0 ms.
[2026-05-24 06:29:16] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 06:29:16] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2026-05-24 06:29:16] [INFO ] Invariant cache hit.
[2026-05-24 06:29:16] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2026-05-24 06:29:16] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-24 06:29:16] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2026-05-24 06:29:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/19 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/20 variables, and 7 constraints, problems are : Problem set: 0 solved, 9 unsolved in 68 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/19 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 9 unsolved in 67 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 137ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/269 places, 14/316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 7/269 places, 14/316 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 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-15 finished in 313 ms.
All properties solved by simple procedures.
Total runtime 297146 ms.

BK_STOP 1779604157276

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

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