Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064600684.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is DiscoveryGPU-PT-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064600684
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 75K May 29 14:32 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-10b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748931127995

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 06:12:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 06:12:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 06:12:11] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2025-06-03 06:12:11] [INFO ] Transformed 296 places.
[2025-06-03 06:12:11] [INFO ] Transformed 314 transitions.
[2025-06-03 06:12:11] [INFO ] Found NUPN structural information;
[2025-06-03 06:12:11] [INFO ] Parsed PT model containing 296 places and 314 transitions and 819 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 314/314 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 276 transition count 314
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 68 place count 228 transition count 266
Iterating global reduction 1 with 48 rules applied. Total rules applied 116 place count 228 transition count 266
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 127 place count 217 transition count 255
Iterating global reduction 1 with 11 rules applied. Total rules applied 138 place count 217 transition count 255
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 146 place count 209 transition count 247
Iterating global reduction 1 with 8 rules applied. Total rules applied 154 place count 209 transition count 247
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 161 place count 202 transition count 240
Iterating global reduction 1 with 7 rules applied. Total rules applied 168 place count 202 transition count 240
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 199 transition count 234
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 199 transition count 234
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 177 place count 196 transition count 231
Iterating global reduction 1 with 3 rules applied. Total rules applied 180 place count 196 transition count 231
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 183 place count 193 transition count 228
Iterating global reduction 1 with 3 rules applied. Total rules applied 186 place count 193 transition count 228
Applied a total of 186 rules in 243 ms. Remains 193 /296 variables (removed 103) and now considering 228/314 (removed 86) transitions.
// Phase 1: matrix 228 rows 193 cols
[2025-06-03 06:12:11] [INFO ] Computed 2 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:12:12] [INFO ] Implicit Places using invariants in 556 ms returned []
[2025-06-03 06:12:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:12:12] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2025-06-03 06:12:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 228/421 variables, 193/195 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:23] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:23] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:24] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:24] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:24] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:24] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:24] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:24] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:25] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:25] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 10/205 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 0/421 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 205 constraints, problems are : Problem set: 0 solved, 227 unsolved in 29547 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 228/421 variables, 193/205 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 227/432 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 0/421 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 432 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59787ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 59818ms
Starting structural reductions in LTL mode, iteration 1 : 193/296 places, 228/314 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61197 ms. Remains : 193/296 places, 228/314 transitions.
Support contains 30 out of 193 places after structural reductions.
[2025-06-03 06:13:13] [INFO ] Flatten gal took : 71 ms
[2025-06-03 06:13:13] [INFO ] Flatten gal took : 48 ms
[2025-06-03 06:13:13] [INFO ] Input system was already deterministic with 228 transitions.
RANDOM walk for 40001 steps (123 resets) in 2145 ms. (18 steps per ms) remains 2/30 properties
BEST_FIRST walk for 40002 steps (22 resets) in 393 ms. (101 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
[2025-06-03 06:13:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/91 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 273/364 variables, 134/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 50/414 variables, 42/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/421 variables, 7/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/421 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 81/91 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 273/364 variables, 134/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 50/414 variables, 42/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/421 variables, 7/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:13:14] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 9 ms to minimize.
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Int declared 421/421 variables, and 197 constraints, problems are : Problem set: 1 solved, 0 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 706ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 384 edges and 193 vertex of which 191 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((F(G(p1))&&(X(p2) U ((!p3&&X(p2))||X(G(p2))))))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 228/228 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 185 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 185 transition count 219
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 179 transition count 209
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 179 transition count 209
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 173 transition count 203
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 173 transition count 203
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 168 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 168 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 167 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 167 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 166 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 166 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 165 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 165 transition count 194
Applied a total of 56 rules in 52 ms. Remains 165 /193 variables (removed 28) and now considering 194/228 (removed 34) transitions.
// Phase 1: matrix 194 rows 165 cols
[2025-06-03 06:13:15] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:13:15] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-03 06:13:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:13:16] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-03 06:13:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 194/359 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:13:23] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:13:23] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:13:23] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:13:24] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:13:24] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:13:24] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:13:24] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:13:24] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:13:24] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:13:24] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/359 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 177 constraints, problems are : Problem set: 0 solved, 193 unsolved in 21948 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/359 variables, 165/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 193/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/359 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 370 constraints, problems are : Problem set: 0 solved, 193 unsolved in 21381 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43440ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 43445ms
Starting structural reductions in LTL mode, iteration 1 : 165/193 places, 194/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43954 ms. Remains : 165/193 places, 194/228 transitions.
Stuttering acceptance computed with spot in 676 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-00
Stuttering criterion allowed to conclude after 744 steps with 1 reset in 17 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-00 finished in 44786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 228/228 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 185 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 185 transition count 219
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 179 transition count 209
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 179 transition count 209
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 173 transition count 203
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 173 transition count 203
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 168 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 168 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 167 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 167 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 166 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 166 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 165 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 165 transition count 194
Applied a total of 56 rules in 31 ms. Remains 165 /193 variables (removed 28) and now considering 194/228 (removed 34) transitions.
[2025-06-03 06:14:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:14:00] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-03 06:14:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:14:00] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-03 06:14:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 194/359 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:08] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:08] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:08] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:09] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:09] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:09] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:09] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:09] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:09] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:10] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/359 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 177 constraints, problems are : Problem set: 0 solved, 193 unsolved in 22759 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/359 variables, 165/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 193/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/359 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 370 constraints, problems are : Problem set: 0 solved, 193 unsolved in 19888 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42722ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 42724ms
Starting structural reductions in LTL mode, iteration 1 : 165/193 places, 194/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43140 ms. Remains : 165/193 places, 194/228 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-01 finished in 43329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!p0))||(F(!p0)&&X(X(X(X(p1)))))))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 228/228 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 185 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 185 transition count 219
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 179 transition count 209
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 179 transition count 209
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 173 transition count 203
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 173 transition count 203
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 168 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 168 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 167 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 167 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 166 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 166 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 165 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 165 transition count 194
Applied a total of 56 rules in 21 ms. Remains 165 /193 variables (removed 28) and now considering 194/228 (removed 34) transitions.
[2025-06-03 06:14:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:14:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-03 06:14:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:14:43] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-03 06:14:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 194/359 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:51] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:51] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:51] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:51] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:51] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:52] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:52] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:52] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:52] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:14:52] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/359 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 177 constraints, problems are : Problem set: 0 solved, 193 unsolved in 22049 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/359 variables, 165/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 193/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/359 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 370 constraints, problems are : Problem set: 0 solved, 193 unsolved in 20320 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42415ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 42416ms
Starting structural reductions in LTL mode, iteration 1 : 165/193 places, 194/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42738 ms. Remains : 165/193 places, 194/228 transitions.
Stuttering acceptance computed with spot in 490 ms :[p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-02
Product exploration explored 100000 steps with 16666 reset in 216 ms.
Product exploration explored 100000 steps with 16666 reset in 245 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 334 edges and 165 vertex of which 164 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 13 states, 18 edges and 2 AP (stutter sensitive) to 11 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 503 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (120 resets) in 130 ms. (305 steps per ms) remains 1/3 properties
BEST_FIRST walk for 14563 steps (5 resets) in 39 ms. (364 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 11 states, 14 edges and 2 AP (stutter sensitive) to 11 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 538 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 566 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 194/194 transitions.
Applied a total of 0 rules in 4 ms. Remains 165 /165 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2025-06-03 06:15:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:15:29] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-03 06:15:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:15:29] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-03 06:15:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 194/359 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:37] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:37] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:37] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:38] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:38] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:38] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:38] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:38] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:38] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:39] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/359 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 177 constraints, problems are : Problem set: 0 solved, 193 unsolved in 22703 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/359 variables, 165/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 193/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/359 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 370 constraints, problems are : Problem set: 0 solved, 193 unsolved in 20331 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43082ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 43083ms
Finished structural reductions in LTL mode , in 1 iterations and 43544 ms. Remains : 165/165 places, 194/194 transitions.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 334 edges and 165 vertex of which 164 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 11 states, 14 edges and 2 AP (stutter sensitive) to 11 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 514 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (121 resets) in 206 ms. (193 steps per ms) remains 1/3 properties
BEST_FIRST walk for 34164 steps (14 resets) in 104 ms. (325 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 241 ms. Reduced automaton from 11 states, 14 edges and 2 AP (stutter sensitive) to 11 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 588 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 584 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 576 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 16666 reset in 127 ms.
Product exploration explored 100000 steps with 16666 reset in 159 ms.
Applying partial POR strategy [false, false, false, true, false, false, false, false, false, false, true]
Stuttering acceptance computed with spot in 585 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 194/194 transitions.
Graph (complete) has 334 edges and 165 vertex of which 164 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 164 transition count 193
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 31 Pre rules applied. Total rules applied 21 place count 164 transition count 193
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 52 place count 164 transition count 193
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 75 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 76 place count 164 transition count 203
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 162 transition count 201
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 162 transition count 201
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 100 place count 162 transition count 241
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 108 place count 154 transition count 225
Deduced a syphon composed of 93 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 116 place count 154 transition count 225
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 140 place count 130 transition count 185
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 164 place count 130 transition count 185
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 186 place count 108 transition count 149
Deduced a syphon composed of 62 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 208 place count 108 transition count 149
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 215 place count 101 transition count 142
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 222 place count 101 transition count 142
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 236 place count 87 transition count 121
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 250 place count 87 transition count 121
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 278 place count 59 transition count 79
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 306 place count 59 transition count 79
Deduced a syphon composed of 34 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 308 place count 59 transition count 77
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 308 rules in 121 ms. Remains 59 /165 variables (removed 106) and now considering 77/194 (removed 117) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:16:16] [INFO ] Redundant transitions in 2 ms returned []
Running 76 sub problems to find dead transitions.
[2025-06-03 06:16:16] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
// Phase 1: matrix 74 rows 59 cols
[2025-06-03 06:16:16] [INFO ] Computed 2 invariants in 2 ms
[2025-06-03 06:16:16] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:17] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:17] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 3 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 73 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
At refinement iteration 4 (OVERLAPS) 74/133 variables, 59/63 constraints. Problems are: Problem set: 46 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 7/70 constraints. Problems are: Problem set: 46 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/70 constraints. Problems are: Problem set: 46 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/70 constraints. Problems are: Problem set: 46 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 70 constraints, problems are : Problem set: 46 solved, 30 unsolved in 2606 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 4/28 variables, 2/2 constraints. Problems are: Problem set: 46 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/4 constraints. Problems are: Problem set: 46 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 46 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 72/100 variables, 28/32 constraints. Problems are: Problem set: 46 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 7/39 constraints. Problems are: Problem set: 46 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 30/69 constraints. Problems are: Problem set: 46 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/69 constraints. Problems are: Problem set: 46 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 33/133 variables, 31/100 constraints. Problems are: Problem set: 46 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/100 constraints. Problems are: Problem set: 46 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/100 constraints. Problems are: Problem set: 46 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 100 constraints, problems are : Problem set: 46 solved, 30 unsolved in 2078 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 30/76 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4705ms problems are : Problem set: 46 solved, 30 unsolved
Search for dead transitions found 46 dead transitions in 4706ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 59/165 places, 31/194 transitions.
Graph (complete) has 69 edges and 59 vertex of which 25 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.0 ms
Discarding 34 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 25 /59 variables (removed 34) and now considering 31/31 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/165 places, 31/194 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4844 ms. Remains : 25/165 places, 31/194 transitions.
Built C files in :
/tmp/ltsmin10150034479401935065
[2025-06-03 06:16:21] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10150034479401935065
Running compilation step : cd /tmp/ltsmin10150034479401935065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 746 ms.
Running link step : cd /tmp/ltsmin10150034479401935065;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin10150034479401935065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2837409480256930002.hoa' '--buchi-type=spotba'
LTSmin run took 362 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-02 finished in 99432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (F(p1)||(X(p2) U ((p0&&X(p2))||X(G(p2))))))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 228/228 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 186 transition count 221
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 186 transition count 221
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 181 transition count 212
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 181 transition count 212
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 176 transition count 207
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 176 transition count 207
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 172 transition count 203
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 172 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 171 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 171 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 170 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 170 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 169 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 169 transition count 199
Applied a total of 48 rules in 40 ms. Remains 169 /193 variables (removed 24) and now considering 199/228 (removed 29) transitions.
// Phase 1: matrix 199 rows 169 cols
[2025-06-03 06:16:23] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:16:23] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-03 06:16:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:16:23] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-03 06:16:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/368 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:31] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:31] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:31] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:32] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:32] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:32] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:32] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:32] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:32] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:33] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 10/181 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/368 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 181 constraints, problems are : Problem set: 0 solved, 198 unsolved in 23254 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/368 variables, 169/181 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 198/379 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 379 constraints, problems are : Problem set: 0 solved, 198 unsolved in 21053 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44346ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 44347ms
Starting structural reductions in LTL mode, iteration 1 : 169/193 places, 199/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44822 ms. Remains : 169/193 places, 199/228 transitions.
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 341 edges and 169 vertex of which 168 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 19 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-10b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-03 finished in 45591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((!p0&&F(p1)))&&X(G(p2)))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 228/228 transitions.
Graph (complete) has 384 edges and 193 vertex of which 191 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 190 transition count 197
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 162 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 161 transition count 196
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 59 place count 161 transition count 164
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 123 place count 129 transition count 164
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 125 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 125 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 122 transition count 154
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 122 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 121 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 121 transition count 153
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 229 place count 76 transition count 108
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 237 place count 68 transition count 93
Iterating global reduction 3 with 8 rules applied. Total rules applied 245 place count 68 transition count 93
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 253 place count 60 transition count 83
Iterating global reduction 3 with 8 rules applied. Total rules applied 261 place count 60 transition count 83
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 268 place count 53 transition count 70
Iterating global reduction 3 with 7 rules applied. Total rules applied 275 place count 53 transition count 70
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 282 place count 46 transition count 62
Iterating global reduction 3 with 7 rules applied. Total rules applied 289 place count 46 transition count 62
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 296 place count 39 transition count 49
Iterating global reduction 3 with 7 rules applied. Total rules applied 303 place count 39 transition count 49
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 310 place count 32 transition count 41
Iterating global reduction 3 with 7 rules applied. Total rules applied 317 place count 32 transition count 41
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 319 place count 30 transition count 38
Iterating global reduction 3 with 2 rules applied. Total rules applied 321 place count 30 transition count 38
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 322 place count 29 transition count 37
Iterating global reduction 3 with 1 rules applied. Total rules applied 323 place count 29 transition count 37
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 324 place count 29 transition count 36
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 326 place count 29 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 328 place count 27 transition count 34
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 30 edges and 25 vertex of which 22 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 334 place count 22 transition count 28
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 338 place count 19 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 339 place count 18 transition count 27
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 347 place count 14 transition count 23
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 349 place count 14 transition count 21
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 352 place count 11 transition count 18
Applied a total of 352 rules in 76 ms. Remains 11 /193 variables (removed 182) and now considering 18/228 (removed 210) transitions.
[2025-06-03 06:17:08] [INFO ] Flow matrix only has 14 transitions (discarded 4 similar events)
// Phase 1: matrix 14 rows 11 cols
[2025-06-03 06:17:08] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:17:08] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-03 06:17:08] [INFO ] Flow matrix only has 14 transitions (discarded 4 similar events)
[2025-06-03 06:17:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:17:08] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:17:08] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-03 06:17:08] [INFO ] Flow matrix only has 14 transitions (discarded 4 similar events)
[2025-06-03 06:17:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/24 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/25 variables, and 11 constraints, problems are : Problem set: 0 solved, 11 unsolved in 257 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 4/24 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/25 variables, and 22 constraints, problems are : Problem set: 0 solved, 11 unsolved in 244 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 509ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 509ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/193 places, 18/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 656 ms. Remains : 11/193 places, 18/228 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (OR (NOT p1) p0), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-05 finished in 926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p0&&F(!p1))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 228/228 transitions.
Graph (complete) has 384 edges and 193 vertex of which 191 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 190 transition count 196
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 161 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 160 transition count 195
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 61 place count 160 transition count 163
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 125 place count 128 transition count 163
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 124 transition count 157
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 124 transition count 157
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 136 place count 121 transition count 153
Iterating global reduction 3 with 3 rules applied. Total rules applied 139 place count 121 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 140 place count 120 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 120 transition count 152
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
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 233 place count 74 transition count 106
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 241 place count 66 transition count 91
Iterating global reduction 3 with 8 rules applied. Total rules applied 249 place count 66 transition count 91
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 257 place count 58 transition count 81
Iterating global reduction 3 with 8 rules applied. Total rules applied 265 place count 58 transition count 81
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 272 place count 51 transition count 68
Iterating global reduction 3 with 7 rules applied. Total rules applied 279 place count 51 transition count 68
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 286 place count 44 transition count 60
Iterating global reduction 3 with 7 rules applied. Total rules applied 293 place count 44 transition count 60
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 300 place count 37 transition count 47
Iterating global reduction 3 with 7 rules applied. Total rules applied 307 place count 37 transition count 47
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 314 place count 30 transition count 39
Iterating global reduction 3 with 7 rules applied. Total rules applied 321 place count 30 transition count 39
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 323 place count 28 transition count 36
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 326 place count 27 transition count 35
Iterating global reduction 3 with 1 rules applied. Total rules applied 327 place count 27 transition count 35
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 328 place count 27 transition count 34
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 329 place count 27 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 331 place count 25 transition count 32
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 28 edges and 23 vertex of which 20 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
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 338 place count 20 transition count 25
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 342 place count 16 transition count 25
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 350 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 353 place count 12 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 356 place count 9 transition count 15
Applied a total of 356 rules in 64 ms. Remains 9 /193 variables (removed 184) and now considering 15/228 (removed 213) transitions.
[2025-06-03 06:17:09] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 9 cols
[2025-06-03 06:17:09] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:17:09] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 06:17:09] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2025-06-03 06:17:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:17:09] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:17:09] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-03 06:17:09] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2025-06-03 06:17:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/19 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/20 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 223 ms.
Refiners :[State Equation: 9/9 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/19 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/20 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 202 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 430ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 430ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/193 places, 15/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 561 ms. Remains : 9/193 places, 15/228 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, p1, (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-06
Stuttering criterion allowed to conclude after 64 steps with 7 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-06 finished in 734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&G((p1||(!p0 U (p2||G(!p0)))))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 228/228 transitions.
Graph (complete) has 384 edges and 193 vertex of which 192 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 191 transition count 196
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 161 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 160 transition count 195
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 63 place count 160 transition count 164
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 125 place count 129 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 128 place count 126 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 131 place count 126 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 123 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 123 transition count 155
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
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 229 place count 77 transition count 109
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 236 place count 70 transition count 95
Iterating global reduction 3 with 7 rules applied. Total rules applied 243 place count 70 transition count 95
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 250 place count 63 transition count 87
Iterating global reduction 3 with 7 rules applied. Total rules applied 257 place count 63 transition count 87
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 264 place count 56 transition count 74
Iterating global reduction 3 with 7 rules applied. Total rules applied 271 place count 56 transition count 74
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 278 place count 49 transition count 66
Iterating global reduction 3 with 7 rules applied. Total rules applied 285 place count 49 transition count 66
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 291 place count 43 transition count 55
Iterating global reduction 3 with 6 rules applied. Total rules applied 297 place count 43 transition count 55
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 303 place count 37 transition count 48
Iterating global reduction 3 with 6 rules applied. Total rules applied 309 place count 37 transition count 48
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 310 place count 36 transition count 47
Iterating global reduction 3 with 1 rules applied. Total rules applied 311 place count 36 transition count 47
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 312 place count 36 transition count 47
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 314 place count 34 transition count 45
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 58 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 319 place count 32 transition count 41
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 322 place count 29 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 328 place count 26 transition count 38
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 332 place count 22 transition count 34
Applied a total of 332 rules in 47 ms. Remains 22 /193 variables (removed 171) and now considering 34/228 (removed 194) transitions.
[2025-06-03 06:17:10] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
// Phase 1: matrix 29 rows 22 cols
[2025-06-03 06:17:10] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:17:10] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-03 06:17:10] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
[2025-06-03 06:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:17:10] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:17:10] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2025-06-03 06:17:10] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
[2025-06-03 06:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 28/46 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 4/50 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/51 variables, and 23 constraints, problems are : Problem set: 0 solved, 26 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 28/46 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 4/50 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 0/50 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/51 variables, and 49 constraints, problems are : Problem set: 0 solved, 26 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1811ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 1811ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/193 places, 34/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1956 ms. Remains : 22/193 places, 34/228 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND p0 p1 (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-07 finished in 2162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 228/228 transitions.
Graph (complete) has 384 edges and 193 vertex of which 191 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 190 transition count 195
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 160 transition count 195
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 61 place count 160 transition count 163
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 125 place count 128 transition count 163
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 130 place count 123 transition count 155
Iterating global reduction 2 with 5 rules applied. Total rules applied 135 place count 123 transition count 155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 139 place count 119 transition count 150
Iterating global reduction 2 with 4 rules applied. Total rules applied 143 place count 119 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 118 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 118 transition count 149
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 237 place count 72 transition count 103
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 246 place count 63 transition count 86
Iterating global reduction 2 with 9 rules applied. Total rules applied 255 place count 63 transition count 86
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 264 place count 54 transition count 75
Iterating global reduction 2 with 9 rules applied. Total rules applied 273 place count 54 transition count 75
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 281 place count 46 transition count 60
Iterating global reduction 2 with 8 rules applied. Total rules applied 289 place count 46 transition count 60
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 297 place count 38 transition count 51
Iterating global reduction 2 with 8 rules applied. Total rules applied 305 place count 38 transition count 51
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 313 place count 30 transition count 36
Iterating global reduction 2 with 8 rules applied. Total rules applied 321 place count 30 transition count 36
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 329 place count 22 transition count 27
Iterating global reduction 2 with 8 rules applied. Total rules applied 337 place count 22 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 338 place count 21 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 339 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 340 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 341 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 343 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 350 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 354 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 358 place count 8 transition count 14
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 4 with 2 rules applied. Total rules applied 360 place count 7 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 361 place count 7 transition count 13
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 362 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 364 place count 5 transition count 10
Applied a total of 364 rules in 30 ms. Remains 5 /193 variables (removed 188) and now considering 10/228 (removed 218) transitions.
[2025-06-03 06:17:12] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2025-06-03 06:17:12] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:17:12] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 06:17:12] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2025-06-03 06:17:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:17:12] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:17:12] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-03 06:17:12] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2025-06-03 06:17:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 102 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 112 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 218ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 218ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/193 places, 10/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 5/193 places, 10/228 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-08 finished in 378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 228/228 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 185 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 185 transition count 219
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 179 transition count 209
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 179 transition count 209
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 173 transition count 203
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 173 transition count 203
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 168 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 168 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 167 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 167 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 166 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 166 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 165 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 165 transition count 194
Applied a total of 56 rules in 25 ms. Remains 165 /193 variables (removed 28) and now considering 194/228 (removed 34) transitions.
// Phase 1: matrix 194 rows 165 cols
[2025-06-03 06:17:12] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:17:12] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-03 06:17:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:17:13] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-03 06:17:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 194/359 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:21] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:21] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:21] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:21] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:21] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:21] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:21] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:22] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:22] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:17:22] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/359 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 177 constraints, problems are : Problem set: 0 solved, 193 unsolved in 22436 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/359 variables, 165/177 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 193/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/359 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 370 constraints, problems are : Problem set: 0 solved, 193 unsolved in 19456 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41948ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 41949ms
Starting structural reductions in LTL mode, iteration 1 : 165/193 places, 194/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42434 ms. Remains : 165/193 places, 194/228 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 149 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-09 finished in 42591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&F((X(p2)&&p1)))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 228/228 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 185 transition count 219
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 185 transition count 219
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 180 transition count 211
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 180 transition count 211
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 175 transition count 206
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 175 transition count 206
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 171 transition count 202
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 171 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 170 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 170 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 169 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 169 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 168 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 168 transition count 198
Applied a total of 50 rules in 15 ms. Remains 168 /193 variables (removed 25) and now considering 198/228 (removed 30) transitions.
// Phase 1: matrix 198 rows 168 cols
[2025-06-03 06:17:55] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:17:55] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-03 06:17:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:17:55] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2025-06-03 06:17:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 198/366 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:03] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:04] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:04] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:04] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:04] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:04] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:04] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:04] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:05] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:05] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 10/180 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 0/366 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 180 constraints, problems are : Problem set: 0 solved, 197 unsolved in 23615 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/366 variables, 168/180 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 197/377 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 377 constraints, problems are : Problem set: 0 solved, 197 unsolved in 23655 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47326ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 47327ms
Starting structural reductions in LTL mode, iteration 1 : 168/193 places, 198/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47765 ms. Remains : 168/193 places, 198/228 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-10
Stuttering criterion allowed to conclude after 384 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-10 finished in 48032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 228/228 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 187 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 187 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 183 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 183 transition count 215
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 179 transition count 211
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 179 transition count 211
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 176 transition count 208
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 176 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 175 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 175 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 174 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 174 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 173 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 173 transition count 204
Applied a total of 40 rules in 17 ms. Remains 173 /193 variables (removed 20) and now considering 204/228 (removed 24) transitions.
// Phase 1: matrix 204 rows 173 cols
[2025-06-03 06:18:43] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:18:43] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-03 06:18:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:18:43] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-06-03 06:18:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 204/377 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:52] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:52] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:52] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:52] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:52] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:53] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:53] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:53] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:53] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:18:53] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 10/185 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 0/377 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 185 constraints, problems are : Problem set: 0 solved, 203 unsolved in 24559 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/377 variables, 173/185 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 203/388 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/377 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 388 constraints, problems are : Problem set: 0 solved, 203 unsolved in 24152 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48774ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 48775ms
Starting structural reductions in LTL mode, iteration 1 : 173/193 places, 204/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49191 ms. Remains : 173/193 places, 204/228 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-11
Stuttering criterion allowed to conclude after 267 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-11 finished in 49338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 228/228 transitions.
Graph (complete) has 384 edges and 193 vertex of which 191 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 190 transition count 194
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 159 transition count 194
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 63 place count 159 transition count 162
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 127 place count 127 transition count 162
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 132 place count 122 transition count 154
Iterating global reduction 2 with 5 rules applied. Total rules applied 137 place count 122 transition count 154
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 141 place count 118 transition count 149
Iterating global reduction 2 with 4 rules applied. Total rules applied 145 place count 118 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 117 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 117 transition count 148
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
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 237 place count 72 transition count 103
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 246 place count 63 transition count 86
Iterating global reduction 2 with 9 rules applied. Total rules applied 255 place count 63 transition count 86
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 264 place count 54 transition count 75
Iterating global reduction 2 with 9 rules applied. Total rules applied 273 place count 54 transition count 75
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 282 place count 45 transition count 58
Iterating global reduction 2 with 9 rules applied. Total rules applied 291 place count 45 transition count 58
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 300 place count 36 transition count 48
Iterating global reduction 2 with 9 rules applied. Total rules applied 309 place count 36 transition count 48
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 318 place count 27 transition count 31
Iterating global reduction 2 with 9 rules applied. Total rules applied 327 place count 27 transition count 31
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 336 place count 18 transition count 21
Iterating global reduction 2 with 9 rules applied. Total rules applied 345 place count 18 transition count 21
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 347 place count 16 transition count 18
Iterating global reduction 2 with 2 rules applied. Total rules applied 349 place count 16 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 350 place count 15 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 351 place count 15 transition count 17
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 352 place count 15 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 354 place count 13 transition count 14
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 13 edges and 11 vertex of which 8 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 359 place count 8 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 361 place count 6 transition count 9
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 4 with 2 rules applied. Total rules applied 363 place count 5 transition count 8
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 4 with 2 rules applied. Total rules applied 365 place count 4 transition count 7
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 366 place count 4 transition count 6
Applied a total of 366 rules in 24 ms. Remains 4 /193 variables (removed 189) and now considering 6/228 (removed 222) transitions.
[2025-06-03 06:19:32] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2025-06-03 06:19:32] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:19:32] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-03 06:19:32] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2025-06-03 06:19:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:19:32] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:19:32] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 06:19:32] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2025-06-03 06:19:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/8 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/193 places, 6/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 4/193 places, 6/228 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-12 finished in 201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U (p2||G(p1)))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 228/228 transitions.
Graph (complete) has 384 edges and 193 vertex of which 191 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 190 transition count 196
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 161 transition count 196
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 59 place count 161 transition count 164
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 123 place count 129 transition count 164
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 128 place count 124 transition count 156
Iterating global reduction 2 with 5 rules applied. Total rules applied 133 place count 124 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 137 place count 120 transition count 151
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 120 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 119 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 119 transition count 150
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 231 place count 75 transition count 106
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 238 place count 68 transition count 93
Iterating global reduction 2 with 7 rules applied. Total rules applied 245 place count 68 transition count 93
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 252 place count 61 transition count 84
Iterating global reduction 2 with 7 rules applied. Total rules applied 259 place count 61 transition count 84
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 266 place count 54 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 273 place count 54 transition count 71
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 280 place count 47 transition count 63
Iterating global reduction 2 with 7 rules applied. Total rules applied 287 place count 47 transition count 63
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 294 place count 40 transition count 50
Iterating global reduction 2 with 7 rules applied. Total rules applied 301 place count 40 transition count 50
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 308 place count 33 transition count 42
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 33 transition count 42
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 317 place count 31 transition count 39
Iterating global reduction 2 with 2 rules applied. Total rules applied 319 place count 31 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 320 place count 30 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 321 place count 30 transition count 38
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 322 place count 30 transition count 37
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 324 place count 30 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 325 place count 29 transition count 36
Applied a total of 325 rules in 31 ms. Remains 29 /193 variables (removed 164) and now considering 36/228 (removed 192) transitions.
[2025-06-03 06:19:32] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
// Phase 1: matrix 32 rows 29 cols
[2025-06-03 06:19:32] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:19:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-03 06:19:32] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
[2025-06-03 06:19:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:19:33] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-03 06:19:33] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:19:33] [INFO ] Redundant transitions in 0 ms returned []
Running 35 sub problems to find dead transitions.
[2025-06-03 06:19:33] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
[2025-06-03 06:19:33] [INFO ] Invariant cache hit.
[2025-06-03 06:19:33] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 31/60 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 25/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/61 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 0/61 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 57 constraints, problems are : Problem set: 0 solved, 35 unsolved in 924 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 31/60 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 25/56 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 35/91 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 1/61 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 92 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1405 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2333ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 2335ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/193 places, 36/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2481 ms. Remains : 29/193 places, 36/228 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p2) (NOT p1)), true, (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Computed a total of 23 stabilizing places and 24 stable transitions
Computed a total of 23 stabilizing places and 24 stable transitions
Detected a total of 23/29 stabilizing places and 24/36 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p2) p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 25 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-10b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-13 finished in 3224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 228/228 transitions.
Graph (complete) has 384 edges and 193 vertex of which 191 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 190 transition count 195
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 160 transition count 195
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 61 place count 160 transition count 164
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 123 place count 129 transition count 164
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 128 place count 124 transition count 156
Iterating global reduction 2 with 5 rules applied. Total rules applied 133 place count 124 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 137 place count 120 transition count 151
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 120 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 119 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 119 transition count 150
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 235 place count 73 transition count 104
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 244 place count 64 transition count 87
Iterating global reduction 2 with 9 rules applied. Total rules applied 253 place count 64 transition count 87
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 262 place count 55 transition count 76
Iterating global reduction 2 with 9 rules applied. Total rules applied 271 place count 55 transition count 76
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 280 place count 46 transition count 59
Iterating global reduction 2 with 9 rules applied. Total rules applied 289 place count 46 transition count 59
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 297 place count 38 transition count 50
Iterating global reduction 2 with 8 rules applied. Total rules applied 305 place count 38 transition count 50
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 313 place count 30 transition count 35
Iterating global reduction 2 with 8 rules applied. Total rules applied 321 place count 30 transition count 35
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 329 place count 22 transition count 26
Iterating global reduction 2 with 8 rules applied. Total rules applied 337 place count 22 transition count 26
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 339 place count 20 transition count 23
Iterating global reduction 2 with 2 rules applied. Total rules applied 341 place count 20 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 342 place count 19 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 343 place count 19 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 345 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 26 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 348 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 349 place count 14 transition count 18
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 4 with 2 rules applied. Total rules applied 351 place count 13 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 353 place count 11 transition count 16
Applied a total of 353 rules in 21 ms. Remains 11 /193 variables (removed 182) and now considering 16/228 (removed 212) transitions.
[2025-06-03 06:19:36] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 11 cols
[2025-06-03 06:19:36] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:19:36] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-03 06:19:36] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2025-06-03 06:19:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:19:36] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:19:36] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 06:19:36] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2025-06-03 06:19:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 14/23 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/25 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/26 variables, and 12 constraints, problems are : Problem set: 0 solved, 12 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 14/23 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/25 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/26 variables, and 24 constraints, problems are : Problem set: 0 solved, 12 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 618ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 618ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/193 places, 16/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 710 ms. Remains : 11/193 places, 16/228 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-14
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-14 finished in 810 ms.
All properties solved by simple procedures.
Total runtime 446306 ms.

BK_STOP 1748931577012

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-10b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854064600684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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