Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.6K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K 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 46K 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-06b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-06b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748912579477

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-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 01:03:01] [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 01:03:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 01:03:02] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2025-06-03 01:03:02] [INFO ] Transformed 184 places.
[2025-06-03 01:03:02] [INFO ] Transformed 194 transitions.
[2025-06-03 01:03:02] [INFO ] Found NUPN structural information;
[2025-06-03 01:03:02] [INFO ] Parsed PT model containing 184 places and 194 transitions and 503 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 172 transition count 194
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 39 place count 145 transition count 167
Iterating global reduction 1 with 27 rules applied. Total rules applied 66 place count 145 transition count 167
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 141 transition count 163
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 141 transition count 163
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 138 transition count 160
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 138 transition count 160
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 135 transition count 157
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 135 transition count 157
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 88 place count 133 transition count 153
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 133 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 131 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 131 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 130 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 130 transition count 150
Applied a total of 96 rules in 111 ms. Remains 130 /184 variables (removed 54) and now considering 150/194 (removed 44) transitions.
// Phase 1: matrix 150 rows 130 cols
[2025-06-03 01:03:02] [INFO ] Computed 2 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:03:02] [INFO ] Implicit Places using invariants in 379 ms returned []
[2025-06-03 01:03:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:03:03] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2025-06-03 01:03: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/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 150/280 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:08] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:08] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:08] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:08] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:08] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:08] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:08] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:08] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:08] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:08] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:09] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:09] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:09] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 13/145 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 145 constraints, problems are : Problem set: 0 solved, 149 unsolved in 13119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/280 variables, 130/145 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 149/294 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 294 constraints, problems are : Problem set: 0 solved, 149 unsolved in 15039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28282ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 28302ms
Starting structural reductions in LTL mode, iteration 1 : 130/184 places, 150/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29094 ms. Remains : 130/184 places, 150/194 transitions.
Support contains 34 out of 130 places after structural reductions.
[2025-06-03 01:03:31] [INFO ] Flatten gal took : 49 ms
[2025-06-03 01:03:31] [INFO ] Flatten gal took : 22 ms
[2025-06-03 01:03:31] [INFO ] Input system was already deterministic with 150 transitions.
Support contains 30 out of 130 places (down from 34) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (199 resets) in 1495 ms. (26 steps per ms) remains 2/28 properties
BEST_FIRST walk for 40004 steps (41 resets) in 237 ms. (168 steps per ms) remains 1/2 properties
BEST_FIRST walk for 4437 steps (2 resets) in 20 ms. (211 steps per ms) remains 0/1 properties
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 249 edges and 130 vertex of which 126 are kept as prefixes of interest. Removing 4 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((G((p0||X(X(p1))))||(p2&&X(X(G(p2)))))))'
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 150/150 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 120 transition count 139
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 120 transition count 139
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 116 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 116 transition count 135
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 113 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 113 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 111 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 111 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 110 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 110 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 109 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 109 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 108 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 108 transition count 125
Applied a total of 44 rules in 32 ms. Remains 108 /130 variables (removed 22) and now considering 125/150 (removed 25) transitions.
// Phase 1: matrix 125 rows 108 cols
[2025-06-03 01:03:33] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:03:33] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-03 01:03:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:03:33] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-06-03 01:03:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/233 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:36] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:36] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:36] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:36] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:36] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:36] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/233 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 116 constraints, problems are : Problem set: 0 solved, 124 unsolved in 9354 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/233 variables, 108/116 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 124/240 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/233 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 240 constraints, problems are : Problem set: 0 solved, 124 unsolved in 9366 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18789ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 18791ms
Starting structural reductions in LTL mode, iteration 1 : 108/130 places, 125/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19098 ms. Remains : 108/130 places, 125/150 transitions.
Stuttering acceptance computed with spot in 679 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 28421 steps with 165 reset in 382 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-00 finished in 20279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 150/150 transitions.
Graph (complete) has 249 edges and 130 vertex of which 127 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 126 transition count 126
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 106 transition count 126
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 41 place count 106 transition count 107
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 79 place count 87 transition count 107
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 83 transition count 102
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 83 transition count 102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 87 place count 83 transition count 101
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 89 place count 82 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 80 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 80 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 79 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 79 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 78 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 78 transition count 96
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 157 place count 48 transition count 66
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 160 place count 45 transition count 60
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 45 transition count 60
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 166 place count 42 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 169 place count 42 transition count 57
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 172 place count 39 transition count 51
Iterating global reduction 2 with 3 rules applied. Total rules applied 175 place count 39 transition count 51
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 178 place count 36 transition count 48
Iterating global reduction 2 with 3 rules applied. Total rules applied 181 place count 36 transition count 48
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 184 place count 33 transition count 42
Iterating global reduction 2 with 3 rules applied. Total rules applied 187 place count 33 transition count 42
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 190 place count 30 transition count 39
Iterating global reduction 2 with 3 rules applied. Total rules applied 193 place count 30 transition count 39
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 195 place count 30 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 197 place count 28 transition count 35
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 30 edges and 26 vertex of which 23 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 11 rules applied. Total rules applied 208 place count 23 transition count 24
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 216 place count 15 transition count 24
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 222 place count 12 transition count 21
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 223 place count 12 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 226 place count 9 transition count 17
Applied a total of 226 rules in 94 ms. Remains 9 /130 variables (removed 121) and now considering 17/150 (removed 133) transitions.
[2025-06-03 01:03:53] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 9 cols
[2025-06-03 01:03:53] [INFO ] Computed 0 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:03:53] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 01:03:53] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2025-06-03 01:03:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:03:53] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:03:53] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-03 01:03:53] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2025-06-03 01:03:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 5/21 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/22 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 146 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 5/21 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/22 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 125 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 278ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 278ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/130 places, 17/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 438 ms. Remains : 9/130 places, 17/150 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-01 finished in 490 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(p0)||(X(X(X(p1)))&&F(p2))))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 150/150 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 119 transition count 138
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 119 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 115 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 112 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 112 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 110 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 110 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 108 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 106 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 105 transition count 122
Applied a total of 50 rules in 43 ms. Remains 105 /130 variables (removed 25) and now considering 122/150 (removed 28) transitions.
// Phase 1: matrix 122 rows 105 cols
[2025-06-03 01:03:53] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:03:53] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-03 01:03:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:03:54] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-06-03 01:03:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/227 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:56] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:57] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:57] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:57] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:57] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:57] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 113 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8417 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/227 variables, 105/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 121/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 234 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7535 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15990ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 15993ms
Starting structural reductions in LTL mode, iteration 1 : 105/130 places, 122/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16265 ms. Remains : 105/130 places, 122/150 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p1), true, (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-02
Stuttering criterion allowed to conclude after 320 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-02 finished in 16551 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 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 150/150 transitions.
Graph (complete) has 249 edges and 130 vertex of which 126 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 125 transition count 126
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 106 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 105 transition count 125
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 41 place count 105 transition count 106
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 79 place count 86 transition count 106
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 84 place count 81 transition count 100
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 81 transition count 100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 89 place count 81 transition count 99
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 80 transition count 99
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 94 place count 77 transition count 96
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 77 transition count 96
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 75 transition count 92
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 75 transition count 92
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 73 transition count 90
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 73 transition count 90
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 163 place count 44 transition count 61
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 167 place count 40 transition count 53
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 40 transition count 53
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 175 place count 36 transition count 49
Iterating global reduction 3 with 4 rules applied. Total rules applied 179 place count 36 transition count 49
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 183 place count 32 transition count 41
Iterating global reduction 3 with 4 rules applied. Total rules applied 187 place count 32 transition count 41
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 191 place count 28 transition count 37
Iterating global reduction 3 with 4 rules applied. Total rules applied 195 place count 28 transition count 37
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 199 place count 24 transition count 29
Iterating global reduction 3 with 4 rules applied. Total rules applied 203 place count 24 transition count 29
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 207 place count 20 transition count 25
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 20 transition count 25
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 212 place count 20 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 214 place count 18 transition count 22
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 19 edges and 16 vertex of which 13 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 221 place count 13 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 225 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 232 place count 5 transition count 10
Applied a total of 232 rules in 35 ms. Remains 5 /130 variables (removed 125) and now considering 10/150 (removed 140) transitions.
[2025-06-03 01:04:10] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2025-06-03 01:04:10] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:04:10] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-03 01:04:10] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2025-06-03 01:04:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:04:10] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:04:10] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-03 01:04:10] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2025-06-03 01:04:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 88 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 91 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 183ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/130 places, 10/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 282 ms. Remains : 5/130 places, 10/150 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-03 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U X(p1)) U X((p2||X(p2)))))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 150/150 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 120 transition count 139
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 120 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 117 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 117 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 115 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 115 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 114 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 114 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 113 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 113 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 112 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 112 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 111 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 111 transition count 129
Applied a total of 38 rules in 10 ms. Remains 111 /130 variables (removed 19) and now considering 129/150 (removed 21) transitions.
// Phase 1: matrix 129 rows 111 cols
[2025-06-03 01:04:10] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:04:10] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-03 01:04:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:04:11] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2025-06-03 01:04:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 129/240 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:13] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:14] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:14] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:14] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:14] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:14] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/240 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 119 constraints, problems are : Problem set: 0 solved, 128 unsolved in 8279 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/240 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 128/247 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 247 constraints, problems are : Problem set: 0 solved, 128 unsolved in 7575 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15879ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 15879ms
Starting structural reductions in LTL mode, iteration 1 : 111/130 places, 129/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16172 ms. Remains : 111/130 places, 129/150 transitions.
Stuttering acceptance computed with spot in 534 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-04 finished in 16750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(((X(!p2) U ((p3&&X(!p2))||X(G(!p2))))||p1))))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 150/150 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 119 transition count 138
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 119 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 115 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 112 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 112 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 110 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 110 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 108 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 106 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 105 transition count 122
Applied a total of 50 rules in 16 ms. Remains 105 /130 variables (removed 25) and now considering 122/150 (removed 28) transitions.
// Phase 1: matrix 122 rows 105 cols
[2025-06-03 01:04:27] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:04:27] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-03 01:04:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:04:27] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-06-03 01:04:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/227 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:30] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:30] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:30] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:31] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:31] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:31] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 113 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/227 variables, 105/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 121/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 234 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8183 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15344ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 15345ms
Starting structural reductions in LTL mode, iteration 1 : 105/130 places, 122/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15623 ms. Remains : 105/130 places, 122/150 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2), false]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-05
Product exploration explored 100000 steps with 1155 reset in 240 ms.
Stack based approach found an accepted trace after 377 steps with 2 reset with depth 61 and stack size 61 in 2 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-05 finished in 16175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 150/150 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 119 transition count 138
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 119 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 115 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 112 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 112 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 110 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 110 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 108 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 106 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 105 transition count 122
Applied a total of 50 rules in 15 ms. Remains 105 /130 variables (removed 25) and now considering 122/150 (removed 28) transitions.
[2025-06-03 01:04:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:04:43] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-03 01:04:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:04:43] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-06-03 01:04:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/227 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:47] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:47] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:47] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:47] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:47] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:48] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 113 constraints, problems are : Problem set: 0 solved, 121 unsolved in 9132 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/227 variables, 105/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 121/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 234 constraints, problems are : Problem set: 0 solved, 121 unsolved in 6858 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16026ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 16027ms
Starting structural reductions in LTL mode, iteration 1 : 105/130 places, 122/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16295 ms. Remains : 105/130 places, 122/150 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-08 finished in 16454 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(F(p0))))'
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 150/150 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 119 transition count 138
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 119 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 115 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 112 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 112 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 110 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 110 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 108 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 106 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 105 transition count 122
Applied a total of 50 rules in 18 ms. Remains 105 /130 variables (removed 25) and now considering 122/150 (removed 28) transitions.
[2025-06-03 01:05:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:05:00] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-03 01:05:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:05:00] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-06-03 01:05:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/227 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:03] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:03] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:03] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:03] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:03] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:03] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 113 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7648 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/227 variables, 105/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 121/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 234 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8086 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15757ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 15758ms
Starting structural reductions in LTL mode, iteration 1 : 105/130 places, 122/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16047 ms. Remains : 105/130 places, 122/150 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 65 ms.
Product exploration explored 100000 steps with 33333 reset in 165 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 210 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 38 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-09 finished in 16447 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 (F(p1)&&X(p0))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 150/150 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 120 transition count 139
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 120 transition count 139
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 116 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 116 transition count 135
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 113 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 113 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 111 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 111 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 109 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 109 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 107 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 106 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 106 transition count 123
Applied a total of 48 rules in 13 ms. Remains 106 /130 variables (removed 24) and now considering 123/150 (removed 27) transitions.
// Phase 1: matrix 123 rows 106 cols
[2025-06-03 01:05:16] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:05:16] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-03 01:05:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:05:16] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2025-06-03 01:05:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/229 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:19] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:19] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:20] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:20] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:20] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:20] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:20] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:20] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:20] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:20] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:20] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:20] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/229 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 120 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8351 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/229 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 122/242 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 242 constraints, problems are : Problem set: 0 solved, 122 unsolved in 9063 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17431ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 17431ms
Starting structural reductions in LTL mode, iteration 1 : 106/130 places, 123/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17680 ms. Remains : 106/130 places, 123/150 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-10
Stuttering criterion allowed to conclude after 195 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-10 finished in 17903 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)&&F(G((p0 U p1))))))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 150/150 transitions.
Graph (complete) has 249 edges and 130 vertex of which 126 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 125 transition count 127
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 107 transition count 127
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 37 place count 107 transition count 108
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 75 place count 88 transition count 108
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 80 place count 83 transition count 102
Iterating global reduction 2 with 5 rules applied. Total rules applied 85 place count 83 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 80 transition count 99
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 80 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 78 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 78 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 76 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 76 transition count 93
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 157 place count 47 transition count 64
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 161 place count 43 transition count 56
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 43 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 169 place count 39 transition count 52
Iterating global reduction 2 with 4 rules applied. Total rules applied 173 place count 39 transition count 52
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 35 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 35 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 185 place count 31 transition count 40
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 31 transition count 40
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 192 place count 28 transition count 34
Iterating global reduction 2 with 3 rules applied. Total rules applied 195 place count 28 transition count 34
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 198 place count 25 transition count 31
Iterating global reduction 2 with 3 rules applied. Total rules applied 201 place count 25 transition count 31
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 202 place count 25 transition count 30
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 203 place count 25 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 205 place count 23 transition count 28
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 207 place count 22 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 21 transition count 27
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 208 place count 21 transition count 24
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 214 place count 18 transition count 24
Applied a total of 214 rules in 45 ms. Remains 18 /130 variables (removed 112) and now considering 24/150 (removed 126) transitions.
[2025-06-03 01:05:34] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 18 cols
[2025-06-03 01:05:34] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:05:34] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-03 01:05:34] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
[2025-06-03 01:05:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:05:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 01:05:34] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:05:34] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2025-06-03 01:05:34] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
[2025-06-03 01:05:34] [INFO ] Invariant cache hit.
[2025-06-03 01:05:34] [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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 22/40 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 20 constraints, problems are : Problem set: 0 solved, 23 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 22/40 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 43 constraints, problems are : Problem set: 0 solved, 23 unsolved in 713 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1279ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 1279ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/130 places, 24/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1443 ms. Remains : 18/130 places, 24/150 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-11
Stuttering criterion allowed to conclude after 120 steps with 2 reset in 3 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-11 finished in 1688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 150/150 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 119 transition count 138
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 119 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 115 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 112 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 112 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 110 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 110 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 108 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 106 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 105 transition count 122
Applied a total of 50 rules in 15 ms. Remains 105 /130 variables (removed 25) and now considering 122/150 (removed 28) transitions.
// Phase 1: matrix 122 rows 105 cols
[2025-06-03 01:05:36] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:05:36] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-03 01:05:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:05:36] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-06-03 01:05:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/227 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:39] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:39] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:39] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:39] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:39] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:40] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 113 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8269 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/227 variables, 105/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 121/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 234 constraints, problems are : Problem set: 0 solved, 121 unsolved in 9451 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17734ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 17734ms
Starting structural reductions in LTL mode, iteration 1 : 105/130 places, 122/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18006 ms. Remains : 105/130 places, 122/150 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-12
Stuttering criterion allowed to conclude after 202 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-12 finished in 18097 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) U X(X(p1))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 150/150 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 121 transition count 140
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 121 transition count 140
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 117 transition count 136
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 117 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 114 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 114 transition count 133
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 112 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 112 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 110 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 110 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 108 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 107 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 107 transition count 124
Applied a total of 46 rules in 13 ms. Remains 107 /130 variables (removed 23) and now considering 124/150 (removed 26) transitions.
// Phase 1: matrix 124 rows 107 cols
[2025-06-03 01:05:54] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:05:54] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-03 01:05:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:05:54] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2025-06-03 01:05:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/231 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:58] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:58] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:58] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:58] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:58] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:58] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/231 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 115 constraints, problems are : Problem set: 0 solved, 123 unsolved in 8655 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/231 variables, 107/115 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 123/238 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 238 constraints, problems are : Problem set: 0 solved, 123 unsolved in 9481 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18156ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 18157ms
Starting structural reductions in LTL mode, iteration 1 : 107/130 places, 124/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18438 ms. Remains : 107/130 places, 124/150 transitions.
Stuttering acceptance computed with spot in 310 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-13
Product exploration explored 100000 steps with 2519 reset in 259 ms.
Stack based approach found an accepted trace after 606 steps with 15 reset with depth 32 and stack size 32 in 2 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-13 finished in 19032 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 p1) U X(X((p2||F(G(!p3)))))))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 150/150 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 120 transition count 140
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 120 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 117 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 117 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 115 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 115 transition count 135
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 113 transition count 132
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 113 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 111 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 111 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 109 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 109 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 108 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 108 transition count 126
Applied a total of 44 rules in 18 ms. Remains 108 /130 variables (removed 22) and now considering 126/150 (removed 24) transitions.
// Phase 1: matrix 126 rows 108 cols
[2025-06-03 01:06:13] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:06:13] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-03 01:06:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:06:13] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2025-06-03 01:06:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 126/234 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:16] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:16] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:16] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:16] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:17] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:17] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/234 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 116 constraints, problems are : Problem set: 0 solved, 125 unsolved in 8950 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/234 variables, 108/116 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 125/241 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 241 constraints, problems are : Problem set: 0 solved, 125 unsolved in 9316 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18297ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 18299ms
Starting structural reductions in LTL mode, iteration 1 : 108/130 places, 126/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18631 ms. Remains : 108/130 places, 126/150 transitions.
Stuttering acceptance computed with spot in 561 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), p3, (AND (NOT p1) (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p1) p3)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 123 ms.
Product exploration explored 100000 steps with 33333 reset in 208 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 216 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Detected a total of 20/108 stabilizing places and 20/126 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p3)), (X (AND (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p3))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2) p3) (AND p0 (NOT p2) p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 26 ms. Reduced automaton from 11 states, 24 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-14 finished in 19600 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((p1||X(F(p2))))))'
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 150/150 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 119 transition count 138
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 119 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 115 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 112 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 112 transition count 131
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 110 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 110 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 108 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 106 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 105 transition count 122
Applied a total of 50 rules in 11 ms. Remains 105 /130 variables (removed 25) and now considering 122/150 (removed 28) transitions.
// Phase 1: matrix 122 rows 105 cols
[2025-06-03 01:06:32] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:06:32] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-03 01:06:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:06:33] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-06-03 01:06:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/227 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:36] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:36] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:36] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:36] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:37] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:37] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 113 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8907 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/227 variables, 105/113 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 121/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 234 constraints, problems are : Problem set: 0 solved, 121 unsolved in 6051 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14979ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 14979ms
Starting structural reductions in LTL mode, iteration 1 : 105/130 places, 122/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15268 ms. Remains : 105/130 places, 122/150 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 210 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Detected a total of 20/105 stabilizing places and 20/122 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-15 finished in 15904 ms.
All properties solved by simple procedures.
Total runtime 226865 ms.

BK_STOP 1748912808831

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

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