Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200244.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 MedleyA-PT-19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200244
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K 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.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 184K 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 MedleyA-PT-19-LTLFireability-00
FORMULA_NAME MedleyA-PT-19-LTLFireability-01
FORMULA_NAME MedleyA-PT-19-LTLFireability-02
FORMULA_NAME MedleyA-PT-19-LTLFireability-03
FORMULA_NAME MedleyA-PT-19-LTLFireability-04
FORMULA_NAME MedleyA-PT-19-LTLFireability-05
FORMULA_NAME MedleyA-PT-19-LTLFireability-06
FORMULA_NAME MedleyA-PT-19-LTLFireability-07
FORMULA_NAME MedleyA-PT-19-LTLFireability-08
FORMULA_NAME MedleyA-PT-19-LTLFireability-09
FORMULA_NAME MedleyA-PT-19-LTLFireability-10
FORMULA_NAME MedleyA-PT-19-LTLFireability-11
FORMULA_NAME MedleyA-PT-19-LTLFireability-12
FORMULA_NAME MedleyA-PT-19-LTLFireability-13
FORMULA_NAME MedleyA-PT-19-LTLFireability-14
FORMULA_NAME MedleyA-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748883845970

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 17:04:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 17:04:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 17:04:08] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2025-06-02 17:04:08] [INFO ] Transformed 272 places.
[2025-06-02 17:04:08] [INFO ] Transformed 586 transitions.
[2025-06-02 17:04:08] [INFO ] Found NUPN structural information;
[2025-06-02 17:04:08] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 496 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 3 transitions.
FORMULA MedleyA-PT-19-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 583/583 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 583
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 72 place count 197 transition count 503
Iterating global reduction 1 with 70 rules applied. Total rules applied 142 place count 197 transition count 503
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 144 place count 195 transition count 499
Iterating global reduction 1 with 2 rules applied. Total rules applied 146 place count 195 transition count 499
Applied a total of 146 rules in 138 ms. Remains 195 /269 variables (removed 74) and now considering 499/583 (removed 84) transitions.
// Phase 1: matrix 499 rows 195 cols
[2025-06-02 17:04:09] [INFO ] Computed 22 invariants in 57 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:04:09] [INFO ] Implicit Places using invariants in 537 ms returned []
[2025-06-02 17:04:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:04:10] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2025-06-02 17:04:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD473 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/195 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:23] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:23] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:23] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:23] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:24] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:24] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:24] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:24] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:25] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:25] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:25] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:25] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:25] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:26] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:26] [INFO ] Deduced a trap composed of 21 places in 261 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:26] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:26] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:27] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 18/40 constraints. Problems are: Problem set: 120 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/40 constraints. Problems are: Problem set: 120 solved, 378 unsolved
At refinement iteration 5 (OVERLAPS) 499/694 variables, 195/235 constraints. Problems are: Problem set: 120 solved, 378 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:39] [INFO ] Deduced a trap composed of 15 places in 325 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:39] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:40] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:40] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:41] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:42] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 7 ms to minimize.
SMT process timed out in 31683ms, After SMT, problems are : Problem set: 120 solved, 378 unsolved
Search for dead transitions found 120 dead transitions in 31725ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in LTL mode, iteration 1 : 195/269 places, 379/583 transitions.
Applied a total of 0 rules in 8 ms. Remains 195 /195 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33197 ms. Remains : 195/269 places, 379/583 transitions.
Support contains 38 out of 195 places after structural reductions.
[2025-06-02 17:04:42] [INFO ] Flatten gal took : 128 ms
[2025-06-02 17:04:42] [INFO ] Flatten gal took : 73 ms
[2025-06-02 17:04:42] [INFO ] Input system was already deterministic with 379 transitions.
RANDOM walk for 40000 steps (9 resets) in 2669 ms. (14 steps per ms) remains 29/31 properties
BEST_FIRST walk for 4003 steps (10 resets) in 54 ms. (72 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (11 resets) in 49 ms. (80 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (11 resets) in 48 ms. (81 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 66 ms. (59 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (13 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (12 resets) in 46 ms. (85 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (10 resets) in 35 ms. (111 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (11 resets) in 36 ms. (108 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (10 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (11 resets) in 25 ms. (153 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (10 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (11 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (11 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
// Phase 1: matrix 379 rows 195 cols
[2025-06-02 17:04:44] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 62/93 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 22 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 3 (OVERLAPS) 79/172 variables, 13/19 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 3/175 variables, 1/20 constraints. Problems are: Problem set: 5 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/20 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 366/541 variables, 175/195 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 0/195 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 20/561 variables, 12/207 constraints. Problems are: Problem set: 5 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:45] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 16 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 1/208 constraints. Problems are: Problem set: 5 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:46] [INFO ] Deduced a trap along path composed of 2 places in 42 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/561 variables, 1/209 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 0/209 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 1/562 variables, 2/211 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/562 variables, 1/212 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/562 variables, 0/212 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 11/573 variables, 6/218 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/573 variables, 0/218 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 1/574 variables, 1/219 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/574 variables, 0/219 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 0/574 variables, 0/219 constraints. Problems are: Problem set: 5 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 219 constraints, problems are : Problem set: 5 solved, 19 unsolved in 4553 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 19 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 65/91 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 78/169 variables, 12/18 constraints. Problems are: Problem set: 6 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/18 constraints. Problems are: Problem set: 6 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 6/175 variables, 2/20 constraints. Problems are: Problem set: 6 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 1/21 constraints. Problems are: Problem set: 6 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:49] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:49] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:49] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:49] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 4/25 constraints. Problems are: Problem set: 6 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:49] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:50] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 2/27 constraints. Problems are: Problem set: 6 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/27 constraints. Problems are: Problem set: 6 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 366/541 variables, 175/202 constraints. Problems are: Problem set: 6 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 9/211 constraints. Problems are: Problem set: 6 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 1/212 constraints. Problems are: Problem set: 6 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:51] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:51] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 2/214 constraints. Problems are: Problem set: 6 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 0/214 constraints. Problems are: Problem set: 6 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 20/561 variables, 12/226 constraints. Problems are: Problem set: 6 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/561 variables, 9/235 constraints. Problems are: Problem set: 6 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:53] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/574 variables, and 236 constraints, problems are : Problem set: 6 solved, 18 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 14/16 constraints, State Equation: 187/195 constraints, PredecessorRefiner: 18/24 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 9658ms problems are : Problem set: 6 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 379/379 transitions.
Graph (complete) has 676 edges and 195 vertex of which 193 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 193 transition count 350
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 58 place count 167 transition count 346
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 62 place count 165 transition count 344
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 65 place count 163 transition count 343
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 65 place count 163 transition count 336
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 79 place count 156 transition count 336
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 85 place count 150 transition count 326
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 150 transition count 326
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 151 place count 119 transition count 297
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 152 place count 119 transition count 296
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 166 place count 112 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 5 with 35 rules applied. Total rules applied 201 place count 112 transition count 309
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 206 place count 112 transition count 304
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 211 place count 107 transition count 304
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 226 place count 107 transition count 406
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 40 rules applied. Total rules applied 266 place count 92 transition count 381
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 273 place count 92 transition count 381
Applied a total of 273 rules in 225 ms. Remains 92 /195 variables (removed 103) and now considering 381/379 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 92/195 places, 381/379 transitions.
RANDOM walk for 40000 steps (39 resets) in 621 ms. (64 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4002 steps (39 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (28 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (32 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (27 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (17 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (21 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (16 resets) in 21 ms. (181 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (36 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (19 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (23 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (25 resets) in 40 ms. (97 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4004 steps (25 resets) in 18 ms. (210 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4001 steps (20 resets) in 40 ms. (97 steps per ms) remains 12/12 properties
// Phase 1: matrix 381 rows 92 cols
[2025-06-02 17:04:54] [INFO ] Computed 21 invariants in 6 ms
[2025-06-02 17:04:54] [INFO ] State equation strengthened by 29 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 48/67 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 20/89 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 2/91 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 381/472 variables, 91/112 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 29/141 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 1/473 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/473 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/473 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 142 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1914 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 92/92 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 12/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 48/67 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:56] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 2/69 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 20/89 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:04:56] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 2/91 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 381/472 variables, 91/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 29/143 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 1/473 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/473 variables, 7/155 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/473 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/473 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 473/473 variables, and 155 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4431 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 92/92 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 12/11 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6409ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 9 different solutions.
Finished Parikh walk after 4599 steps, including 97 resets, run visited all 1 properties in 35 ms. (steps per millisecond=131 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 12 properties in 543 ms.
FORMULA MedleyA-PT-19-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
FORMULA MedleyA-PT-19-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 21 stable transitions
Graph (complete) has 676 edges and 195 vertex of which 193 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 379/379 transitions.
Graph (complete) has 676 edges and 195 vertex of which 193 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 192 transition count 346
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 67 place count 162 transition count 340
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 159 transition count 340
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 70 place count 159 transition count 331
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 88 place count 150 transition count 331
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 102 place count 136 transition count 311
Iterating global reduction 3 with 14 rules applied. Total rules applied 116 place count 136 transition count 311
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 116 place count 136 transition count 310
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 135 transition count 310
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 185 place count 100 transition count 278
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 195 place count 95 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 215 place count 95 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 217 place count 94 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 93 transition count 296
Applied a total of 218 rules in 113 ms. Remains 93 /195 variables (removed 102) and now considering 296/379 (removed 83) transitions.
[2025-06-02 17:05:02] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
// Phase 1: matrix 295 rows 93 cols
[2025-06-02 17:05:02] [INFO ] Computed 19 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:05:02] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-02 17:05:02] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2025-06-02 17:05:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:05:02] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 17:05:02] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:05:02] [INFO ] Redundant transitions in 70 ms returned []
Running 288 sub problems to find dead transitions.
[2025-06-02 17:05:02] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2025-06-02 17:05:02] [INFO ] Invariant cache hit.
[2025-06-02 17:05:02] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 294/387 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 65/177 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/388 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 178 constraints, problems are : Problem set: 0 solved, 288 unsolved in 26128 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 294/387 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 65/177 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 288/465 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/388 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 466 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56478ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 56481ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/195 places, 296/379 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57198 ms. Remains : 93/195 places, 296/379 transitions.
Stuttering acceptance computed with spot in 193 ms :[p0]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-00
Product exploration explored 100000 steps with 9 reset in 206 ms.
Product exploration explored 100000 steps with 0 reset in 208 ms.
Computed a total of 5 stabilizing places and 74 stable transitions
Computed a total of 5 stabilizing places and 74 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[p0]
RANDOM walk for 40000 steps (3273 resets) in 871 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (321 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 105772 steps, run visited all 1 properties in 325 ms. (steps per millisecond=325 )
Probabilistic random walk after 105772 steps, saw 22191 distinct states, run finished after 332 ms. (steps per millisecond=318 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[p0]
Stuttering acceptance computed with spot in 51 ms :[p0]
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 296/296 transitions.
Applied a total of 0 rules in 10 ms. Remains 93 /93 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2025-06-02 17:06:00] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2025-06-02 17:06:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:06:00] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 17:06:00] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2025-06-02 17:06:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:06:01] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 17:06:01] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:06:01] [INFO ] Redundant transitions in 73 ms returned []
Running 288 sub problems to find dead transitions.
[2025-06-02 17:06:01] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2025-06-02 17:06:01] [INFO ] Invariant cache hit.
[2025-06-02 17:06:01] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 294/387 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 65/177 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/388 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 178 constraints, problems are : Problem set: 0 solved, 288 unsolved in 25090 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 294/387 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 65/177 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 288/465 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/388 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 466 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55421ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 55423ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55979 ms. Remains : 93/93 places, 296/296 transitions.
Computed a total of 5 stabilizing places and 74 stable transitions
Computed a total of 5 stabilizing places and 74 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p0]
RANDOM walk for 40000 steps (3305 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (307 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 105772 steps, run visited all 1 properties in 415 ms. (steps per millisecond=254 )
Probabilistic random walk after 105772 steps, saw 22191 distinct states, run finished after 415 ms. (steps per millisecond=254 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[p0]
Stuttering acceptance computed with spot in 48 ms :[p0]
Stuttering acceptance computed with spot in 50 ms :[p0]
Product exploration explored 100000 steps with 3 reset in 371 ms.
Product exploration explored 100000 steps with 0 reset in 205 ms.
Built C files in :
/tmp/ltsmin14203371487249183090
[2025-06-02 17:06:58] [INFO ] Computing symmetric may disable matrix : 296 transitions.
[2025-06-02 17:06:58] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:06:58] [INFO ] Computing symmetric may enable matrix : 296 transitions.
[2025-06-02 17:06:58] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:06:58] [INFO ] Computing Do-Not-Accords matrix : 296 transitions.
[2025-06-02 17:06:58] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:06:58] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14203371487249183090
Running compilation step : cd /tmp/ltsmin14203371487249183090;'/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 1819 ms.
Running link step : cd /tmp/ltsmin14203371487249183090;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin14203371487249183090;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12486411724654458979.hoa' '--buchi-type=spotba'
LTSmin run took 1412 ms.
FORMULA MedleyA-PT-19-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-19-LTLFireability-00 finished in 119977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U ((p1 U p2)&&(X(p2)||F(p3)))))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 379/379 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 187 transition count 368
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 187 transition count 368
Applied a total of 16 rules in 9 ms. Remains 187 /195 variables (removed 8) and now considering 368/379 (removed 11) transitions.
// Phase 1: matrix 368 rows 187 cols
[2025-06-02 17:07:01] [INFO ] Computed 22 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:07:02] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-06-02 17:07:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:07:02] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2025-06-02 17:07:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:11] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:11] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:11] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:11] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:12] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:12] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:12] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:12] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:13] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:13] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:13] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:13] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:13] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/555 variables, 187/222 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:24] [INFO ] Deduced a trap composed of 13 places in 293 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:24] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:25] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:25] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:25] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:26] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 555/555 variables, and 228 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/555 variables, 187/228 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 367/595 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:50] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:50] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:51] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:07:51] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 4/599 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 599 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60398ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Starting structural reductions in LTL mode, iteration 1 : 187/195 places, 368/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61027 ms. Remains : 187/195 places, 368/379 transitions.
Stuttering acceptance computed with spot in 599 ms :[(NOT p2), true, (NOT p0), (NOT p2), (AND (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-01
Product exploration explored 100000 steps with 1 reset in 457 ms.
Product exploration explored 100000 steps with 4 reset in 160 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 653 edges and 187 vertex of which 185 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p3))), (X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND p1 (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p2) (NOT p1) (NOT p3) p0)), (X (NOT (OR (AND p2 (NOT p3) p0) (AND p1 (NOT p3) p0)))), (X (AND (NOT p2) (NOT p3) p0)), (X (NOT (AND (NOT p2) p1 (NOT p3) p0))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND p1 (NOT p3) (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND p1 (NOT p3) p0))))), (X (X (AND (NOT p2) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 329 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 621 ms :[(NOT p2), true, (NOT p0), (NOT p2), (AND (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (18 resets) in 1046 ms. (38 steps per ms) remains 9/23 properties
BEST_FIRST walk for 40001 steps (11 resets) in 316 ms. (126 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (18 resets) in 362 ms. (110 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (15 resets) in 66 ms. (597 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (27 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (32 resets) in 155 ms. (256 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (19 resets) in 187 ms. (212 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (16 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (20 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (11 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
[2025-06-02 17:08:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 45/72 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 78/150 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:06] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 9/159 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 350/509 variables, 159/178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 25/534 variables, 16/194 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/534 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 2/536 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/536 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/536 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 13/549 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 6/555 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 0/555 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 210 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 23/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 45/72 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 78/150 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:07] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:07] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 9/159 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 350/509 variables, 159/180 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/509 variables, 9/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:08] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/509 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:08] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/509 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/509 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 25/534 variables, 16/207 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 2/536 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/536 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/536 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 13/549 variables, 6/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/549 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 6/555 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/555 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 0/555 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 223 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3787 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4841ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Finished Parikh walk after 2395 steps, including 18 resets, run visited all 9 properties in 44 ms. (steps per millisecond=54 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 48 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p2) (NOT p3))), (X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND p1 (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p2) (NOT p1) (NOT p3) p0)), (X (NOT (OR (AND p2 (NOT p3) p0) (AND p1 (NOT p3) p0)))), (X (AND (NOT p2) (NOT p3) p0)), (X (NOT (AND (NOT p2) p1 (NOT p3) p0))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p3) (NOT p0)) (AND p1 (NOT p3) (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND p1 (NOT p3) p0))))), (X (X (AND (NOT p2) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (OR (NOT p0) (NOT p1) p3) (OR (NOT p0) (NOT p2) p3)))), (F (NOT (OR p0 p1 p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (AND (OR p0 (NOT p1) p3) (OR p0 (NOT p2) p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F p2), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (AND p0 (NOT p3)))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR p0 p3))), (F p1), (F (NOT (OR p0 p2 p3))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 p1 p2 p3)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 (NOT p1) p2)))
Knowledge based reduction with 39 factoid took 404 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-19-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-19-LTLFireability-01 finished in 69662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 379/379 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 184 transition count 365
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 184 transition count 365
Applied a total of 22 rules in 6 ms. Remains 184 /195 variables (removed 11) and now considering 365/379 (removed 14) transitions.
// Phase 1: matrix 365 rows 184 cols
[2025-06-02 17:08:11] [INFO ] Computed 22 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:08:11] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-02 17:08:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:08:12] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2025-06-02 17:08:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:20] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:20] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:20] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:20] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:21] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:21] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:21] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:22] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:22] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:22] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/216 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:33] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:33] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:34] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:34] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:34] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:08:35] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 222 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/586 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:02] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:02] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 588 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60346ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60350ms
Starting structural reductions in LTL mode, iteration 1 : 184/195 places, 365/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60942 ms. Remains : 184/195 places, 365/379 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-02 finished in 61098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((!p0&&X(!p0)) U (G((!p0&&X(!p0)))||(X(!p0)&&p1))) U ((F(p0) U p2)||G(p3))))'
Support contains 7 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 379/379 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 186 transition count 367
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 186 transition count 367
Applied a total of 18 rules in 4 ms. Remains 186 /195 variables (removed 9) and now considering 367/379 (removed 12) transitions.
// Phase 1: matrix 367 rows 186 cols
[2025-06-02 17:09:12] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:09:12] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-02 17:09:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:09:13] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2025-06-02 17:09:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:19] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:19] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:19] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:19] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:20] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:20] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:20] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:21] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:21] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:21] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:21] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:22] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/553 variables, 186/220 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:33] [INFO ] Deduced a trap composed of 14 places in 276 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:33] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:34] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:34] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:35] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:09:35] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 12 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/553 variables, and 226 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/553 variables, 186/226 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 366/592 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:01] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 593 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60236ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Starting structural reductions in LTL mode, iteration 1 : 186/195 places, 367/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60662 ms. Remains : 186/195 places, 367/379 transitions.
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) p3) (AND p0 p1 (NOT p2))), (AND (NOT p2) p0 p3 p1), (AND (NOT p2) p0 (NOT p3) p1), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-03
Product exploration explored 100000 steps with 33260 reset in 288 ms.
Product exploration explored 100000 steps with 33203 reset in 461 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 652 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) p0 (NOT p3) p1))), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p2) p0 p3 (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p2) p3 p1)))), (X (OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) p0 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1)))), (X (NOT (AND (NOT p2) p0 p3 p1))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 (NOT p3) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p0 p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p2) p3 p1))))), (X (X (OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1))))), (X (X (NOT (AND (NOT p2) p0 p3 p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 183 ms. Reduced automaton from 8 states, 21 edges and 4 AP (stutter sensitive) to 8 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 555 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) p3) (AND p0 p1 (NOT p2))), (AND (NOT p2) p0 p3 p1), (AND (NOT p2) p0 (NOT p3) p1), (NOT p0), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (16 resets) in 416 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (10 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 49 ms. (80 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (13 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (11 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (9 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (11 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (13 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (11 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (12 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (12 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 383310 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 20
Probabilistic random walk after 383310 steps, saw 66246 distinct states, run finished after 3006 ms. (steps per millisecond=127 ) properties seen :0
[2025-06-02 17:10:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf7 is UNSAT
Problem apf11 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 24/31 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 44/75 variables, 4/6 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Problem apf12 is UNSAT
Problem apf14 is UNSAT
At refinement iteration 5 (OVERLAPS) 74/149 variables, 9/15 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 9/158 variables, 3/18 constraints. Problems are: Problem set: 4 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:19] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/19 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 349/507 variables, 158/177 constraints. Problems are: Problem set: 4 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:19] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 1/178 constraints. Problems are: Problem set: 4 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:19] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 1/179 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 0/179 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 25/532 variables, 16/195 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/532 variables, 0/195 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 2/534 variables, 4/199 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/534 variables, 2/201 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 0/201 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 13/547 variables, 6/207 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/547 variables, 0/207 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 21 (OVERLAPS) 6/553 variables, 4/211 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/553 variables, 0/211 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 23 (OVERLAPS) 0/553 variables, 0/211 constraints. Problems are: Problem set: 4 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 211 constraints, problems are : Problem set: 4 solved, 16 unsolved in 3902 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 20/18 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 16 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 24/31 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 44/75 variables, 4/6 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 74/149 variables, 9/15 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 1/16 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 9/158 variables, 3/19 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/20 constraints. Problems are: Problem set: 4 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:22] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:22] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:23] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 3/23 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/23 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 349/507 variables, 158/181 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 4/185 constraints. Problems are: Problem set: 4 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:23] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:23] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 2/187 constraints. Problems are: Problem set: 4 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:24] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:24] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 12 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 2/189 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 1/190 constraints. Problems are: Problem set: 4 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:25] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 1/191 constraints. Problems are: Problem set: 4 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:25] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:25] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:25] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:10:26] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 8 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/507 variables, 4/195 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/507 variables, 0/195 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 25/532 variables, 16/211 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 11/222 constraints. Problems are: Problem set: 4 solved, 16 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/553 variables, and 222 constraints, problems are : Problem set: 4 solved, 16 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 12/16 constraints, State Equation: 174/186 constraints, PredecessorRefiner: 16/18 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 8954ms problems are : Problem set: 4 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 367/367 transitions.
Graph (complete) has 652 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 184 transition count 334
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 154 transition count 330
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 152 transition count 329
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 71 place count 151 transition count 328
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 71 place count 151 transition count 320
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 87 place count 143 transition count 320
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 90 place count 140 transition count 314
Iterating global reduction 4 with 3 rules applied. Total rules applied 93 place count 140 transition count 314
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 73 rules applied. Total rules applied 166 place count 102 transition count 279
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 168 place count 102 transition count 277
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 178 place count 97 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 198 place count 97 transition count 286
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 5 with 2 rules applied. Total rules applied 200 place count 96 transition count 296
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 206 place count 96 transition count 290
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 212 place count 90 transition count 290
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 6 with 17 rules applied. Total rules applied 229 place count 90 transition count 406
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 45 rules applied. Total rules applied 274 place count 73 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 276 place count 73 transition count 376
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 278 place count 73 transition count 376
Applied a total of 278 rules in 136 ms. Remains 73 /186 variables (removed 113) and now considering 376/367 (removed -9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 73/186 places, 376/367 transitions.
RANDOM walk for 40000 steps (4295 resets) in 539 ms. (74 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40004 steps (446 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (461 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
// Phase 1: matrix 376 rows 73 cols
[2025-06-02 17:10:27] [INFO ] Computed 20 invariants in 4 ms
[2025-06-02 17:10:27] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/62 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/72 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 376/448 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 85/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/449 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/449 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 178 constraints, problems are : Problem set: 0 solved, 2 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/62 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/72 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 376/448 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 85/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/449 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/449 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1216ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 76 ms.
Support contains 7 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 376/376 transitions.
Applied a total of 0 rules in 13 ms. Remains 73 /73 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 73/73 places, 376/376 transitions.
RANDOM walk for 40000 steps (4297 resets) in 429 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (425 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (455 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 649347 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :0 out of 2
Probabilistic random walk after 649347 steps, saw 109086 distinct states, run finished after 3002 ms. (steps per millisecond=216 ) properties seen :0
[2025-06-02 17:10:32] [INFO ] Invariant cache hit.
[2025-06-02 17:10:32] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/62 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/72 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 376/448 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 85/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/449 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/449 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 178 constraints, problems are : Problem set: 0 solved, 2 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 29/62 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/72 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 376/448 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 85/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/449 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/449 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1211ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 107 ms.
Support contains 7 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 376/376 transitions.
Applied a total of 0 rules in 10 ms. Remains 73 /73 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 73/73 places, 376/376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 376/376 transitions.
Applied a total of 0 rules in 9 ms. Remains 73 /73 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2025-06-02 17:10:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:10:33] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-02 17:10:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:10:34] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-06-02 17:10:34] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:10:34] [INFO ] Redundant transitions in 66 ms returned []
Running 368 sub problems to find dead transitions.
[2025-06-02 17:10:34] [INFO ] Invariant cache hit.
[2025-06-02 17:10:34] [INFO ] State equation strengthened by 85 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/449 variables, 73/93 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 85/178 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 0/449 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 178 constraints, problems are : Problem set: 0 solved, 368 unsolved in 24717 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 376/449 variables, 73/93 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 85/178 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 368/546 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 449/449 variables, and 546 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 73/73 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55242ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 55243ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56002 ms. Remains : 73/73 places, 376/376 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 27 edges and 73 vertex of which 3 / 73 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 426 edges and 71 vertex of which 62 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 62 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 62 transition count 318
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 62 transition count 317
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 48 place count 61 transition count 309
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 61 transition count 309
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 59 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 59 transition count 305
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 68 place count 59 transition count 305
Applied a total of 68 rules in 43 ms. Remains 59 /73 variables (removed 14) and now considering 305/376 (removed 71) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 305 rows 59 cols
[2025-06-02 17:11:29] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 17:11:29] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-06-02 17:11:29] [INFO ] [Real]Absence check using 9 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-02 17:11:30] [INFO ] After 218ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2025-06-02 17:11:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-02 17:11:30] [INFO ] After 20ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-02 17:11:30] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 17:11:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2025-06-02 17:11:30] [INFO ] [Nat]Absence check using 9 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 17:11:30] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-02 17:11:30] [INFO ] After 89ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-02 17:11:30] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-02 17:11:30] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 903 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) p0 (NOT p3) p1))), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p2) p0 p3 (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p2) p3 p1)))), (X (OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) p0 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1)))), (X (NOT (AND (NOT p2) p0 p3 p1))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 (NOT p3) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p0 p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p2) p3 p1))))), (X (X (OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1))))), (X (X (NOT (AND (NOT p2) p0 p3 p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p2 (NOT p3) (NOT p1))), (G (AND (OR (NOT p0) p2 (NOT p3)) (OR (NOT p0) p2 (NOT p1)))), (G (OR (NOT p0) p2 (NOT p3) p1)), (G (OR (NOT p0) p2 p3 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p2 (NOT p3)) (OR p2 (NOT p3) (NOT p1))))), (F (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2 p3 p1))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p0 p2 (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT p1)), (F p2), (F (NOT (OR p0 p2 (NOT p3) p1))), (F (NOT (OR p0 (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F p3)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 43 factoid took 814 ms. Reduced automaton from 8 states, 21 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p2))), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p2))), (NOT p2), (NOT p0)]
// Phase 1: matrix 367 rows 186 cols
[2025-06-02 17:11:31] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 17:11:32] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2025-06-02 17:11:32] [INFO ] [Real]Absence check using 6 positive and 16 generalized place invariants in 15 ms returned unsat
Proved EG (AND (NOT p2) (NOT p3))
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) p0 (NOT p3) p1))), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p2) p0 p3 (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p2) p3 p1)))), (X (OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) p0 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1)))), (X (NOT (AND (NOT p2) p0 p3 p1))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0) (NOT p3))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0 (NOT p3) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p0 p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p2) p3 p1))))), (X (X (OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) p0 p3) (AND (NOT p2) p0 p1))))), (X (X (NOT (AND (NOT p2) p0 p3 p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p2 (NOT p3) (NOT p1))), (G (AND (OR (NOT p0) p2 (NOT p3)) (OR (NOT p0) p2 (NOT p1)))), (G (OR (NOT p0) p2 (NOT p3) p1)), (G (OR (NOT p0) p2 p3 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p2 (NOT p3)) (OR p2 (NOT p3) (NOT p1))))), (F (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2 p3 p1))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR p0 p2 (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT p1)), (F p2), (F (NOT (OR p0 p2 (NOT p3) p1))), (F (NOT (OR p0 (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F p3), (G (AND (NOT p2) (NOT p3)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p2) (NOT p3)))
Knowledge based reduction with 43 factoid took 953 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-19-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-19-LTLFireability-03 finished in 140532 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(((F(p0) U p1)&&X(p0)))))'
Support contains 5 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 379/379 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 185 transition count 367
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 185 transition count 367
Applied a total of 20 rules in 6 ms. Remains 185 /195 variables (removed 10) and now considering 367/379 (removed 12) transitions.
// Phase 1: matrix 367 rows 185 cols
[2025-06-02 17:11:33] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:11:33] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-02 17:11:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:11:33] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2025-06-02 17:11:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:42] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:42] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:42] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:43] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:43] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:43] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:44] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:44] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:44] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:44] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/552 variables, 185/217 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:55] [INFO ] Deduced a trap composed of 13 places in 301 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:55] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:56] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:57] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:11:57] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 222 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/552 variables, 185/222 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 366/588 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:22] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:25] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:12:26] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 591 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60368ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Starting structural reductions in LTL mode, iteration 1 : 185/195 places, 367/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60983 ms. Remains : 185/195 places, 367/379 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-04
Entered a terminal (fully accepting) state of product in 128 steps with 5 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-04 finished in 61215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 379/379 transitions.
Graph (complete) has 676 edges and 195 vertex of which 193 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 192 transition count 345
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 69 place count 161 transition count 339
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 158 transition count 339
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 72 place count 158 transition count 330
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 90 place count 149 transition count 330
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 104 place count 135 transition count 310
Iterating global reduction 3 with 14 rules applied. Total rules applied 118 place count 135 transition count 310
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 118 place count 135 transition count 308
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 122 place count 133 transition count 308
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 185 place count 100 transition count 278
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 195 place count 95 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 215 place count 95 transition count 287
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 3 with 2 rules applied. Total rules applied 217 place count 94 transition count 297
Applied a total of 217 rules in 37 ms. Remains 94 /195 variables (removed 101) and now considering 297/379 (removed 82) transitions.
[2025-06-02 17:12:34] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
// Phase 1: matrix 296 rows 94 cols
[2025-06-02 17:12:34] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:12:34] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-02 17:12:34] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
[2025-06-02 17:12:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:12:34] [INFO ] State equation strengthened by 107 read => feed constraints.
[2025-06-02 17:12:34] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:12:34] [INFO ] Redundant transitions in 83 ms returned []
Running 288 sub problems to find dead transitions.
[2025-06-02 17:12:34] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
[2025-06-02 17:12:34] [INFO ] Invariant cache hit.
[2025-06-02 17:12:34] [INFO ] State equation strengthened by 107 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 295/388 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 106/218 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 1/390 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 220 constraints, problems are : Problem set: 0 solved, 288 unsolved in 29000 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 295/388 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 106/218 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 288/506 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/389 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/390 variables, and 507 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 106/107 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59373ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 59376ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/195 places, 297/379 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59963 ms. Remains : 94/195 places, 297/379 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-07
Product exploration explored 100000 steps with 8 reset in 64 ms.
Product exploration explored 100000 steps with 1 reset in 402 ms.
Computed a total of 8 stabilizing places and 95 stable transitions
Computed a total of 8 stabilizing places and 95 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3109 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (263 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 180715 steps, run visited all 1 properties in 485 ms. (steps per millisecond=372 )
Probabilistic random walk after 180715 steps, saw 31736 distinct states, run finished after 486 ms. (steps per millisecond=371 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 297/297 transitions.
Applied a total of 0 rules in 9 ms. Remains 94 /94 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2025-06-02 17:13:35] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
[2025-06-02 17:13:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:13:36] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 17:13:36] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
[2025-06-02 17:13:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:13:36] [INFO ] State equation strengthened by 107 read => feed constraints.
[2025-06-02 17:13:36] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:13:36] [INFO ] Redundant transitions in 73 ms returned []
Running 288 sub problems to find dead transitions.
[2025-06-02 17:13:36] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
[2025-06-02 17:13:36] [INFO ] Invariant cache hit.
[2025-06-02 17:13:36] [INFO ] State equation strengthened by 107 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 295/388 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 106/218 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 1/390 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 220 constraints, problems are : Problem set: 0 solved, 288 unsolved in 28203 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 295/388 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 106/218 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 288/506 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/389 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/390 variables, and 507 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 106/107 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58568ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 58571ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59207 ms. Remains : 94/94 places, 297/297 transitions.
Computed a total of 8 stabilizing places and 95 stable transitions
Computed a total of 8 stabilizing places and 95 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3128 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (281 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 180715 steps, run visited all 1 properties in 628 ms. (steps per millisecond=287 )
Probabilistic random walk after 180715 steps, saw 31736 distinct states, run finished after 628 ms. (steps per millisecond=287 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 64 ms.
Product exploration explored 100000 steps with 6 reset in 97 ms.
Built C files in :
/tmp/ltsmin12980266954516161914
[2025-06-02 17:14:36] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2025-06-02 17:14:36] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:14:36] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2025-06-02 17:14:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:14:36] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2025-06-02 17:14:36] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:14:36] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12980266954516161914
Running compilation step : cd /tmp/ltsmin12980266954516161914;'/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 1072 ms.
Running link step : cd /tmp/ltsmin12980266954516161914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12980266954516161914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12779595063291495831.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 297/297 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2025-06-02 17:14:51] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
[2025-06-02 17:14:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:14:51] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-02 17:14:51] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
[2025-06-02 17:14:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:14:51] [INFO ] State equation strengthened by 107 read => feed constraints.
[2025-06-02 17:14:52] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:14:52] [INFO ] Redundant transitions in 52 ms returned []
Running 288 sub problems to find dead transitions.
[2025-06-02 17:14:52] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
[2025-06-02 17:14:52] [INFO ] Invariant cache hit.
[2025-06-02 17:14:52] [INFO ] State equation strengthened by 107 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 295/388 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 106/218 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 1/390 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 220 constraints, problems are : Problem set: 0 solved, 288 unsolved in 29346 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 295/388 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 106/218 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 288/506 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/389 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/390 variables, and 507 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 106/107 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59613ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 59614ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60026 ms. Remains : 94/94 places, 297/297 transitions.
Built C files in :
/tmp/ltsmin11501664768426947332
[2025-06-02 17:15:51] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2025-06-02 17:15:51] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:15:51] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2025-06-02 17:15:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:15:51] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2025-06-02 17:15:51] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:15:51] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11501664768426947332
Running compilation step : cd /tmp/ltsmin11501664768426947332;'/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 1217 ms.
Running link step : cd /tmp/ltsmin11501664768426947332;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11501664768426947332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15668626076079470562.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 17:16:06] [INFO ] Flatten gal took : 31 ms
[2025-06-02 17:16:07] [INFO ] Flatten gal took : 31 ms
[2025-06-02 17:16:07] [INFO ] Time to serialize gal into /tmp/LTL7102656436845403652.gal : 6 ms
[2025-06-02 17:16:07] [INFO ] Time to serialize properties into /tmp/LTL11799163020013936679.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7102656436845403652.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3347235919501305786.hoa' '-atoms' '/tmp/LTL11799163020013936679.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11799163020013936679.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3347235919501305786.hoa
Reverse transition relation is NOT exact ! Due to transitions t20, t199, t200, t201, t202, t229, t230, t231, t232, t7.t250.t18, t125.t95.t239, t125.t95.t24...1289
Computing Next relation with stutter on 4850 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
551 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.59199,142084,1,0,389,621692,622,137,7465,382654,633
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyA-PT-19-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property MedleyA-PT-19-LTLFireability-07 finished in 218831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(p0&&(G(!p1)||(p2&&X((X(F(!p1))||G(p2))))))))))'
Support contains 6 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 379/379 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 184 transition count 365
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 184 transition count 365
Applied a total of 22 rules in 4 ms. Remains 184 /195 variables (removed 11) and now considering 365/379 (removed 14) transitions.
// Phase 1: matrix 365 rows 184 cols
[2025-06-02 17:16:13] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:16:13] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-02 17:16:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:16:13] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2025-06-02 17:16:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:22] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:22] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:22] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:22] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:23] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:23] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:23] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:23] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:24] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:24] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/216 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:35] [INFO ] Deduced a trap composed of 13 places in 279 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:35] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:36] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:36] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:36] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:16:37] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 222 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 365/549 variables, 184/222 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 364/586 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:05] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:06] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 588 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60428ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60430ms
Starting structural reductions in LTL mode, iteration 1 : 184/195 places, 365/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60975 ms. Remains : 184/195 places, 365/379 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 160 ms.
Product exploration explored 100000 steps with 33333 reset in 216 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 647 edges and 184 vertex of which 182 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p2 p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 33 ms. Reduced automaton from 5 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-19-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-19-LTLFireability-08 finished in 61672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((X(X(p1)) U ((X(X(p1))&&(!p1||X(p2)))||X(X(G(p1))))) U (G((X(X(p1)) U ((X(X(p1))&&(!p1||X(p2)))||X(X(G(p1))))))||(p1&&(X(X(p1)) U ((X(X(p1))&&(!p1||X(p2)))||X(X(G(p1)))))))))))'
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 379/379 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 186 transition count 368
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 186 transition count 368
Applied a total of 18 rules in 6 ms. Remains 186 /195 variables (removed 9) and now considering 368/379 (removed 11) transitions.
// Phase 1: matrix 368 rows 186 cols
[2025-06-02 17:17:14] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:17:15] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-06-02 17:17:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:17:15] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2025-06-02 17:17: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/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:24] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:24] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:24] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:24] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:25] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:25] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:25] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:25] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:26] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:26] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:26] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/554 variables, 186/219 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:37] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:37] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:37] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:38] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:38] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:17:39] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/554 variables, and 225 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/554 variables, 186/225 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 367/592 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:02] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:05] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 2/594 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 554/554 variables, and 594 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60446ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60448ms
Starting structural reductions in LTL mode, iteration 1 : 186/195 places, 368/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61097 ms. Remains : 186/195 places, 368/379 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-09
Product exploration explored 100000 steps with 28560 reset in 117 ms.
Product exploration explored 100000 steps with 28542 reset in 115 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 654 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 98 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (15 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (23 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1173331 steps, run timeout after 3001 ms. (steps per millisecond=390 ) properties seen :0 out of 1
Probabilistic random walk after 1173331 steps, saw 185903 distinct states, run finished after 3001 ms. (steps per millisecond=390 ) properties seen :0
[2025-06-02 17:18:19] [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) 31/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/88 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/152 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/158 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/508 variables, 158/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:20] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/508 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:20] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 25/533 variables, 16/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/535 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/535 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/535 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/548 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/554 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/554 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/554 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 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) 31/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/88 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/152 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/158 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 350/508 variables, 158/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 25/533 variables, 16/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/535 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/535 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/535 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/548 variables, 6/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/554 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1155ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 8 factoid took 195 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 186 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 368/368 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2025-06-02 17:18:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:18:21] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-02 17:18:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:18:22] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2025-06-02 17:18:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:30] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:31] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:31] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:31] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:31] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:32] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:32] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:32] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:32] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:33] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:33] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/554 variables, 186/219 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:43] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:44] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:44] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:45] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:45] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:18:46] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/554 variables, and 225 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 368/554 variables, 186/225 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 367/592 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:09] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:12] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 2/594 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 554/554 variables, and 594 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60383ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Finished structural reductions in LTL mode , in 1 iterations and 60989 ms. Remains : 186/186 places, 368/368 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 654 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (17 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (19 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1179293 steps, run timeout after 3001 ms. (steps per millisecond=392 ) properties seen :0 out of 1
Probabilistic random walk after 1179293 steps, saw 186615 distinct states, run finished after 3001 ms. (steps per millisecond=392 ) properties seen :0
[2025-06-02 17:19:26] [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) 31/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/88 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/152 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/158 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 350/508 variables, 158/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:26] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/508 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:26] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 25/533 variables, 16/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/535 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/535 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/535 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 13/548 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/554 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/554 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/554 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 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) 31/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/88 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/152 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/158 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 350/508 variables, 158/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 25/533 variables, 16/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/533 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/535 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/535 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/535 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 13/548 variables, 6/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/554 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/554 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1294ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 108 ms.
Product exploration explored 100000 steps with 25000 reset in 113 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 368/368 transitions.
Graph (complete) has 654 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 184 transition count 366
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 6 rules applied. Total rules applied 38 place count 184 transition count 363
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 38 place count 184 transition count 366
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 184 transition count 366
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 62 place count 166 transition count 344
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 80 place count 166 transition count 344
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 120 place count 166 transition count 353
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 136 place count 150 transition count 337
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 152 place count 150 transition count 337
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 156 place count 150 transition count 351
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 149 transition count 349
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 149 transition count 349
Deduced a syphon composed of 54 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 173 place count 149 transition count 334
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 175 place count 149 transition count 361
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 175 rules in 75 ms. Remains 149 /186 variables (removed 37) and now considering 361/368 (removed 7) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:19:28] [INFO ] Redundant transitions in 62 ms returned []
Running 357 sub problems to find dead transitions.
[2025-06-02 17:19:28] [INFO ] Flow matrix only has 360 transitions (discarded 1 similar events)
// Phase 1: matrix 360 rows 149 cols
[2025-06-02 17:19:28] [INFO ] Computed 22 invariants in 3 ms
[2025-06-02 17:19:28] [INFO ] State equation strengthened by 144 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:34] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:34] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 3 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:34] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 5 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:35] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 7 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:35] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 4 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:35] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 6 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:35] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 6 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:35] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 5 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:19:35] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 9 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 9/31 constraints. Problems are: Problem set: 71 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/31 constraints. Problems are: Problem set: 71 solved, 286 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
At refinement iteration 5 (OVERLAPS) 359/508 variables, 149/180 constraints. Problems are: Problem set: 79 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 143/323 constraints. Problems are: Problem set: 79 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 0/323 constraints. Problems are: Problem set: 79 solved, 278 unsolved
At refinement iteration 8 (OVERLAPS) 1/509 variables, 1/324 constraints. Problems are: Problem set: 79 solved, 278 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/324 constraints. Problems are: Problem set: 79 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 509/509 variables, and 324 constraints, problems are : Problem set: 79 solved, 278 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 149/149 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 79 solved, 278 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 3/3 constraints. Problems are: Problem set: 79 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 79 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 29/121 variables, 6/9 constraints. Problems are: Problem set: 79 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 9/18 constraints. Problems are: Problem set: 79 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/18 constraints. Problems are: Problem set: 79 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 23/144 variables, 13/31 constraints. Problems are: Problem set: 79 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/31 constraints. Problems are: Problem set: 79 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 358/502 variables, 144/175 constraints. Problems are: Problem set: 79 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 143/318 constraints. Problems are: Problem set: 79 solved, 278 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 278/596 constraints. Problems are: Problem set: 79 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/509 variables, and 596 constraints, problems are : Problem set: 79 solved, 278 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 144/149 constraints, ReadFeed: 143/144 constraints, PredecessorRefiner: 278/357 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60249ms problems are : Problem set: 79 solved, 278 unsolved
Search for dead transitions found 79 dead transitions in 60253ms
Found 79 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 79 transitions
Dead transitions reduction (with SMT) removed 79 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 149/186 places, 282/368 transitions.
Graph (complete) has 556 edges and 149 vertex of which 93 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.2 ms
Discarding 56 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 294
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 17 ms. Remains 90 /149 variables (removed 59) and now considering 294/282 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/186 places, 294/368 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60417 ms. Remains : 90/186 places, 294/368 transitions.
Built C files in :
/tmp/ltsmin15830413692959902831
[2025-06-02 17:20:29] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15830413692959902831
Running compilation step : cd /tmp/ltsmin15830413692959902831;'/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 1191 ms.
Running link step : cd /tmp/ltsmin15830413692959902831;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15830413692959902831;'/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/stateBased7572200787305412997.hoa' '--buchi-type=spotba'
LTSmin run took 234 ms.
FORMULA MedleyA-PT-19-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-19-LTLFireability-09 finished in 195717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 379/379 transitions.
Graph (complete) has 676 edges and 195 vertex of which 193 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 192 transition count 346
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 67 place count 162 transition count 340
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 159 transition count 340
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 70 place count 159 transition count 330
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 90 place count 149 transition count 330
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 103 place count 136 transition count 312
Iterating global reduction 3 with 13 rules applied. Total rules applied 116 place count 136 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 116 place count 136 transition count 311
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 135 transition count 311
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 181 place count 102 transition count 281
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 195 place count 95 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 235 place count 95 transition count 287
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 3 with 2 rules applied. Total rules applied 237 place count 94 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 238 place count 93 transition count 296
Applied a total of 238 rules in 58 ms. Remains 93 /195 variables (removed 102) and now considering 296/379 (removed 83) transitions.
[2025-06-02 17:20:30] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
// Phase 1: matrix 295 rows 93 cols
[2025-06-02 17:20:30] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:20:30] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-02 17:20:30] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2025-06-02 17:20:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:20:30] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-02 17:20:30] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:20:31] [INFO ] Redundant transitions in 43 ms returned []
Running 288 sub problems to find dead transitions.
[2025-06-02 17:20:31] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2025-06-02 17:20:31] [INFO ] Invariant cache hit.
[2025-06-02 17:20:31] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 294/387 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 65/177 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/388 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 178 constraints, problems are : Problem set: 0 solved, 288 unsolved in 26774 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 294/387 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 65/177 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 288/465 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/388 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 466 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57056ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 57058ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/195 places, 296/379 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57523 ms. Remains : 93/195 places, 296/379 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-10
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-10 finished in 57583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 379/379 transitions.
Graph (complete) has 676 edges and 195 vertex of which 193 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 192 transition count 345
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 69 place count 161 transition count 339
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 158 transition count 339
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 72 place count 158 transition count 329
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 92 place count 148 transition count 329
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 106 place count 134 transition count 309
Iterating global reduction 3 with 14 rules applied. Total rules applied 120 place count 134 transition count 309
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 120 place count 134 transition count 306
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 126 place count 131 transition count 306
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 193 place count 96 transition count 274
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 203 place count 91 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 223 place count 91 transition count 283
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 3 with 2 rules applied. Total rules applied 225 place count 90 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 226 place count 89 transition count 292
Applied a total of 226 rules in 36 ms. Remains 89 /195 variables (removed 106) and now considering 292/379 (removed 87) transitions.
[2025-06-02 17:21:28] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
// Phase 1: matrix 291 rows 89 cols
[2025-06-02 17:21:28] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:21:28] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 17:21:28] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2025-06-02 17:21:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:21:28] [INFO ] State equation strengthened by 136 read => feed constraints.
[2025-06-02 17:21:28] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:21:28] [INFO ] Redundant transitions in 48 ms returned []
Running 284 sub problems to find dead transitions.
[2025-06-02 17:21:28] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2025-06-02 17:21:28] [INFO ] Invariant cache hit.
[2025-06-02 17:21:28] [INFO ] State equation strengthened by 136 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 290/379 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 135/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/380 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 244 constraints, problems are : Problem set: 0 solved, 284 unsolved in 24548 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 290/379 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 135/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 284/527 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/380 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 528 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54765ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 54766ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/195 places, 292/379 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55612 ms. Remains : 89/195 places, 292/379 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-15
Product exploration explored 100000 steps with 1 reset in 50 ms.
Product exploration explored 100000 steps with 2 reset in 159 ms.
Computed a total of 11 stabilizing places and 144 stable transitions
Computed a total of 11 stabilizing places and 144 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 1534 steps (159 resets) in 12 ms. (118 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 292/292 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2025-06-02 17:22:24] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2025-06-02 17:22:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:22:24] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-02 17:22:24] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2025-06-02 17:22:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:22:24] [INFO ] State equation strengthened by 136 read => feed constraints.
[2025-06-02 17:22:24] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:22:24] [INFO ] Redundant transitions in 46 ms returned []
Running 284 sub problems to find dead transitions.
[2025-06-02 17:22:24] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2025-06-02 17:22:24] [INFO ] Invariant cache hit.
[2025-06-02 17:22:24] [INFO ] State equation strengthened by 136 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 290/379 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 135/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/380 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 244 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 290/379 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 135/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 284/527 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 1/380 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 528 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 89/89 constraints, ReadFeed: 136/136 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60813 ms. Remains : 89/89 places, 292/292 transitions.
Computed a total of 11 stabilizing places and 144 stable transitions
Computed a total of 11 stabilizing places and 144 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 204 steps (20 resets) in 5 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 81 ms.
Product exploration explored 100000 steps with 1 reset in 98 ms.
Built C files in :
/tmp/ltsmin14188735082232404805
[2025-06-02 17:23:25] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2025-06-02 17:23:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:23:25] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2025-06-02 17:23:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:23:25] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2025-06-02 17:23:25] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:23:25] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14188735082232404805
Running compilation step : cd /tmp/ltsmin14188735082232404805;'/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 1226 ms.
Running link step : cd /tmp/ltsmin14188735082232404805;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin14188735082232404805;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4446980000883366693.hoa' '--buchi-type=spotba'
LTSmin run took 652 ms.
FORMULA MedleyA-PT-19-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-19-LTLFireability-15 finished in 119701 ms.
All properties solved by simple procedures.
Total runtime 1159797 ms.

BK_STOP 1748885007896

--------------------
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="MedleyA-PT-19"
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 MedleyA-PT-19, 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 r128-smll-174876524200244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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