Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064700716.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-12b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064700716
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K 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 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 89K 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-12b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-12b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748941376879

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-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 09:02:59] [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 09:02:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 09:02:59] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2025-06-03 09:02:59] [INFO ] Transformed 352 places.
[2025-06-03 09:02:59] [INFO ] Transformed 374 transitions.
[2025-06-03 09:02:59] [INFO ] Found NUPN structural information;
[2025-06-03 09:02:59] [INFO ] Parsed PT model containing 352 places and 374 transitions and 977 arcs in 384 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 374/374 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 328 transition count 374
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 83 place count 269 transition count 315
Iterating global reduction 1 with 59 rules applied. Total rules applied 142 place count 269 transition count 315
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 154 place count 257 transition count 303
Iterating global reduction 1 with 12 rules applied. Total rules applied 166 place count 257 transition count 303
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 176 place count 247 transition count 293
Iterating global reduction 1 with 10 rules applied. Total rules applied 186 place count 247 transition count 293
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 195 place count 238 transition count 284
Iterating global reduction 1 with 9 rules applied. Total rules applied 204 place count 238 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 210 place count 232 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 216 place count 232 transition count 272
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 222 place count 226 transition count 266
Iterating global reduction 1 with 6 rules applied. Total rules applied 228 place count 226 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 234 place count 220 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 240 place count 220 transition count 260
Applied a total of 240 rules in 157 ms. Remains 220 /352 variables (removed 132) and now considering 260/374 (removed 114) transitions.
// Phase 1: matrix 260 rows 220 cols
[2025-06-03 09:03:00] [INFO ] Computed 2 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:03:00] [INFO ] Implicit Places using invariants in 548 ms returned []
[2025-06-03 09:03:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:03:01] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2025-06-03 09:03:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 260/480 variables, 220/222 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:03:15] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:03:15] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:03:15] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:03:15] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:03:15] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:03:16] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:03:16] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:03:16] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:03:16] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:03:16] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:03:17] [INFO ] Deduced a trap composed of 19 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 09:03:17] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:03:17] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 13/235 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/480 variables, and 235 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 260/480 variables, 220/235 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 259/494 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:03:40] [INFO ] Deduced a trap composed of 125 places in 216 ms of which 36 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:03:47] [INFO ] Deduced a trap composed of 124 places in 165 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:03:57] [INFO ] Deduced a trap composed of 143 places in 184 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 497 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60373ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Starting structural reductions in LTL mode, iteration 1 : 220/352 places, 260/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61692 ms. Remains : 220/352 places, 260/374 transitions.
Support contains 29 out of 220 places after structural reductions.
[2025-06-03 09:04:02] [INFO ] Flatten gal took : 83 ms
[2025-06-03 09:04:02] [INFO ] Flatten gal took : 42 ms
[2025-06-03 09:04:02] [INFO ] Input system was already deterministic with 260 transitions.
RANDOM walk for 9310 steps (19 resets) in 568 ms. (16 steps per ms) remains 0/28 properties
Computed a total of 40 stabilizing places and 40 stable transitions
Graph (complete) has 441 edges and 220 vertex of which 218 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 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(F(((!p0&&X(X(X((p1&&X(p2))))))||G((p1&&X(p2)))))))'
Support contains 4 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 212 transition count 249
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 212 transition count 249
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 207 transition count 244
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 207 transition count 244
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 203 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 203 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 202 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 202 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 201 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 201 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 200 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 200 transition count 236
Applied a total of 40 rules in 41 ms. Remains 200 /220 variables (removed 20) and now considering 236/260 (removed 24) transitions.
// Phase 1: matrix 236 rows 200 cols
[2025-06-03 09:04:02] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:04:03] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-03 09:04:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:04:03] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2025-06-03 09:04:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (OVERLAPS) 236/436 variables, 200/202 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:12] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:13] [INFO ] Deduced a trap composed of 8 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 09:04:13] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:13] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:13] [INFO ] Deduced a trap composed of 11 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 09:04:13] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:13] [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 09:04:14] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:14] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:14] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:14] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:04:14] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 12/214 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 214 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 236/436 variables, 200/214 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 235/449 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 449 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Starting structural reductions in LTL mode, iteration 1 : 200/220 places, 236/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60536 ms. Remains : 200/220 places, 236/260 transitions.
Stuttering acceptance computed with spot in 1259 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-00
Product exploration explored 100000 steps with 313 reset in 704 ms.
Stack based approach found an accepted trace after 54410 steps with 179 reset with depth 158 and stack size 155 in 323 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-00 finished in 62929 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)))'
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Graph (complete) has 441 edges and 220 vertex of which 218 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 217 transition count 226
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 186 transition count 226
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 63 place count 186 transition count 188
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 139 place count 148 transition count 188
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 145 place count 142 transition count 179
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 142 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 151 place count 142 transition count 178
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 141 transition count 178
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 158 place count 136 transition count 173
Iterating global reduction 2 with 5 rules applied. Total rules applied 163 place count 136 transition count 173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 165 place count 134 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 134 transition count 169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 169 place count 132 transition count 167
Iterating global reduction 2 with 2 rules applied. Total rules applied 171 place count 132 transition count 167
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 273 place count 81 transition count 116
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 284 place count 70 transition count 94
Iterating global reduction 2 with 11 rules applied. Total rules applied 295 place count 70 transition count 94
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 306 place count 59 transition count 83
Iterating global reduction 2 with 11 rules applied. Total rules applied 317 place count 59 transition count 83
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 327 place count 49 transition count 63
Iterating global reduction 2 with 10 rules applied. Total rules applied 337 place count 49 transition count 63
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 347 place count 39 transition count 53
Iterating global reduction 2 with 10 rules applied. Total rules applied 357 place count 39 transition count 53
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 367 place count 29 transition count 33
Iterating global reduction 2 with 10 rules applied. Total rules applied 377 place count 29 transition count 33
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 387 place count 19 transition count 23
Iterating global reduction 2 with 10 rules applied. Total rules applied 397 place count 19 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 19 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 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 401 place count 17 transition count 20
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 17 edges and 15 vertex of which 12 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.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 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 406 place count 12 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 408 place count 10 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 414 place count 7 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 415 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 417 place count 5 transition count 9
Applied a total of 417 rules in 182 ms. Remains 5 /220 variables (removed 215) and now considering 9/260 (removed 251) transitions.
[2025-06-03 09:05:05] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2025-06-03 09:05:05] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:05:05] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-03 09:05:05] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2025-06-03 09:05:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:05:06] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:05:06] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-03 09:05:06] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2025-06-03 09:05:06] [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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/12 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 88 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3/11 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/12 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 79 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 175ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/220 places, 9/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 430 ms. Remains : 5/220 places, 9/260 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-02
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-02 finished in 501 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' '!((p0 U G(p1)))'
Support contains 3 out of 220 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Graph (complete) has 441 edges and 220 vertex of which 218 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 217 transition count 227
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 187 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 186 transition count 226
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 63 place count 186 transition count 188
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 139 place count 148 transition count 188
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 145 place count 142 transition count 179
Iterating global reduction 3 with 6 rules applied. Total rules applied 151 place count 142 transition count 179
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 156 place count 137 transition count 174
Iterating global reduction 3 with 5 rules applied. Total rules applied 161 place count 137 transition count 174
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 163 place count 135 transition count 170
Iterating global reduction 3 with 2 rules applied. Total rules applied 165 place count 135 transition count 170
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 167 place count 133 transition count 168
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 133 transition count 168
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 271 place count 82 transition count 117
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 282 place count 71 transition count 95
Iterating global reduction 3 with 11 rules applied. Total rules applied 293 place count 71 transition count 95
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 304 place count 60 transition count 84
Iterating global reduction 3 with 11 rules applied. Total rules applied 315 place count 60 transition count 84
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 325 place count 50 transition count 64
Iterating global reduction 3 with 10 rules applied. Total rules applied 335 place count 50 transition count 64
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 345 place count 40 transition count 54
Iterating global reduction 3 with 10 rules applied. Total rules applied 355 place count 40 transition count 54
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 364 place count 31 transition count 36
Iterating global reduction 3 with 9 rules applied. Total rules applied 373 place count 31 transition count 36
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 382 place count 22 transition count 27
Iterating global reduction 3 with 9 rules applied. Total rules applied 391 place count 22 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 392 place count 22 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 394 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 396 place count 19 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 397 place count 18 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 397 place count 18 transition count 20
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 403 place count 15 transition count 20
Applied a total of 403 rules in 84 ms. Remains 15 /220 variables (removed 205) and now considering 20/260 (removed 240) transitions.
[2025-06-03 09:05:06] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 15 cols
[2025-06-03 09:05:06] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:05:06] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-03 09:05:06] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2025-06-03 09:05:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:05:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 09:05:06] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:05:06] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2025-06-03 09:05:06] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2025-06-03 09:05:06] [INFO ] Invariant cache hit.
[2025-06-03 09:05:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 17 constraints, problems are : Problem set: 0 solved, 19 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 18/33 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/33 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 36 constraints, problems are : Problem set: 0 solved, 19 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 730ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 731ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/220 places, 20/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 908 ms. Remains : 15/220 places, 20/260 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-03 finished in 1015 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(F(p0)))'
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Graph (complete) has 441 edges and 220 vertex of which 219 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 218 transition count 226
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 186 transition count 226
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 65 place count 186 transition count 188
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 141 place count 148 transition count 188
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 147 place count 142 transition count 179
Iterating global reduction 2 with 6 rules applied. Total rules applied 153 place count 142 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 153 place count 142 transition count 178
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 155 place count 141 transition count 178
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 160 place count 136 transition count 173
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 136 transition count 173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 167 place count 134 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 169 place count 134 transition count 169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 171 place count 132 transition count 167
Iterating global reduction 2 with 2 rules applied. Total rules applied 173 place count 132 transition count 167
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 275 place count 81 transition count 116
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 286 place count 70 transition count 94
Iterating global reduction 2 with 11 rules applied. Total rules applied 297 place count 70 transition count 94
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 308 place count 59 transition count 83
Iterating global reduction 2 with 11 rules applied. Total rules applied 319 place count 59 transition count 83
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 329 place count 49 transition count 63
Iterating global reduction 2 with 10 rules applied. Total rules applied 339 place count 49 transition count 63
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 349 place count 39 transition count 53
Iterating global reduction 2 with 10 rules applied. Total rules applied 359 place count 39 transition count 53
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 369 place count 29 transition count 33
Iterating global reduction 2 with 10 rules applied. Total rules applied 379 place count 29 transition count 33
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 389 place count 19 transition count 23
Iterating global reduction 2 with 10 rules applied. Total rules applied 399 place count 19 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 19 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 401 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 403 place count 17 transition count 20
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 17 edges and 15 vertex of which 12 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 408 place count 12 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 410 place count 10 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 416 place count 7 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 419 place count 5 transition count 9
Applied a total of 419 rules in 53 ms. Remains 5 /220 variables (removed 215) and now considering 9/260 (removed 251) transitions.
[2025-06-03 09:05:07] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2025-06-03 09:05:07] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:05:07] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-03 09:05:07] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2025-06-03 09:05:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:05:07] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:05:07] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-03 09:05:07] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2025-06-03 09:05:07] [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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/12 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 57 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/11 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/12 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 60 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/220 places, 9/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 231 ms. Remains : 5/220 places, 9/260 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-04 finished in 314 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((F(p0)&&X((X(F(p1))&&(p2||G(p3)))))))'
Support contains 3 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 212 transition count 249
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 212 transition count 249
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 206 transition count 243
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 206 transition count 243
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 201 transition count 237
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 201 transition count 237
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 199 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 199 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 197 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 197 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 196 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 196 transition count 231
Applied a total of 48 rules in 24 ms. Remains 196 /220 variables (removed 24) and now considering 231/260 (removed 29) transitions.
// Phase 1: matrix 231 rows 196 cols
[2025-06-03 09:05:07] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:05:07] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-03 09:05:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:05:08] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2025-06-03 09:05: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/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 231/427 variables, 196/198 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:05:18] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:05:18] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:05:18] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:05:18] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:05:18] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:05:19] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:05:19] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:05:19] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:05:19] [INFO ] Deduced a trap composed of 15 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 09:05:19] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:05:19] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:05:20] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 12/210 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 0/427 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 210 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 231/427 variables, 196/210 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 230/440 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 0/427 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 440 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60076ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 60077ms
Starting structural reductions in LTL mode, iteration 1 : 196/220 places, 231/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60504 ms. Remains : 196/220 places, 231/260 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (NOT p1), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-05
Product exploration explored 100000 steps with 683 reset in 271 ms.
Stack based approach found an accepted trace after 258 steps with 1 reset with depth 104 and stack size 104 in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-05 finished in 61111 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)&&X(X((X(p1) U ((p2&&X(p1))||X(G(p1))))))))'
Support contains 3 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 214 transition count 253
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 214 transition count 253
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 211 transition count 250
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 211 transition count 250
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 208 transition count 246
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 208 transition count 246
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 206 transition count 243
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 206 transition count 243
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 204 transition count 241
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 204 transition count 241
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 203 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 203 transition count 240
Applied a total of 34 rules in 30 ms. Remains 203 /220 variables (removed 17) and now considering 240/260 (removed 20) transitions.
// Phase 1: matrix 240 rows 203 cols
[2025-06-03 09:06:08] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:06:08] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-03 09:06:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:06:09] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2025-06-03 09:06: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/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 240/443 variables, 203/205 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:20] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:20] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:20] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:20] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:20] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:21] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:21] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:21] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:21] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:21] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:21] [INFO ] Deduced a trap composed of 19 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 09:06:22] [INFO ] Deduced a trap composed of 19 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 09:06:22] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 30 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 13/218 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 0/443 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 218 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 240/443 variables, 203/218 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 239/457 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:47] [INFO ] Deduced a trap composed of 114 places in 200 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:06:47] [INFO ] Deduced a trap composed of 128 places in 156 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/443 variables, and 459 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 203/220 places, 240/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60460 ms. Remains : 203/220 places, 240/260 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-06
Stuttering criterion allowed to conclude after 325 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-06 finished in 60784 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) U X(p1)))'
Support contains 4 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 212 transition count 250
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 212 transition count 250
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 207 transition count 245
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 207 transition count 245
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 203 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 203 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 201 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 201 transition count 237
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 199 transition count 235
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 199 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 198 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 198 transition count 234
Applied a total of 44 rules in 20 ms. Remains 198 /220 variables (removed 22) and now considering 234/260 (removed 26) transitions.
// Phase 1: matrix 234 rows 198 cols
[2025-06-03 09:07:09] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:07:09] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-03 09:07:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:07:09] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2025-06-03 09:07: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/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 234/432 variables, 198/200 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:20] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:20] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:20] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:20] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:20] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:21] [INFO ] Deduced a trap composed of 12 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 09:07:21] [INFO ] Deduced a trap composed of 13 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 09:07:21] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:21] [INFO ] Deduced a trap composed of 15 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 09:07:21] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:21] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:07:22] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 12/212 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (OVERLAPS) 0/432 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 212 constraints, problems are : Problem set: 0 solved, 233 unsolved in 28015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/432 variables, 198/212 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 233/445 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/432 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 445 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58075ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 58076ms
Starting structural reductions in LTL mode, iteration 1 : 198/220 places, 234/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58558 ms. Remains : 198/220 places, 234/260 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Graph (complete) has 402 edges and 198 vertex of which 197 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 38 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 26 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-12b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-07 finished in 59185 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((X((G(p0)||X(p1)))||G(p2)))))))'
Support contains 4 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 211 transition count 248
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 211 transition count 248
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 205 transition count 242
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 205 transition count 242
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 200 transition count 236
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 200 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 198 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 198 transition count 233
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 196 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 196 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 195 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 195 transition count 230
Applied a total of 50 rules in 28 ms. Remains 195 /220 variables (removed 25) and now considering 230/260 (removed 30) transitions.
// Phase 1: matrix 230 rows 195 cols
[2025-06-03 09:08:08] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:08:08] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-06-03 09:08:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:08:09] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2025-06-03 09:08: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/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/425 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:19] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:20] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:20] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:20] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:20] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:20] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:21] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:21] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:21] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:21] [INFO ] Deduced a trap composed of 16 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 09:08:21] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:08:21] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 209 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/425 variables, 195/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 229/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 438 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 195/220 places, 230/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60661 ms. Remains : 195/220 places, 230/260 transitions.
Stuttering acceptance computed with spot in 547 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-09
Product exploration explored 100000 steps with 14305 reset in 164 ms.
Product exploration explored 100000 steps with 14259 reset in 181 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Graph (complete) has 396 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 38 stabilizing places and 38 stable transitions
Detected a total of 38/195 stabilizing places and 38/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 14 states, 30 edges and 3 AP (stutter sensitive) to 14 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 715 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (101 resets) in 835 ms. (47 steps per ms) remains 5/19 properties
BEST_FIRST walk for 40004 steps (13 resets) in 274 ms. (145 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (16 resets) in 276 ms. (144 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (14 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (13 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (13 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
[2025-06-03 09:09:11] [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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 85/96 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 275/371 variables, 139/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf10 is UNSAT
Problem apf13 is UNSAT
Problem apf17 is UNSAT
At refinement iteration 7 (OVERLAPS) 46/417 variables, 37/189 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/425 variables, 8/197 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/425 variables, 0/197 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 197 constraints, problems are : Problem set: 3 solved, 2 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem apf3 is UNSAT
Problem apf16 is UNSAT
After SMT solving in domain Int declared 11/425 variables, and 2 constraints, problems are : Problem set: 5 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/195 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 351ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p0)), (G (OR p1 (NOT p2))), (G (OR p1 p0 (NOT p2))), (G (OR p1 p0 p2)), (G (OR p1 (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F p2), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 1042 ms. Reduced automaton from 14 states, 30 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 404 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 411 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 3 out of 195 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 195 /195 variables (removed 0) and now considering 230/230 (removed 0) transitions.
[2025-06-03 09:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:09:14] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-03 09:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:09:14] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2025-06-03 09:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/425 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:24] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:24] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:24] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [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 09:09:25] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:25] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 15 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 09:09:26] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:09:26] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 209 constraints, problems are : Problem set: 0 solved, 229 unsolved in 23726 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/425 variables, 195/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 229/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 438 constraints, problems are : Problem set: 0 solved, 229 unsolved in 24511 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48350ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 48353ms
Finished structural reductions in LTL mode , in 1 iterations and 48792 ms. Remains : 195/195 places, 230/230 transitions.
Computed a total of 38 stabilizing places and 38 stable transitions
Graph (complete) has 396 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 38 stabilizing places and 38 stable transitions
Detected a total of 38/195 stabilizing places and 38/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 9 states, 12 edges and 2 AP (stutter sensitive) to 9 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
RANDOM walk for 173 steps (0 resets) in 6 ms. (24 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 207 ms. Reduced automaton from 9 states, 12 edges and 2 AP (stutter sensitive) to 9 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 420 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 383 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 401 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Product exploration explored 100000 steps with 14284 reset in 95 ms.
Product exploration explored 100000 steps with 14277 reset in 104 ms.
Applying partial POR strategy [false, false, false, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 428 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 230/230 transitions.
Graph (complete) has 396 edges and 195 vertex of which 194 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
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 194 transition count 229
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 25 place count 194 transition count 229
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 62 place count 194 transition count 229
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 90 place count 194 transition count 241
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 192 transition count 239
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 192 transition count 239
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 112 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 119 place count 192 transition count 289
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 130 place count 181 transition count 267
Deduced a syphon composed of 112 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 141 place count 181 transition count 267
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 174 place count 148 transition count 212
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 207 place count 148 transition count 212
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 240 place count 115 transition count 157
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 273 place count 115 transition count 157
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 284 place count 104 transition count 146
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 295 place count 104 transition count 146
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 317 place count 82 transition count 113
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 339 place count 82 transition count 113
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 381 place count 40 transition count 49
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 423 place count 40 transition count 49
Deduced a syphon composed of 25 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 425 place count 40 transition count 47
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 425 rules in 55 ms. Remains 40 /195 variables (removed 155) and now considering 47/230 (removed 183) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:10:05] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2025-06-03 09:10:05] [INFO ] Flow matrix only has 46 transitions (discarded 1 similar events)
// Phase 1: matrix 46 rows 40 cols
[2025-06-03 09:10:05] [INFO ] Computed 2 invariants in 1 ms
[2025-06-03 09:10:05] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:10:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 4 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:10:06] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 43 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 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 TDEAD13 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 TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 46/86 variables, 40/44 constraints. Problems are: Problem set: 31 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 5/49 constraints. Problems are: Problem set: 31 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/49 constraints. Problems are: Problem set: 31 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/49 constraints. Problems are: Problem set: 31 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 49 constraints, problems are : Problem set: 31 solved, 15 unsolved in 925 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 4/18 variables, 2/2 constraints. Problems are: Problem set: 31 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 2/4 constraints. Problems are: Problem set: 31 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 31 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 45/63 variables, 18/22 constraints. Problems are: Problem set: 31 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 5/27 constraints. Problems are: Problem set: 31 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 15/42 constraints. Problems are: Problem set: 31 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/42 constraints. Problems are: Problem set: 31 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 23/86 variables, 22/64 constraints. Problems are: Problem set: 31 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/64 constraints. Problems are: Problem set: 31 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/86 variables, 0/64 constraints. Problems are: Problem set: 31 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 64 constraints, problems are : Problem set: 31 solved, 15 unsolved in 671 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/46 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1608ms problems are : Problem set: 31 solved, 15 unsolved
Search for dead transitions found 31 dead transitions in 1608ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 40/195 places, 16/230 transitions.
Graph (complete) has 37 edges and 40 vertex of which 15 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 15 /40 variables (removed 25) and now considering 16/16 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/195 places, 16/230 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1674 ms. Remains : 15/195 places, 16/230 transitions.
Built C files in :
/tmp/ltsmin11569892493681008602
[2025-06-03 09:10:07] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11569892493681008602
Running compilation step : cd /tmp/ltsmin11569892493681008602;'/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 916 ms.
Running link step : cd /tmp/ltsmin11569892493681008602;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin11569892493681008602;'/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/stateBased18139326162998726515.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 195 /195 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 195 cols
[2025-06-03 09:10:22] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:10:22] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-03 09:10:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:10:23] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2025-06-03 09:10: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/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/425 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:10:31] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:10:31] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:10:32] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:10:32] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:10:32] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:10:32] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:10:32] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:10:32] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:10:32] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:10:32] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:10:33] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:10:33] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 209 constraints, problems are : Problem set: 0 solved, 229 unsolved in 25756 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/425 variables, 195/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 229/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 438 constraints, problems are : Problem set: 0 solved, 229 unsolved in 29817 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55625ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 55626ms
Finished structural reductions in LTL mode , in 1 iterations and 56068 ms. Remains : 195/195 places, 230/230 transitions.
Built C files in :
/tmp/ltsmin10320426056229331480
[2025-06-03 09:11:18] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10320426056229331480
Running compilation step : cd /tmp/ltsmin10320426056229331480;'/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 752 ms.
Running link step : cd /tmp/ltsmin10320426056229331480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin10320426056229331480;'/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/stateBased11144462924914176872.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 09:11:33] [INFO ] Flatten gal took : 16 ms
[2025-06-03 09:11:33] [INFO ] Flatten gal took : 15 ms
[2025-06-03 09:11:33] [INFO ] Time to serialize gal into /tmp/LTL13749085954425911537.gal : 6 ms
[2025-06-03 09:11:33] [INFO ] Time to serialize properties into /tmp/LTL8901144171318809354.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13749085954425911537.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5374277455529973523.hoa' '-atoms' '/tmp/LTL8901144171318809354.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8901144171318809354.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5374277455529973523.hoa
Detected timeout of ITS tools.
[2025-06-03 09:11:49] [INFO ] Flatten gal took : 14 ms
[2025-06-03 09:11:49] [INFO ] Flatten gal took : 13 ms
[2025-06-03 09:11:49] [INFO ] Time to serialize gal into /tmp/LTL11659758567053528527.gal : 3 ms
[2025-06-03 09:11:49] [INFO ] Time to serialize properties into /tmp/LTL11775502100520509773.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11659758567053528527.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11775502100520509773.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G((X((G("((p38==0)||(p343==0))"))||(X("(p0==0)"))))||(G("(p332==1)"))))))))
Formula 0 simplified : XXXF(X(F!"((p38==0)||(p343==0))" & X!"(p0==0)") & F!"(p332==1)")
Detected timeout of ITS tools.
[2025-06-03 09:12:04] [INFO ] Flatten gal took : 13 ms
[2025-06-03 09:12:04] [INFO ] Applying decomposition
[2025-06-03 09:12:04] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10922779581952259299.txt' '-o' '/tmp/graph10922779581952259299.bin' '-w' '/tmp/graph10922779581952259299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10922779581952259299.bin' '-l' '-1' '-v' '-w' '/tmp/graph10922779581952259299.weights' '-q' '0' '-e' '0.001'
[2025-06-03 09:12:04] [INFO ] Decomposing Gal with order
[2025-06-03 09:12:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:12:04] [INFO ] Removed a total of 93 redundant transitions.
[2025-06-03 09:12:04] [INFO ] Flatten gal took : 166 ms
[2025-06-03 09:12:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 16 ms.
[2025-06-03 09:12:04] [INFO ] Time to serialize gal into /tmp/LTL607829474925112006.gal : 13 ms
[2025-06-03 09:12:04] [INFO ] Time to serialize properties into /tmp/LTL2583208226555490768.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL607829474925112006.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2583208226555490768.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G((X((G("((i2.i1.u6.p38==0)||(u68.p343==0))"))||(X("(i18.i1.u0.p0==0)"))))||(G("(i20.u64.p332==1)"))))))))
Formula 0 simplified : XXXF(X(F!"((i2.i1.u6.p38==0)||(u68.p343==0))" & X!"(i18.i1.u0.p0==0)") & F!"(i20.u64.p332==1)")
Detected timeout of ITS tools.
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-09 finished in 251003 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((p0&&G(p1)))))'
Support contains 3 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 212 transition count 249
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 212 transition count 249
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 206 transition count 243
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 206 transition count 243
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 201 transition count 237
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 201 transition count 237
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 199 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 199 transition count 234
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 197 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 197 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 196 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 196 transition count 231
Applied a total of 48 rules in 26 ms. Remains 196 /220 variables (removed 24) and now considering 231/260 (removed 29) transitions.
// Phase 1: matrix 231 rows 196 cols
[2025-06-03 09:12:19] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:12:19] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-03 09:12:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:12:20] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2025-06-03 09:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 231/427 variables, 196/198 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:12:30] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:12:30] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:12:31] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:12:31] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:12:31] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:12:31] [INFO ] Deduced a trap composed of 12 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 09:12:31] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:12:31] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:12:32] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:12:32] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:12:32] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:12:32] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 12/210 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 0/427 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 210 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 231/427 variables, 196/210 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 230/440 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 0/427 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 440 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in LTL mode, iteration 1 : 196/220 places, 231/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60421 ms. Remains : 196/220 places, 231/260 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-10 finished in 60630 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(F((p0 U (G(p0)||(p0&&(!p1||X(!p1))))))))'
Support contains 3 out of 220 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Graph (complete) has 441 edges and 220 vertex of which 218 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 217 transition count 227
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 187 transition count 227
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 61 place count 187 transition count 189
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 137 place count 149 transition count 189
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 143 transition count 180
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 143 transition count 180
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 154 place count 138 transition count 175
Iterating global reduction 2 with 5 rules applied. Total rules applied 159 place count 138 transition count 175
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 136 transition count 171
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 136 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 165 place count 134 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 134 transition count 169
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 269 place count 83 transition count 118
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 280 place count 72 transition count 96
Iterating global reduction 2 with 11 rules applied. Total rules applied 291 place count 72 transition count 96
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 302 place count 61 transition count 85
Iterating global reduction 2 with 11 rules applied. Total rules applied 313 place count 61 transition count 85
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 323 place count 51 transition count 65
Iterating global reduction 2 with 10 rules applied. Total rules applied 333 place count 51 transition count 65
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 343 place count 41 transition count 55
Iterating global reduction 2 with 10 rules applied. Total rules applied 353 place count 41 transition count 55
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 363 place count 31 transition count 35
Iterating global reduction 2 with 10 rules applied. Total rules applied 373 place count 31 transition count 35
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 383 place count 21 transition count 25
Iterating global reduction 2 with 10 rules applied. Total rules applied 393 place count 21 transition count 25
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 394 place count 21 transition count 24
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 395 place count 21 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 397 place count 19 transition count 22
Reduce places removed 1 places and 0 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 2 rules applied. Total rules applied 399 place count 18 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 400 place count 17 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 400 place count 17 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 406 place count 14 transition count 18
Applied a total of 406 rules in 43 ms. Remains 14 /220 variables (removed 206) and now considering 18/260 (removed 242) transitions.
[2025-06-03 09:13:20] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
// Phase 1: matrix 16 rows 14 cols
[2025-06-03 09:13:20] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:13:20] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-03 09:13:20] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
[2025-06-03 09:13:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:13:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 09:13:20] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:13:20] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-03 09:13:20] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
[2025-06-03 09:13:20] [INFO ] Invariant cache hit.
[2025-06-03 09:13:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 16/29 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 1/30 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 16 constraints, problems are : Problem set: 0 solved, 16 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 16/29 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/30 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 32 constraints, problems are : Problem set: 0 solved, 16 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1099ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 1099ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/220 places, 18/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1250 ms. Remains : 14/220 places, 18/260 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-11
Product exploration explored 100000 steps with 997 reset in 197 ms.
Stack based approach found an accepted trace after 1025 steps with 11 reset with depth 24 and stack size 20 in 3 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-11 finished in 1628 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)))'
Support contains 2 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 211 transition count 248
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 211 transition count 248
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 205 transition count 242
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 205 transition count 242
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 200 transition count 236
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 200 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 198 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 198 transition count 233
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 196 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 196 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 195 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 195 transition count 230
Applied a total of 50 rules in 32 ms. Remains 195 /220 variables (removed 25) and now considering 230/260 (removed 30) transitions.
// Phase 1: matrix 230 rows 195 cols
[2025-06-03 09:13:21] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:13:22] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-03 09:13:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:13:22] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2025-06-03 09:13:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/425 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:13:33] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:13:33] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:13:33] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:13:33] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:13:34] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:13:34] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:13:34] [INFO ] Deduced a trap composed of 13 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 09:13:34] [INFO ] Deduced a trap composed of 14 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 09:13:34] [INFO ] Deduced a trap composed of 15 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 09:13:34] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:13:35] [INFO ] Deduced a trap composed of 17 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 09:13:35] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 209 constraints, problems are : Problem set: 0 solved, 229 unsolved in 27095 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/425 variables, 195/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 229/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 438 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57162ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 57163ms
Starting structural reductions in LTL mode, iteration 1 : 195/220 places, 230/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57710 ms. Remains : 195/220 places, 230/260 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 165 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-12 finished in 57826 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 U !p1))))'
Support contains 3 out of 220 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Graph (complete) has 441 edges and 220 vertex of which 218 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 217 transition count 227
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 187 transition count 227
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 61 place count 187 transition count 189
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 137 place count 149 transition count 189
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 142 place count 144 transition count 181
Iterating global reduction 2 with 5 rules applied. Total rules applied 147 place count 144 transition count 181
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 151 place count 140 transition count 177
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 140 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 156 place count 139 transition count 175
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 139 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 138 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 138 transition count 174
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 263 place count 86 transition count 122
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 273 place count 76 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 283 place count 76 transition count 102
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 293 place count 66 transition count 92
Iterating global reduction 2 with 10 rules applied. Total rules applied 303 place count 66 transition count 92
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 313 place count 56 transition count 72
Iterating global reduction 2 with 10 rules applied. Total rules applied 323 place count 56 transition count 72
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 333 place count 46 transition count 62
Iterating global reduction 2 with 10 rules applied. Total rules applied 343 place count 46 transition count 62
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 352 place count 37 transition count 44
Iterating global reduction 2 with 9 rules applied. Total rules applied 361 place count 37 transition count 44
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 370 place count 28 transition count 35
Iterating global reduction 2 with 9 rules applied. Total rules applied 379 place count 28 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 381 place count 28 transition count 33
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 382 place count 28 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 384 place count 26 transition count 31
Reduce places removed 1 places and 0 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 3 rules applied. Total rules applied 387 place count 25 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 389 place count 23 transition count 29
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 389 place count 23 transition count 25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 397 place count 19 transition count 25
Applied a total of 397 rules in 44 ms. Remains 19 /220 variables (removed 201) and now considering 25/260 (removed 235) transitions.
[2025-06-03 09:14:19] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 19 cols
[2025-06-03 09:14:19] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:14:19] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-03 09:14:19] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2025-06-03 09:14:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:14:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 09:14:19] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:14:19] [INFO ] Redundant transitions in 1 ms returned []
Running 24 sub problems to find dead transitions.
[2025-06-03 09:14:19] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2025-06-03 09:14:19] [INFO ] Invariant cache hit.
[2025-06-03 09:14:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 21 constraints, problems are : Problem set: 0 solved, 24 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 45 constraints, problems are : Problem set: 0 solved, 24 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1370ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1372ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/220 places, 25/260 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1528 ms. Remains : 19/220 places, 25/260 transitions.
Stuttering acceptance computed with spot in 103 ms :[p1, p1]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-13
Product exploration explored 100000 steps with 721 reset in 259 ms.
Stack based approach found an accepted trace after 982 steps with 7 reset with depth 37 and stack size 33 in 3 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-13 finished in 1912 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) U G((!p0||G(!p1)))))))'
Support contains 3 out of 220 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 220/220 places, 260/260 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 211 transition count 248
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 211 transition count 248
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 205 transition count 242
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 205 transition count 242
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 200 transition count 236
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 200 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 198 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 198 transition count 233
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 196 transition count 231
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 196 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 195 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 195 transition count 230
Applied a total of 50 rules in 33 ms. Remains 195 /220 variables (removed 25) and now considering 230/260 (removed 30) transitions.
// Phase 1: matrix 230 rows 195 cols
[2025-06-03 09:14:21] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:14:21] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-03 09:14:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:14:22] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2025-06-03 09:14:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (OVERLAPS) 230/425 variables, 195/197 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:33] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:33] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:33] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:33] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:33] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:33] [INFO ] Deduced a trap composed of 12 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 09:14:34] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:34] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:34] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:34] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:34] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:35] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 12/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/425 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 209 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 230/425 variables, 195/209 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 229/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 438 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 195/220 places, 230/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60659 ms. Remains : 195/220 places, 230/260 transitions.
Stuttering acceptance computed with spot in 346 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (NOT p0), false, (AND p0 p1), (AND p1 (NOT p0)), true, (AND p1 p0), p1]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 220 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-14 finished in 61041 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((X((G(p0)||X(p1)))||G(p2)))))))'
[2025-06-03 09:15:22] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14378959702243926860
[2025-06-03 09:15:23] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2025-06-03 09:15:23] [INFO ] Applying decomposition
[2025-06-03 09:15:23] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 09:15:23] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2025-06-03 09:15:23] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 09:15:23] [INFO ] Flatten gal took : 20 ms
[2025-06-03 09:15:23] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2025-06-03 09:15:23] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14109346769192127595.txt' '-o' '/tmp/graph14109346769192127595.bin' '-w' '/tmp/graph14109346769192127595.weights'
[2025-06-03 09:15:23] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14378959702243926860
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14109346769192127595.bin' '-l' '-1' '-v' '-w' '/tmp/graph14109346769192127595.weights' '-q' '0' '-e' '0.001'
Running compilation step : cd /tmp/ltsmin14378959702243926860;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
[2025-06-03 09:15:23] [INFO ] Decomposing Gal with order
[2025-06-03 09:15:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:15:23] [INFO ] Removed a total of 95 redundant transitions.
[2025-06-03 09:15:23] [INFO ] Flatten gal took : 43 ms
[2025-06-03 09:15:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 7 ms.
[2025-06-03 09:15:23] [INFO ] Time to serialize gal into /tmp/LTLFireability16677874669421321595.gal : 10 ms
[2025-06-03 09:15:23] [INFO ] Time to serialize properties into /tmp/LTLFireability11964365146204913713.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16677874669421321595.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11964365146204913713.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G((X((G("((i3.u12.p38==0)||(u76.p343==0))"))||(X("(i0.i0.u0.p0==0)"))))||(G("(i21.u71.p332==1)"))))))))
Formula 0 simplified : XXXF(X(F!"((i3.u12.p38==0)||(u76.p343==0))" & X!"(i0.i0.u0.p0==0)") & F!"(i21.u71.p332==1)")
Compilation finished in 1031 ms.
Running link step : cd /tmp/ltsmin14378959702243926860;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14378959702243926860;'/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' '--ltl' 'X(X(X([]((X(([]((LTLAPp0==true))||X((LTLAPp1==true))))||[]((LTLAPp2==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: LTL layer: formula: X(X(X([]((X(([]((LTLAPp0==true))||X((LTLAPp1==true))))||[]((LTLAPp2==true)))))))
pins2lts-mc-linux64( 6/ 8), 0.012: "X(X(X([]((X(([]((LTLAPp0==true))||X((LTLAPp1==true))))||[]((LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.012: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.041: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.123: DFS-FIFO for weak LTL, using special progress label 264
pins2lts-mc-linux64( 0/ 8), 0.123: There are 265 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.123: State length is 221, there are 318 groups
pins2lts-mc-linux64( 0/ 8), 0.123: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.123: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.123: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.123: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.186: ~1 levels ~960 states ~4000 transitions
pins2lts-mc-linux64( 2/ 8), 0.220: ~1 levels ~1920 states ~11280 transitions
pins2lts-mc-linux64( 2/ 8), 0.276: ~1 levels ~3840 states ~24240 transitions
pins2lts-mc-linux64( 4/ 8), 0.402: ~1 levels ~7680 states ~47336 transitions
pins2lts-mc-linux64( 4/ 8), 0.675: ~1 levels ~15360 states ~107656 transitions
pins2lts-mc-linux64( 2/ 8), 1.156: ~1 levels ~30720 states ~242112 transitions
pins2lts-mc-linux64( 4/ 8), 1.973: ~1 levels ~61440 states ~486704 transitions
pins2lts-mc-linux64( 4/ 8), 3.668: ~1 levels ~122880 states ~997176 transitions
pins2lts-mc-linux64( 4/ 8), 6.475: ~1 levels ~245760 states ~2085800 transitions
pins2lts-mc-linux64( 7/ 8), 10.574: ~1 levels ~491520 states ~4006320 transitions
pins2lts-mc-linux64( 0/ 8), 17.727: ~1 levels ~983040 states ~8612640 transitions
pins2lts-mc-linux64( 7/ 8), 30.805: ~1 levels ~1966080 states ~16882360 transitions
pins2lts-mc-linux64( 7/ 8), 56.637: ~1 levels ~3932160 states ~34483664 transitions
pins2lts-mc-linux64( 7/ 8), 109.451: ~1 levels ~7864320 states ~69992776 transitions
pins2lts-mc-linux64( 7/ 8), 215.203: ~1 levels ~15728640 states ~142371920 transitions
pins2lts-mc-linux64( 7/ 8), 430.405: ~1 levels ~31457280 states ~288792576 transitions
pins2lts-mc-linux64( 0/ 8), 870.993: ~1 levels ~62914560 states ~588953944 transitions
pins2lts-mc-linux64( 4/ 8), 1351.990: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1352.140:
pins2lts-mc-linux64( 0/ 8), 1352.140: mean standard work distribution: 4.5% (states) 2.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 1352.146:
pins2lts-mc-linux64( 0/ 8), 1352.146: Explored 89185514 states 888692025 transitions, fanout: 9.965
pins2lts-mc-linux64( 0/ 8), 1352.146: Total exploration time 1351.980 sec (1351.860 sec minimum, 1351.929 sec on average)
pins2lts-mc-linux64( 0/ 8), 1352.146: States per second: 65967, Transitions per second: 657326
pins2lts-mc-linux64( 0/ 8), 1352.146:
pins2lts-mc-linux64( 0/ 8), 1352.146: Progress states detected: 134217247
pins2lts-mc-linux64( 0/ 8), 1352.146: Redundant explorations: -33.5514
pins2lts-mc-linux64( 0/ 8), 1352.146:
pins2lts-mc-linux64( 0/ 8), 1352.146: Queue width: 8B, total height: 78999134, memory: 602.72MB
pins2lts-mc-linux64( 0/ 8), 1352.146: Tree memory: 1031.1MB, 8.1 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 1352.146: Tree fill ratio (roots/leafs): 99.0%/2.0%
pins2lts-mc-linux64( 0/ 8), 1352.154: Stored 264 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1352.175: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1352.175: Est. total memory use: 1633.8MB (~1626.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14378959702243926860;'/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' '--ltl' 'X(X(X([]((X(([]((LTLAPp0==true))||X((LTLAPp1==true))))||[]((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14378959702243926860;'/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' '--ltl' 'X(X(X([]((X(([]((LTLAPp0==true))||X((LTLAPp1==true))))||[]((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-03 09:39:31] [INFO ] Applying decomposition
[2025-06-03 09:39:31] [INFO ] Flatten gal took : 148 ms
[2025-06-03 09:39:31] [INFO ] Decomposing Gal with order
[2025-06-03 09:39:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 09:39:32] [INFO ] Removed a total of 101 redundant transitions.
[2025-06-03 09:39:32] [INFO ] Flatten gal took : 168 ms
[2025-06-03 09:39:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 612 labels/synchronizations in 1031 ms.
[2025-06-03 09:39:33] [INFO ] Time to serialize gal into /tmp/LTLFireability2873832347700934036.gal : 47 ms
[2025-06-03 09:39:33] [INFO ] Time to serialize properties into /tmp/LTLFireability16548783517544152179.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2873832347700934036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16548783517544152179.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G((X((G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.p38==0)||(i1.u25.p343==0))"))||(X("(u29.p0==0)"))))||(G("(i0.u23.p332==1)")))...160
Formula 0 simplified : XXXF(X(F!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.p38==0)||(i1.u25.p343==0))" & X!"(u29.p0==0)") & F!"(i0.u23.p332==1)")
Reverse transition relation is NOT exact ! Due to transitions t195, t251, t252, i0.t16, i0.t13, i0.u23.t17, i0.u23.t19, i0.i0.t25, i0.i0.t28, i0.i0.u22.t29...1795
Computing Next relation with stutter on 1 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-12b"
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-12b, 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-174854064700716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-12b.tgz
mv DiscoveryGPU-PT-12b execution
cd execution
if [ "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 ;