Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028400428.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 CO4-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028400428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 98K 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 CO4-PT-07-LTLFireability-00
FORMULA_NAME CO4-PT-07-LTLFireability-01
FORMULA_NAME CO4-PT-07-LTLFireability-02
FORMULA_NAME CO4-PT-07-LTLFireability-03
FORMULA_NAME CO4-PT-07-LTLFireability-04
FORMULA_NAME CO4-PT-07-LTLFireability-05
FORMULA_NAME CO4-PT-07-LTLFireability-06
FORMULA_NAME CO4-PT-07-LTLFireability-07
FORMULA_NAME CO4-PT-07-LTLFireability-08
FORMULA_NAME CO4-PT-07-LTLFireability-09
FORMULA_NAME CO4-PT-07-LTLFireability-10
FORMULA_NAME CO4-PT-07-LTLFireability-11
FORMULA_NAME CO4-PT-07-LTLFireability-12
FORMULA_NAME CO4-PT-07-LTLFireability-13
FORMULA_NAME CO4-PT-07-LTLFireability-14
FORMULA_NAME CO4-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748605785446

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 11:49:46] [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-05-30 11:49:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:49:46] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2025-05-30 11:49:46] [INFO ] Transformed 384 places.
[2025-05-30 11:49:46] [INFO ] Transformed 456 transitions.
[2025-05-30 11:49:46] [INFO ] Found NUPN structural information;
[2025-05-30 11:49:46] [INFO ] Parsed PT model containing 384 places and 456 transitions and 1022 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 100 places in 6 ms
Reduce places removed 100 places and 120 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA CO4-PT-07-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 336/336 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 274 transition count 335
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 69 place count 216 transition count 275
Iterating global reduction 1 with 58 rules applied. Total rules applied 127 place count 216 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 131 place count 216 transition count 271
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 156 place count 191 transition count 246
Iterating global reduction 2 with 25 rules applied. Total rules applied 181 place count 191 transition count 246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 185 place count 187 transition count 241
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 187 transition count 241
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 190 place count 186 transition count 240
Iterating global reduction 2 with 1 rules applied. Total rules applied 191 place count 186 transition count 240
Applied a total of 191 rules in 100 ms. Remains 186 /284 variables (removed 98) and now considering 240/336 (removed 96) transitions.
// Phase 1: matrix 240 rows 186 cols
[2025-05-30 11:49:47] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:49:47] [INFO ] Implicit Places using invariants in 233 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 268 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/284 places, 240/336 transitions.
Applied a total of 0 rules in 5 ms. Remains 185 /185 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 387 ms. Remains : 185/284 places, 240/336 transitions.
Support contains 18 out of 185 places after structural reductions.
[2025-05-30 11:49:47] [INFO ] Flatten gal took : 52 ms
[2025-05-30 11:49:47] [INFO ] Flatten gal took : 24 ms
[2025-05-30 11:49:47] [INFO ] Input system was already deterministic with 240 transitions.
RANDOM walk for 40000 steps (29 resets) in 1038 ms. (38 steps per ms) remains 13/16 properties
BEST_FIRST walk for 40000 steps (24 resets) in 367 ms. (108 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40000 steps (97 resets) in 459 ms. (86 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40000 steps (63 resets) in 284 ms. (140 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40000 steps (72 resets) in 461 ms. (86 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (50 resets) in 191 ms. (208 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (87 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (63 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (33 resets) in 174 ms. (228 steps per ms) remains 8/8 properties
// Phase 1: matrix 240 rows 185 cols
[2025-05-30 11:49:48] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 10/28 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 45/73 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 92/165 variables, 25/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 143/308 variables, 66/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 89/397 variables, 51/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 19/416 variables, 10/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 9/425 variables, 5/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/425 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/425 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 188 constraints, problems are : Problem set: 0 solved, 8 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 10/28 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 45/73 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 92/165 variables, 25/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 143/308 variables, 66/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 89/397 variables, 51/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 19/416 variables, 10/191 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 9/425 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/425 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 196 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1279 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2040ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 5 properties in 186 ms.
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 240/240 transitions.
Graph (trivial) has 189 edges and 185 vertex of which 2 / 185 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 309 edges and 184 vertex of which 170 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 170 transition count 153
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 137 place count 108 transition count 153
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 137 place count 108 transition count 135
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 173 place count 90 transition count 135
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 86 transition count 131
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 86 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 86 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 85 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 85 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 185 place count 85 transition count 128
Performed 30 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 245 place count 55 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 248 place count 55 transition count 87
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 250 place count 53 transition count 85
Iterating global reduction 5 with 2 rules applied. Total rules applied 252 place count 53 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 254 place count 52 transition count 84
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 278 place count 40 transition count 85
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 286 place count 40 transition count 77
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 297 place count 29 transition count 55
Iterating global reduction 6 with 11 rules applied. Total rules applied 308 place count 29 transition count 55
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 316 place count 29 transition count 47
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 319 place count 26 transition count 38
Iterating global reduction 7 with 3 rules applied. Total rules applied 322 place count 26 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 324 place count 26 transition count 36
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 331 place count 26 transition count 29
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 339 place count 19 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 340 place count 19 transition count 27
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 341 place count 19 transition count 27
Graph (complete) has 50 edges and 19 vertex of which 18 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 1 rules applied. Total rules applied 342 place count 18 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 343 place count 18 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 344 place count 18 transition count 26
Graph (complete) has 47 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 1 rules applied. Total rules applied 345 place count 17 transition count 26
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 346 place count 17 transition count 25
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 347 place count 17 transition count 25
Graph (complete) has 44 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 348 place count 16 transition count 25
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 349 place count 16 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 350 place count 15 transition count 23
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t57.t219.t54 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 352 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 355 place count 12 transition count 18
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 357 place count 10 transition count 16
Iterating global reduction 16 with 2 rules applied. Total rules applied 359 place count 10 transition count 16
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 361 place count 10 transition count 14
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 362 place count 9 transition count 13
Iterating global reduction 17 with 1 rules applied. Total rules applied 363 place count 9 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 364 place count 9 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 365 place count 9 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 366 place count 8 transition count 11
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 367 place count 8 transition count 11
Applied a total of 367 rules in 45 ms. Remains 8 /185 variables (removed 177) and now considering 11/240 (removed 229) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 8/185 places, 11/240 transitions.
RANDOM walk for 44 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/3 properties
FORMULA CO4-PT-07-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 311 edges and 185 vertex of which 182 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U (p1&&X((p1 U (X(p2)||G(p1)))))))))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 177 transition count 232
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 177 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 177 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 175 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 175 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 174 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 174 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 173 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 173 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 173 transition count 225
Applied a total of 26 rules in 17 ms. Remains 173 /185 variables (removed 12) and now considering 225/240 (removed 15) transitions.
// Phase 1: matrix 225 rows 173 cols
[2025-05-30 11:49:51] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:49:51] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-30 11:49:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:49:51] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2025-05-30 11:49:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 225/398 variables, 173/176 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:49:56] [INFO ] Deduced a trap composed of 12 places in 753 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:49:56] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 0/398 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 178 constraints, problems are : Problem set: 0 solved, 224 unsolved in 15524 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/398 variables, 173/178 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 224/402 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:12] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 0/398 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 403 constraints, problems are : Problem set: 0 solved, 224 unsolved in 27984 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43563ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 43565ms
Starting structural reductions in LTL mode, iteration 1 : 173/185 places, 225/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43756 ms. Remains : 173/185 places, 225/240 transitions.
Stuttering acceptance computed with spot in 586 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-07-LTLFireability-00
Product exploration explored 100000 steps with 20000 reset in 195 ms.
Product exploration explored 100000 steps with 20000 reset in 121 ms.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 292 edges and 173 vertex of which 170 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 11 states, 27 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (85 resets) in 295 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (68 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (27 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (44 resets) in 112 ms. (353 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (28 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
Probably explored full state space saw : 261127 states, properties seen :3
Probabilistic random walk after 1529193 steps, saw 261127 distinct states, run finished after 1588 ms. (steps per millisecond=962 ) properties seen :3
Explored full state space saw : 261127 states, properties seen :0
Exhaustive walk after 1529193 steps, saw 261127 distinct states, run finished after 1384 ms. (steps per millisecond=1104 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p1) p2))), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 186 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true]
Support contains 2 out of 173 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 225/225 transitions.
Applied a total of 0 rules in 7 ms. Remains 173 /173 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2025-05-30 11:50:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:40] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-30 11:50:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:40] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2025-05-30 11:50:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (OVERLAPS) 225/398 variables, 173/176 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:45] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:45] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 0/398 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 178 constraints, problems are : Problem set: 0 solved, 224 unsolved in 14997 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 225/398 variables, 173/178 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 224/402 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:00] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 0/398 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 403 constraints, problems are : Problem set: 0 solved, 224 unsolved in 27877 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42898ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 42899ms
Finished structural reductions in LTL mode , in 1 iterations and 43068 ms. Remains : 173/173 places, 225/225 transitions.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 292 edges and 173 vertex of which 170 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true]
RANDOM walk for 40000 steps (55 resets) in 104 ms. (380 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40000 steps (147 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
[2025-05-30 11:51:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/15 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/56 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/64 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/74 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 149/223 variables, 65/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 128/351 variables, 68/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 36/387 variables, 21/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/387 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 11/398 variables, 7/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/398 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/398 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/15 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 41/56 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/64 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/74 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/74 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 149/223 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 128/351 variables, 68/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 36/387 variables, 21/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/387 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/398 variables, 7/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/398 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/398 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 357ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 225/225 transitions.
Graph (trivial) has 183 edges and 173 vertex of which 2 / 173 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 290 edges and 172 vertex of which 158 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 158 transition count 142
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 129 place count 100 transition count 142
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 129 place count 100 transition count 121
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 171 place count 79 transition count 121
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 173 place count 77 transition count 118
Iterating global reduction 2 with 2 rules applied. Total rules applied 175 place count 77 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 177 place count 77 transition count 116
Performed 26 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 229 place count 51 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 232 place count 51 transition count 81
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 234 place count 49 transition count 79
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 49 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 48 transition count 78
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 262 place count 36 transition count 79
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 270 place count 36 transition count 71
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 281 place count 25 transition count 49
Iterating global reduction 5 with 11 rules applied. Total rules applied 292 place count 25 transition count 49
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 300 place count 25 transition count 41
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 303 place count 22 transition count 32
Iterating global reduction 6 with 3 rules applied. Total rules applied 306 place count 22 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 308 place count 22 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 310 place count 21 transition count 37
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 313 place count 21 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 317 place count 21 transition count 30
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 321 place count 21 transition count 26
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 326 place count 17 transition count 25
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 327 place count 17 transition count 25
Graph (complete) has 44 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 1 rules applied. Total rules applied 328 place count 16 transition count 25
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 329 place count 16 transition count 24
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 330 place count 16 transition count 24
Graph (complete) has 41 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 1 rules applied. Total rules applied 331 place count 15 transition count 24
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 332 place count 15 transition count 23
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 333 place count 15 transition count 23
Graph (complete) has 38 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 334 place count 14 transition count 23
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 335 place count 14 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 336 place count 13 transition count 21
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t57.t219.t54 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 338 place count 10 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 339 place count 10 transition count 18
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 340 place count 9 transition count 16
Iterating global reduction 16 with 1 rules applied. Total rules applied 341 place count 9 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 342 place count 9 transition count 15
Free-agglomeration rule applied 2 times.
Iterating global reduction 17 with 2 rules applied. Total rules applied 344 place count 9 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 346 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 348 place count 7 transition count 11
Applied a total of 348 rules in 36 ms. Remains 7 /173 variables (removed 166) and now considering 11/225 (removed 214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 7/173 places, 11/225 transitions.
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 208 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true]
Product exploration explored 100000 steps with 25000 reset in 98 ms.
Product exploration explored 100000 steps with 25000 reset in 95 ms.
Applying partial POR strategy [true, false, false, false, false, true]
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true]
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 225/225 transitions.
Graph (trivial) has 181 edges and 173 vertex of which 2 / 173 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 291 edges and 172 vertex of which 169 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
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 169 transition count 221
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 57 place count 169 transition count 242
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 79 place count 169 transition count 242
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 92 place count 156 transition count 228
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 105 place count 156 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 156 transition count 227
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 155 transition count 226
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 155 transition count 226
Performed 20 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 128 place count 155 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 132 place count 155 transition count 242
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 143 place count 144 transition count 229
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 154 place count 144 transition count 229
Performed 23 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 98 places in 1 ms
Iterating global reduction 3 with 23 rules applied. Total rules applied 177 place count 144 transition count 329
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 198 place count 144 transition count 308
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 242 place count 100 transition count 206
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 4 with 44 rules applied. Total rules applied 286 place count 100 transition count 206
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 303 place count 100 transition count 189
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 332 place count 71 transition count 135
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 5 with 29 rules applied. Total rules applied 361 place count 71 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 364 place count 71 transition count 132
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 370 place count 65 transition count 120
Deduced a syphon composed of 33 places in 1 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 376 place count 65 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 34 places in 1 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 377 place count 65 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 384 place count 65 transition count 138
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 387 place count 62 transition count 120
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 390 place count 62 transition count 120
Deduced a syphon composed of 31 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 394 place count 62 transition count 116
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 394 rules in 49 ms. Remains 62 /173 variables (removed 111) and now considering 116/225 (removed 109) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:51:25] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2025-05-30 11:51:25] [INFO ] Flow matrix only has 114 transitions (discarded 2 similar events)
// Phase 1: matrix 114 rows 62 cols
[2025-05-30 11:51:25] [INFO ] Computed 3 invariants in 1 ms
[2025-05-30 11:51:25] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:26] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 5 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:26] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:26] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 3/6 constraints. Problems are: Problem set: 9 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 106 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
At refinement iteration 4 (OVERLAPS) 113/175 variables, 62/68 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 5/73 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/73 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/176 variables, 1/74 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/74 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/176 variables, 0/74 constraints. Problems are: Problem set: 69 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 74 constraints, problems are : Problem set: 69 solved, 46 unsolved in 2278 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 69 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 8/38 variables, 3/3 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 3/6 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/6 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 107/145 variables, 38/44 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 5/49 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 46/95 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/95 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 30/175 variables, 24/119 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/119 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 1/176 variables, 1/120 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 0/120 constraints. Problems are: Problem set: 69 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 0/176 variables, 0/120 constraints. Problems are: Problem set: 69 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 120 constraints, problems are : Problem set: 69 solved, 46 unsolved in 2579 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 46/115 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4875ms problems are : Problem set: 69 solved, 46 unsolved
Search for dead transitions found 69 dead transitions in 4876ms
Found 69 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 69 transitions
Dead transitions reduction (with SMT) removed 69 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/173 places, 47/225 transitions.
Graph (complete) has 87 edges and 62 vertex of which 31 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 31 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 9 rules in 8 ms. Remains 31 /62 variables (removed 31) and now considering 60/47 (removed -13) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/173 places, 60/225 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4946 ms. Remains : 31/173 places, 60/225 transitions.
Built C files in :
/tmp/ltsmin7931080133049879735
[2025-05-30 11:51:30] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7931080133049879735
Running compilation step : cd /tmp/ltsmin7931080133049879735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1454 ms.
Running link step : cd /tmp/ltsmin7931080133049879735;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin7931080133049879735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12145905531364231680.hoa' '--buchi-type=spotba'
LTSmin run took 215 ms.
FORMULA CO4-PT-07-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-07-LTLFireability-00 finished in 100905 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||X(p1)))))'
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 177 transition count 231
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 177 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 177 transition count 230
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 173 transition count 225
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 173 transition count 225
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 171 transition count 223
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 171 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 171 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 170 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 170 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 170 transition count 220
Applied a total of 33 rules in 18 ms. Remains 170 /185 variables (removed 15) and now considering 220/240 (removed 20) transitions.
// Phase 1: matrix 220 rows 170 cols
[2025-05-30 11:51:32] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:51:32] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-05-30 11:51:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:51:32] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-05-30 11:51:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 220/390 variables, 170/173 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:36] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:36] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/390 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 175 constraints, problems are : Problem set: 0 solved, 219 unsolved in 14069 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/390 variables, 170/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 219/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:51] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/390 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 395 constraints, problems are : Problem set: 0 solved, 219 unsolved in 26506 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40598ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 40600ms
Starting structural reductions in LTL mode, iteration 1 : 170/185 places, 220/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40824 ms. Remains : 170/185 places, 220/240 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-07-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CO4-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLFireability-02 finished in 40958 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)&&(F(p1)||G(p0))))'
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 240/240 transitions.
Graph (trivial) has 193 edges and 185 vertex of which 2 / 185 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 310 edges and 184 vertex of which 181 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 180 transition count 173
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 118 transition count 173
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 126 place count 118 transition count 154
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 164 place count 99 transition count 154
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 169 place count 94 transition count 148
Iterating global reduction 2 with 5 rules applied. Total rules applied 174 place count 94 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 176 place count 94 transition count 146
Performed 31 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 238 place count 63 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 241 place count 63 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 243 place count 61 transition count 101
Iterating global reduction 4 with 2 rules applied. Total rules applied 245 place count 61 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 247 place count 60 transition count 100
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 275 place count 46 transition count 101
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 283 place count 46 transition count 93
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 293 place count 36 transition count 73
Iterating global reduction 5 with 10 rules applied. Total rules applied 303 place count 36 transition count 73
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 310 place count 36 transition count 66
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 313 place count 33 transition count 57
Iterating global reduction 6 with 3 rules applied. Total rules applied 316 place count 33 transition count 57
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 318 place count 33 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 320 place count 32 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 335 place count 32 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 337 place count 30 transition count 48
Applied a total of 337 rules in 34 ms. Remains 30 /185 variables (removed 155) and now considering 48/240 (removed 192) transitions.
[2025-05-30 11:52:13] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
// Phase 1: matrix 45 rows 30 cols
[2025-05-30 11:52:13] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:52:13] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-30 11:52:13] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
[2025-05-30 11:52:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:52:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:52:13] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:52:13] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2025-05-30 11:52:13] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
[2025-05-30 11:52:13] [INFO ] Invariant cache hit.
[2025-05-30 11:52:13] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 44/74 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 1/75 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 35 constraints, problems are : Problem set: 0 solved, 38 unsolved in 846 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 44/74 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 38/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 1/75 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 73 constraints, problems are : Problem set: 0 solved, 38 unsolved in 738 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1603ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1603ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/185 places, 48/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1733 ms. Remains : 30/185 places, 48/240 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-07-LTLFireability-03
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA CO4-PT-07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLFireability-03 finished in 1886 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&&(p1 U (p2||G(p1))))))'
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 176 transition count 230
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 176 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 176 transition count 229
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 172 transition count 224
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 172 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 170 transition count 222
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 170 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 170 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 169 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 169 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 169 transition count 219
Applied a total of 35 rules in 16 ms. Remains 169 /185 variables (removed 16) and now considering 219/240 (removed 21) transitions.
// Phase 1: matrix 219 rows 169 cols
[2025-05-30 11:52:15] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:52:15] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-30 11:52:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:52:15] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-30 11:52:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/388 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:52:19] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:52:19] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/388 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 174 constraints, problems are : Problem set: 0 solved, 218 unsolved in 14345 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/388 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 218/392 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:52:34] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/388 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 393 constraints, problems are : Problem set: 0 solved, 218 unsolved in 27739 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42104ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 42105ms
Starting structural reductions in LTL mode, iteration 1 : 169/185 places, 219/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42263 ms. Remains : 169/185 places, 219/240 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CO4-PT-07-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Computed a total of 12 stabilizing places and 15 stable transitions
Graph (complete) has 287 edges and 169 vertex of which 166 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1))))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 12 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-07-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-07-LTLFireability-04 finished in 42608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(p1)))))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 240/240 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 177 transition count 231
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 177 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 177 transition count 230
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 173 transition count 225
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 173 transition count 225
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 171 transition count 223
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 171 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 171 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 170 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 170 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 170 transition count 220
Applied a total of 33 rules in 7 ms. Remains 170 /185 variables (removed 15) and now considering 220/240 (removed 20) transitions.
// Phase 1: matrix 220 rows 170 cols
[2025-05-30 11:52:57] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:52:57] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-30 11:52:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:52:57] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-05-30 11:52:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 220/390 variables, 170/173 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:53:02] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:53:02] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/390 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 175 constraints, problems are : Problem set: 0 solved, 219 unsolved in 13925 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/390 variables, 170/175 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 219/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:53:19] [INFO ] Deduced a trap along path composed of 2 places in 13 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/390 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 395 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43965ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 43967ms
Starting structural reductions in LTL mode, iteration 1 : 170/185 places, 220/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44152 ms. Remains : 170/185 places, 220/240 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-07-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 85 ms.
Product exploration explored 100000 steps with 33333 reset in 82 ms.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 288 edges and 170 vertex of which 167 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 10 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-07-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-07-LTLFireability-09 finished in 44479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((G(p0)||X(X(p1))))))))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 240/240 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 176 transition count 230
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 176 transition count 230
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 172 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 172 transition count 225
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 170 transition count 223
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 170 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 170 transition count 222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 169 transition count 221
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 169 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 169 transition count 220
Applied a total of 34 rules in 7 ms. Remains 169 /185 variables (removed 16) and now considering 220/240 (removed 20) transitions.
// Phase 1: matrix 220 rows 169 cols
[2025-05-30 11:53:42] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:53:42] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-30 11:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:53:42] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-05-30 11:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 220/389 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:53:46] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:53:46] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/389 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 174 constraints, problems are : Problem set: 0 solved, 219 unsolved in 14179 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/389 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 219/393 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:54:04] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 394 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44209ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 44210ms
Starting structural reductions in LTL mode, iteration 1 : 169/185 places, 220/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44410 ms. Remains : 169/185 places, 220/240 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : CO4-PT-07-LTLFireability-11
Product exploration explored 100000 steps with 14272 reset in 101 ms.
Product exploration explored 100000 steps with 14286 reset in 120 ms.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 289 edges and 169 vertex of which 166 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (49 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (41 resets) in 183 ms. (217 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (39 resets) in 187 ms. (212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (48 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (36 resets) in 182 ms. (218 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (42 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (57 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 485739 steps, run visited all 6 properties in 597 ms. (steps per millisecond=813 )
Probabilistic random walk after 485739 steps, saw 98754 distinct states, run finished after 600 ms. (steps per millisecond=809 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 380 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 220/220 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2025-05-30 11:54:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:54:29] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-30 11:54:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:54:29] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-05-30 11:54:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 220/389 variables, 169/172 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:54:33] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:54:33] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/389 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 174 constraints, problems are : Problem set: 0 solved, 219 unsolved in 12908 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/389 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 219/393 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:54:49] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/389 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 394 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42937ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 42938ms
Finished structural reductions in LTL mode , in 1 iterations and 43102 ms. Remains : 169/169 places, 220/220 transitions.
Computed a total of 11 stabilizing places and 14 stable transitions
Graph (complete) has 289 edges and 169 vertex of which 166 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 11 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (81 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (59 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (72 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (57 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (19 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (23 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (53 resets) in 62 ms. (634 steps per ms) remains 3/6 properties
[2025-05-30 11:55:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 30/52 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 55/107 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 104/211 variables, 36/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 111/322 variables, 60/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 48/370 variables, 27/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 13/383 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 6/389 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/389 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/389 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 172 constraints, problems are : Problem set: 0 solved, 3 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 30/52 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 55/107 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 104/211 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 111/322 variables, 60/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 48/370 variables, 27/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 13/383 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/389 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/389 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 175 constraints, problems are : Problem set: 0 solved, 3 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 564ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 20 ms.
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 220/220 transitions.
Graph (trivial) has 174 edges and 169 vertex of which 2 / 169 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 287 edges and 168 vertex of which 154 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 154 transition count 142
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 121 place count 100 transition count 141
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 121 place count 100 transition count 120
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 163 place count 79 transition count 120
Performed 24 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 211 place count 55 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 215 place count 55 transition count 87
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 217 place count 54 transition count 86
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 219 place count 52 transition count 84
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 52 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 225 place count 50 transition count 82
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 125 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 5 rules applied. Total rules applied 230 place count 49 transition count 78
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 233 place count 46 transition count 75
Iterating global reduction 5 with 3 rules applied. Total rules applied 236 place count 46 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 46 transition count 74
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 6 with 4 rules applied. Total rules applied 241 place count 44 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 243 place count 44 transition count 70
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 245 place count 42 transition count 68
Iterating global reduction 7 with 2 rules applied. Total rules applied 247 place count 42 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 249 place count 42 transition count 66
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 269 place count 32 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 287 place count 32 transition count 49
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 296 place count 23 transition count 40
Iterating global reduction 9 with 9 rules applied. Total rules applied 305 place count 23 transition count 40
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 313 place count 23 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 314 place count 23 transition count 31
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 315 place count 22 transition count 30
Iterating global reduction 10 with 1 rules applied. Total rules applied 316 place count 22 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 317 place count 22 transition count 29
Free-agglomeration rule applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 321 place count 22 transition count 25
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 326 place count 18 transition count 24
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 329 place count 18 transition count 24
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 330 place count 18 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 331 place count 17 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 332 place count 16 transition count 22
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 333 place count 16 transition count 22
Applied a total of 333 rules in 14 ms. Remains 16 /169 variables (removed 153) and now considering 22/220 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 16/169 places, 22/220 transitions.
RANDOM walk for 14698 steps (1841 resets) in 16 ms. (864 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 239 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 377 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 410 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 14253 reset in 97 ms.
Product exploration explored 100000 steps with 14239 reset in 98 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 220/220 transitions.
Graph (trivial) has 174 edges and 169 vertex of which 2 / 169 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 288 edges and 168 vertex of which 165 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 165 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 165 transition count 215
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 56 place count 165 transition count 234
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 77 place count 165 transition count 234
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 88 place count 154 transition count 223
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 99 place count 154 transition count 223
Performed 19 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 118 place count 154 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 122 place count 154 transition count 238
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 133 place count 143 transition count 226
Deduced a syphon composed of 73 places in 1 ms
Iterating global reduction 3 with 11 rules applied. Total rules applied 144 place count 143 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 74 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 143 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 143 transition count 225
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 148 place count 141 transition count 223
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 141 transition count 223
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 151 place count 141 transition count 223
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 152 place count 140 transition count 222
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 140 transition count 222
Performed 23 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 176 place count 140 transition count 321
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 197 place count 140 transition count 300
Discarding 43 places :
Symmetric choice reduction at 5 with 43 rule applications. Total rules 240 place count 97 transition count 200
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 5 with 43 rules applied. Total rules applied 283 place count 97 transition count 200
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 300 place count 97 transition count 183
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 328 place count 69 transition count 132
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 6 with 28 rules applied. Total rules applied 356 place count 69 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 359 place count 69 transition count 129
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 363 place count 65 transition count 121
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 367 place count 65 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 368 place count 65 transition count 146
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 375 place count 65 transition count 139
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 378 place count 62 transition count 121
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 381 place count 62 transition count 121
Deduced a syphon composed of 31 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 389 place count 62 transition count 113
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 389 rules in 28 ms. Remains 62 /169 variables (removed 107) and now considering 113/220 (removed 107) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:55:16] [INFO ] Redundant transitions in 2 ms returned []
Running 112 sub problems to find dead transitions.
[2025-05-30 11:55:16] [INFO ] Flow matrix only has 110 transitions (discarded 3 similar events)
// Phase 1: matrix 110 rows 62 cols
[2025-05-30 11:55:16] [INFO ] Computed 3 invariants in 1 ms
[2025-05-30 11:55:16] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:16] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:16] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:16] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD53 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 3/6 constraints. Problems are: Problem set: 6 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 106 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 4 (OVERLAPS) 109/171 variables, 62/68 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 12/80 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/80 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/172 variables, 1/81 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/81 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/172 variables, 0/81 constraints. Problems are: Problem set: 66 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 81 constraints, problems are : Problem set: 66 solved, 46 unsolved in 2120 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 7/37 variables, 3/3 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 3/6 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 103/140 variables, 37/43 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 12/55 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 46/101 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/101 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 31/171 variables, 25/126 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/126 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 1/172 variables, 1/127 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 0/127 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 0/172 variables, 0/127 constraints. Problems are: Problem set: 66 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 127 constraints, problems are : Problem set: 66 solved, 46 unsolved in 2647 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 46/112 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4779ms problems are : Problem set: 66 solved, 46 unsolved
Search for dead transitions found 66 dead transitions in 4780ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/169 places, 47/220 transitions.
Graph (complete) has 92 edges and 62 vertex of which 31 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 31 /62 variables (removed 31) and now considering 47/47 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/169 places, 47/220 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4821 ms. Remains : 31/169 places, 47/220 transitions.
Built C files in :
/tmp/ltsmin962738538193741502
[2025-05-30 11:55:20] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin962738538193741502
Running compilation step : cd /tmp/ltsmin962738538193741502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 323 ms.
Running link step : cd /tmp/ltsmin962738538193741502;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin962738538193741502;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18088803353968294197.hoa' '--buchi-type=spotba'
LTSmin run took 154 ms.
FORMULA CO4-PT-07-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-07-LTLFireability-11 finished in 99202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 240/240 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 175 transition count 229
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 175 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 175 transition count 228
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 171 transition count 223
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 171 transition count 223
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 169 transition count 221
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 169 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 169 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 168 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 168 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 168 transition count 218
Applied a total of 37 rules in 7 ms. Remains 168 /185 variables (removed 17) and now considering 218/240 (removed 22) transitions.
// Phase 1: matrix 218 rows 168 cols
[2025-05-30 11:55:21] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:55:21] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-30 11:55:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:55:21] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-05-30 11:55:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/386 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:25] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:25] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/386 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 173 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14246 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/386 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 217/390 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:55:40] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/386 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 391 constraints, problems are : Problem set: 0 solved, 217 unsolved in 27010 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41273ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 41273ms
Starting structural reductions in LTL mode, iteration 1 : 168/185 places, 218/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41407 ms. Remains : 168/185 places, 218/240 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-07-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLFireability-14 finished in 41512 ms.
All properties solved by simple procedures.
Total runtime 376244 ms.

BK_STOP 1748606162981

--------------------
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="CO4-PT-07"
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 CO4-PT-07, 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 r044-tall-174854028400428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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