Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.7K 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.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K 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.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:33 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 SieveSingleMsgMbox-PT-d2m96-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749197574954

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m96
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 08:12:56] [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-06 08:12:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 08:12:56] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2025-06-06 08:12:56] [INFO ] Transformed 2398 places.
[2025-06-06 08:12:56] [INFO ] Transformed 1954 transitions.
[2025-06-06 08:12:56] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1984 places in 27 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 102 places :
Symmetric choice reduction at 1 with 102 rule applications. Total rules 955 place count 287 transition count 638
Iterating global reduction 1 with 102 rules applied. Total rules applied 1057 place count 287 transition count 638
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 1069 place count 287 transition count 626
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 1144 place count 212 transition count 551
Iterating global reduction 2 with 75 rules applied. Total rules applied 1219 place count 212 transition count 551
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1249 place count 212 transition count 521
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1273 place count 188 transition count 494
Iterating global reduction 3 with 24 rules applied. Total rules applied 1297 place count 188 transition count 494
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 3 with 58 rules applied. Total rules applied 1355 place count 188 transition count 436
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1361 place count 182 transition count 425
Iterating global reduction 4 with 6 rules applied. Total rules applied 1367 place count 182 transition count 425
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1373 place count 176 transition count 419
Iterating global reduction 4 with 6 rules applied. Total rules applied 1379 place count 176 transition count 419
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1382 place count 173 transition count 416
Iterating global reduction 4 with 3 rules applied. Total rules applied 1385 place count 173 transition count 416
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1387 place count 171 transition count 414
Iterating global reduction 4 with 2 rules applied. Total rules applied 1389 place count 171 transition count 414
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1391 place count 169 transition count 412
Iterating global reduction 4 with 2 rules applied. Total rules applied 1393 place count 169 transition count 412
Applied a total of 1393 rules in 97 ms. Remains 169 /414 variables (removed 245) and now considering 412/1954 (removed 1542) transitions.
// Phase 1: matrix 412 rows 169 cols
[2025-06-06 08:12:56] [INFO ] Computed 5 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:12:56] [INFO ] Implicit Places using invariants in 283 ms returned []
[2025-06-06 08:12:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:12:57] [INFO ] State equation strengthened by 277 read => feed constraints.
[2025-06-06 08:13:02] [INFO ] Implicit Places using invariants and state equation in 5542 ms returned []
Implicit Place search using SMT with State Equation took 5854 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2025-06-06 08:13:02] [INFO ] Invariant cache hit.
[2025-06-06 08:13:02] [INFO ] State equation strengthened by 277 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (OVERLAPS) 1/169 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:13:09] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:13:09] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 6 (OVERLAPS) 412/581 variables, 169/176 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 277/453 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/581 variables, and 453 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 169/169 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (OVERLAPS) 1/169 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 6 (OVERLAPS) 412/581 variables, 169/176 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 277/453 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 411/864 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 864 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 169/169 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60602ms problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 60619ms
Starting structural reductions in LTL mode, iteration 1 : 169/414 places, 412/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66602 ms. Remains : 169/414 places, 412/1954 transitions.
Support contains 25 out of 169 places after structural reductions.
[2025-06-06 08:14:03] [INFO ] Flatten gal took : 48 ms
[2025-06-06 08:14:03] [INFO ] Flatten gal took : 24 ms
[2025-06-06 08:14:03] [INFO ] Input system was already deterministic with 412 transitions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40000 steps (8988 resets) in 3095 ms. (12 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (185 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (198 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (199 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (195 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (191 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (184 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (182 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (183 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (187 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (195 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (191 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (189 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (191 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (203 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (188 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (203 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (188 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (212 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (183 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (398 resets) in 45 ms. (86 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (184 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (183 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 285947 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :11 out of 22
Probabilistic random walk after 285947 steps, saw 125839 distinct states, run finished after 3011 ms. (steps per millisecond=94 ) properties seen :11
[2025-06-06 08:14:07] [INFO ] Invariant cache hit.
[2025-06-06 08:14:07] [INFO ] State equation strengthened by 277 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 68/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 19/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 5 (OVERLAPS) 36/139 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 336/475 variables, 139/144 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 201/345 constraints. Problems are: Problem set: 1 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 10 (OVERLAPS) 106/581 variables, 30/375 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 76/451 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 0/451 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/581 variables, 0/451 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 451 constraints, problems are : Problem set: 3 solved, 8 unsolved in 1205 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 169/169 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 69/81 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 19/100 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 36/136 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 294/430 variables, 136/141 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 159/300 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 151/581 variables, 33/333 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 118/451 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 8/459 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:14:10] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 1/460 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:14:11] [INFO ] Deduced a trap along path composed of 12 places in 33 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 1/461 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/581 variables, 0/461 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 461 constraints, problems are : Problem set: 3 solved, 8 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 169/169 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 8/11 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6247ms problems are : Problem set: 3 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 412/412 transitions.
Graph (complete) has 679 edges and 169 vertex of which 168 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 168 transition count 410
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 159 transition count 309
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 159 transition count 309
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 30 place count 150 transition count 300
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 150 transition count 300
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 150 transition count 296
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 49 place count 144 transition count 286
Iterating global reduction 2 with 6 rules applied. Total rules applied 55 place count 144 transition count 286
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 144 transition count 283
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 142 transition count 281
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 142 transition count 281
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 140 transition count 279
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 140 transition count 279
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 138 transition count 274
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 138 transition count 274
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 136 transition count 272
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 136 transition count 272
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 134 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 134 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 133 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 133 transition count 269
Applied a total of 80 rules in 83 ms. Remains 133 /169 variables (removed 36) and now considering 269/412 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 133/169 places, 269/412 transitions.
RANDOM walk for 40000 steps (9014 resets) in 427 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1953 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1902 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1884 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1881 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1869 resets) in 154 ms. (258 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1952 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1927 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (4129 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 416933 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :2 out of 8
Probabilistic random walk after 416933 steps, saw 176239 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :2
// Phase 1: matrix 269 rows 133 cols
[2025-06-06 08:14:17] [INFO ] Computed 4 invariants in 8 ms
[2025-06-06 08:14:17] [INFO ] State equation strengthened by 166 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 7/84 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 209/293 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 106/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 109/402 variables, 49/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 60/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/402 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 303 constraints, problems are : Problem set: 0 solved, 6 unsolved in 745 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 166/166 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 7/84 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 209/293 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 106/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 109/402 variables, 49/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 60/303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:14:19] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/402 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 310 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4277 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 166/166 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5043ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 23036 ms.
Support contains 8 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 269/269 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 129 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 129 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 129 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 126 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 126 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 126 transition count 219
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 123 transition count 213
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 123 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 123 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 122 transition count 209
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 122 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 121 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 121 transition count 208
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 120 transition count 207
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 120 transition count 207
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 38 place count 120 transition count 201
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 39 place count 119 transition count 200
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 119 transition count 200
Applied a total of 40 rules in 34 ms. Remains 119 /133 variables (removed 14) and now considering 200/269 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 119/133 places, 200/269 transitions.
RANDOM walk for 40000 steps (8971 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1883 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1927 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1898 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1914 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1825 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (4165 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 497201 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 6
Probabilistic random walk after 497201 steps, saw 209569 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
// Phase 1: matrix 200 rows 119 cols
[2025-06-06 08:14:48] [INFO ] Computed 4 invariants in 5 ms
[2025-06-06 08:14:48] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 50/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 7/79 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:14:48] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 184/263 variables, 79/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 96/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 56/319 variables, 40/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 16/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/319 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/319 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 236 constraints, problems are : Problem set: 0 solved, 6 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 119/119 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 50/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 7/79 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 184/263 variables, 79/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 96/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 56/319 variables, 40/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 16/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/319 variables, 6/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:14:50] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/319 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 243 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2542 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 119/119 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3116ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 25804 ms.
Support contains 8 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 200/200 transitions.
Applied a total of 0 rules in 10 ms. Remains 119 /119 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 119/119 places, 200/200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 200/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 119 /119 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2025-06-06 08:15:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:15:17] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-06 08:15:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:15:17] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-06 08:15:18] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:15:18] [INFO ] Redundant transitions in 9 ms returned []
Running 199 sub problems to find dead transitions.
[2025-06-06 08:15:18] [INFO ] Invariant cache hit.
[2025-06-06 08:15:18] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 1/119 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/319 variables, 119/123 constraints. Problems are: Problem set: 0 solved, 199 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 112/235 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:15:25] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD182 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/319 variables, 1/236 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/236 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/236 constraints. Problems are: Problem set: 3 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 236 constraints, problems are : Problem set: 3 solved, 196 unsolved in 19661 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 119/119 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 4/119 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 200/319 variables, 119/124 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 112/236 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 196/432 constraints. Problems are: Problem set: 3 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/432 constraints. Problems are: Problem set: 3 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 432 constraints, problems are : Problem set: 3 solved, 196 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 119/119 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 196/199 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49775ms problems are : Problem set: 3 solved, 196 unsolved
Search for dead transitions found 3 dead transitions in 49776ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 119/119 places, 197/200 transitions.
Graph (complete) has 392 edges and 119 vertex of which 116 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 116 /119 variables (removed 3) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 116 cols
[2025-06-06 08:16:08] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:16:08] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-06 08:16:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:16:08] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-06 08:16:09] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 116/119 places, 197/200 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51859 ms. Remains : 116/119 places, 197/200 transitions.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 36 stabilizing places and 58 stable transitions
Graph (complete) has 739 edges and 169 vertex of which 168 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((F(p0)&&p1))||(F(!(p2 U p3))&&p1)))))'
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 412/412 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 154 transition count 252
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 154 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 154 transition count 251
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 140 transition count 237
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 140 transition count 237
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 71 place count 140 transition count 225
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 131 transition count 209
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 131 transition count 209
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 94 place count 131 transition count 204
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 129 transition count 202
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 129 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 127 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 127 transition count 200
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 125 transition count 195
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 125 transition count 195
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 123 transition count 193
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 123 transition count 193
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 121 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 121 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 120 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 120 transition count 190
Applied a total of 116 rules in 31 ms. Remains 120 /169 variables (removed 49) and now considering 190/412 (removed 222) transitions.
// Phase 1: matrix 190 rows 120 cols
[2025-06-06 08:16:09] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:16:10] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-06 08:16:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:16:10] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-06 08:16:10] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:16:10] [INFO ] Redundant transitions in 10 ms returned []
Running 189 sub problems to find dead transitions.
[2025-06-06 08:16:10] [INFO ] Invariant cache hit.
[2025-06-06 08:16:10] [INFO ] State equation strengthened by 104 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 1/120 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:16:12] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:16:12] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 190/310 variables, 120/127 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 104/231 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:16:15] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:16:17] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:16:17] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:16:17] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 10 ms to minimize.
Problem TDEAD173 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 4/235 constraints. Problems are: Problem set: 3 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/235 constraints. Problems are: Problem set: 3 solved, 186 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/235 constraints. Problems are: Problem set: 3 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 235 constraints, problems are : Problem set: 3 solved, 186 unsolved in 20868 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 120/120 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 186 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 4/120 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 6/11 constraints. Problems are: Problem set: 3 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 190/310 variables, 120/131 constraints. Problems are: Problem set: 3 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 104/235 constraints. Problems are: Problem set: 3 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 186/421 constraints. Problems are: Problem set: 3 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:16:44] [INFO ] Deduced a trap along path composed of 10 places in 27 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 1/422 constraints. Problems are: Problem set: 3 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 422 constraints, problems are : Problem set: 3 solved, 186 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 120/120 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 186/189 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50962ms problems are : Problem set: 3 solved, 186 unsolved
Search for dead transitions found 3 dead transitions in 50963ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 120/169 places, 187/412 transitions.
Graph (complete) has 422 edges and 120 vertex of which 117 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 117 /120 variables (removed 3) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 117 cols
[2025-06-06 08:17:01] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:17:01] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-06 08:17:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:17:01] [INFO ] State equation strengthened by 103 read => feed constraints.
[2025-06-06 08:17:02] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/169 places, 187/412 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52242 ms. Remains : 117/169 places, 187/412 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (AND (NOT p0) p3), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-00
Product exploration explored 100000 steps with 22547 reset in 371 ms.
Product exploration explored 100000 steps with 22522 reset in 249 ms.
Computed a total of 19 stabilizing places and 27 stable transitions
Graph (complete) has 420 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 19 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 108 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (AND (NOT p0) p3), (NOT p1)]
RANDOM walk for 40000 steps (8985 resets) in 220 ms. (180 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1864 resets) in 161 ms. (246 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1842 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1824 resets) in 325 ms. (122 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1849 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1913 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1790 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1910 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1901 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1873 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 649985 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :4 out of 9
Probabilistic random walk after 649985 steps, saw 276958 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :4
[2025-06-06 08:17:07] [INFO ] Invariant cache hit.
[2025-06-06 08:17:07] [INFO ] State equation strengthened by 103 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 68/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 11/84 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 168/256 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 84/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 10 (OVERLAPS) 48/304 variables, 29/205 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 19/224 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 0/224 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/304 variables, 0/224 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 224 constraints, problems are : Problem set: 4 solved, 1 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/81 variables, 2/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/85 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 129/214 variables, 85/89 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 45/134 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/134 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 90/304 variables, 32/166 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 58/224 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 1/225 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:17:07] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 1/226 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/304 variables, 0/226 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/304 variables, 0/226 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 226 constraints, problems are : Problem set: 4 solved, 1 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1082ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 333 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 187/187 transitions.
Graph (complete) has 379 edges and 117 vertex of which 116 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 116 transition count 185
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 113 transition count 146
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 113 transition count 146
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 110 transition count 143
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 110 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 110 transition count 141
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 107 transition count 135
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 107 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 107 transition count 132
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 105 transition count 130
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 105 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 103 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 103 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 102 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 102 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 38 place count 102 transition count 125
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 39 place count 101 transition count 124
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 101 transition count 124
Applied a total of 40 rules in 16 ms. Remains 101 /117 variables (removed 16) and now considering 124/187 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 101/117 places, 124/187 transitions.
RANDOM walk for 40000 steps (8950 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1883 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2518533 steps, run timeout after 3001 ms. (steps per millisecond=839 ) properties seen :0 out of 1
Probabilistic random walk after 2518533 steps, saw 1056188 distinct states, run finished after 3001 ms. (steps per millisecond=839 ) properties seen :0
// Phase 1: matrix 124 rows 101 cols
[2025-06-06 08:17:11] [INFO ] Computed 3 invariants in 5 ms
[2025-06-06 08:17:11] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 135/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 42/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/225 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/225 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 135/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 42/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/225 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:17:11] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/225 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 539ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 921 ms.
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 124/124 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 101/101 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 124/124 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2025-06-06 08:17:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:17:13] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-06 08:17:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:17:13] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-06 08:17:13] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:17:13] [INFO ] Redundant transitions in 1 ms returned []
Running 123 sub problems to find dead transitions.
[2025-06-06 08:17:13] [INFO ] Invariant cache hit.
[2025-06-06 08:17:13] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 4 (OVERLAPS) 124/225 variables, 101/104 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 54/158 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 158 constraints, problems are : Problem set: 3 solved, 120 unsolved in 4466 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 123/221 variables, 98/101 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 53/154 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 14/168 constraints. Problems are: Problem set: 3 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:17:20] [INFO ] Deduced a trap along path composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/169 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 4/225 variables, 3/172 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 1/173 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 106/279 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/279 constraints. Problems are: Problem set: 3 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 225/225 variables, and 279 constraints, problems are : Problem set: 3 solved, 120 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 120/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34525ms problems are : Problem set: 3 solved, 120 unsolved
Search for dead transitions found 3 dead transitions in 34525ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/101 places, 121/124 transitions.
Graph (complete) has 289 edges and 101 vertex of which 98 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 98 /101 variables (removed 3) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 98 cols
[2025-06-06 08:17:47] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:17:47] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-06 08:17:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:17:48] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-06 08:17:48] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/101 places, 121/124 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 35278 ms. Remains : 98/101 places, 121/124 transitions.
RANDOM walk for 40000 steps (8988 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1901 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2795007 steps, run timeout after 3001 ms. (steps per millisecond=931 ) properties seen :0 out of 1
Probabilistic random walk after 2795007 steps, saw 1169819 distinct states, run finished after 3001 ms. (steps per millisecond=931 ) properties seen :0
[2025-06-06 08:17:51] [INFO ] Invariant cache hit.
[2025-06-06 08:17:51] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 437ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 379 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2025-06-06 08:17:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:17:52] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 08:17:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:17:52] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-06 08:17:52] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:17:52] [INFO ] Redundant transitions in 2 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-06 08:17:52] [INFO ] Invariant cache hit.
[2025-06-06 08:17:52] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4817 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:18:03] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 275 constraints, problems are : Problem set: 0 solved, 120 unsolved in 20292 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 25150ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 25152ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25479 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 102
Applied a total of 57 rules in 16 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2025-06-06 08:18:17] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 08:18:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 08:18:17] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 08:18:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 08:18:17] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 08:18:17] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 08:18:17] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 208 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 (NOT p3))), (G (OR p0 (NOT p3) (NOT p1))), (G (OR p0 p1)), (G (OR p0 (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p2), (F p3), (F (NOT p0))]
Knowledge based reduction with 23 factoid took 244 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 117 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 187/187 transitions.
Applied a total of 0 rules in 10 ms. Remains 117 /117 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 117 cols
[2025-06-06 08:18:18] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:18:18] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-06 08:18:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:18:18] [INFO ] State equation strengthened by 103 read => feed constraints.
[2025-06-06 08:18:18] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:18:18] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2025-06-06 08:18:18] [INFO ] Invariant cache hit.
[2025-06-06 08:18:18] [INFO ] State equation strengthened by 103 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD168 is UNSAT
At refinement iteration 5 (OVERLAPS) 187/304 variables, 117/121 constraints. Problems are: Problem set: 3 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 103/224 constraints. Problems are: Problem set: 3 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 224 constraints, problems are : Problem set: 3 solved, 183 unsolved in 9383 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 2/116 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 187/303 variables, 116/120 constraints. Problems are: Problem set: 3 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 103/223 constraints. Problems are: Problem set: 3 solved, 183 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 20/243 constraints. Problems are: Problem set: 3 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:18:35] [INFO ] Deduced a trap along path composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 1/244 constraints. Problems are: Problem set: 3 solved, 183 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 183 unsolved
At refinement iteration 12 (OVERLAPS) 1/304 variables, 1/245 constraints. Problems are: Problem set: 3 solved, 183 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 163/408 constraints. Problems are: Problem set: 3 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 408 constraints, problems are : Problem set: 3 solved, 183 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 183/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39487ms problems are : Problem set: 3 solved, 183 unsolved
Search for dead transitions found 3 dead transitions in 39487ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 117/117 places, 184/187 transitions.
Graph (complete) has 412 edges and 117 vertex of which 114 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 114 /117 variables (removed 3) and now considering 184/184 (removed 0) transitions.
// Phase 1: matrix 184 rows 114 cols
[2025-06-06 08:18:58] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:18:58] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-06 08:18:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:18:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2025-06-06 08:18:59] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/117 places, 184/187 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40814 ms. Remains : 114/117 places, 184/187 transitions.
Computed a total of 17 stabilizing places and 25 stable transitions
Graph (complete) has 410 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 17 stabilizing places and 25 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 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 85 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (9007 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1842 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1809831 steps, run timeout after 3001 ms. (steps per millisecond=603 ) properties seen :0 out of 1
Probabilistic random walk after 1809831 steps, saw 752581 distinct states, run finished after 3001 ms. (steps per millisecond=603 ) properties seen :0
[2025-06-06 08:19:02] [INFO ] Invariant cache hit.
[2025-06-06 08:19:02] [INFO ] State equation strengthened by 102 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/79 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/83 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 126/209 variables, 83/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 44/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 89/298 variables, 31/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 58/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/298 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/79 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/83 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 126/209 variables, 83/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 44/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 89/298 variables, 31/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 58/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/298 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/298 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 968 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1176ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 571 ms.
Support contains 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 184/184 transitions.
Graph (complete) has 370 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 113 transition count 182
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 110 transition count 143
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 110 transition count 143
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 107 transition count 140
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 107 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 107 transition count 138
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 104 transition count 132
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 104 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 104 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 102 transition count 127
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 102 transition count 127
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 100 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 100 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 99 transition count 124
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 99 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 38 place count 99 transition count 122
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 39 place count 98 transition count 121
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 98 transition count 121
Applied a total of 40 rules in 14 ms. Remains 98 /114 variables (removed 16) and now considering 121/184 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 98/114 places, 121/184 transitions.
RANDOM walk for 40000 steps (8935 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2358044 steps, run timeout after 3001 ms. (steps per millisecond=785 ) properties seen :0 out of 1
Probabilistic random walk after 2358044 steps, saw 989971 distinct states, run finished after 3001 ms. (steps per millisecond=785 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2025-06-06 08:19:07] [INFO ] Computed 3 invariants in 2 ms
[2025-06-06 08:19:07] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 471ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2025-06-06 08:19:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:19:07] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 08:19:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:19:07] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-06 08:19:07] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:19:07] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-06 08:19:07] [INFO ] Invariant cache hit.
[2025-06-06 08:19:07] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4888 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:19:18] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 275 constraints, problems are : Problem set: 0 solved, 120 unsolved in 20751 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 25681ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 25681ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26004 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 102
Applied a total of 57 rules in 17 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2025-06-06 08:19:33] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 08:19:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 08:19:33] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 08:19:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 08:19:33] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 08:19:33] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 08:19:33] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 186 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 22482 reset in 240 ms.
Product exploration explored 100000 steps with 22433 reset in 171 ms.
Built C files in :
/tmp/ltsmin5475131019175233467
[2025-06-06 08:19:34] [INFO ] Computing symmetric may disable matrix : 184 transitions.
[2025-06-06 08:19:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 08:19:34] [INFO ] Computing symmetric may enable matrix : 184 transitions.
[2025-06-06 08:19:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 08:19:34] [INFO ] Computing Do-Not-Accords matrix : 184 transitions.
[2025-06-06 08:19:34] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 08:19:34] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5475131019175233467
Running compilation step : cd /tmp/ltsmin5475131019175233467;'/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 481 ms.
Running link step : cd /tmp/ltsmin5475131019175233467;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin5475131019175233467;'/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/stateBased798195453807201010.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 184/184 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 111 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 111 transition count 145
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 108 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 108 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 108 transition count 140
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 105 transition count 134
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 105 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 23 place count 105 transition count 131
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 103 transition count 129
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 103 transition count 129
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 101 transition count 127
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 101 transition count 127
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 100 transition count 126
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 100 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 100 transition count 124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 99 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 99 transition count 123
Applied a total of 37 rules in 20 ms. Remains 99 /114 variables (removed 15) and now considering 123/184 (removed 61) transitions.
// Phase 1: matrix 123 rows 99 cols
[2025-06-06 08:19:49] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:19:49] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-06 08:19:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:19:49] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 08:19:50] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:19:50] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2025-06-06 08:19:50] [INFO ] Invariant cache hit.
[2025-06-06 08:19:50] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5091 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:20:04] [INFO ] Deduced a trap along path composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/222 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/222 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 281 constraints, problems are : Problem set: 0 solved, 122 unsolved in 24770 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29916ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 29917ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/114 places, 123/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30367 ms. Remains : 99/114 places, 123/184 transitions.
Built C files in :
/tmp/ltsmin5097912319564288271
[2025-06-06 08:20:20] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2025-06-06 08:20:20] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 08:20:20] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2025-06-06 08:20:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 08:20:20] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2025-06-06 08:20:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 08:20:20] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5097912319564288271
Running compilation step : cd /tmp/ltsmin5097912319564288271;'/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 266 ms.
Running link step : cd /tmp/ltsmin5097912319564288271;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5097912319564288271;'/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/stateBased5547103940726026667.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 08:20:35] [INFO ] Flatten gal took : 13 ms
[2025-06-06 08:20:35] [INFO ] Flatten gal took : 14 ms
[2025-06-06 08:20:35] [INFO ] Time to serialize gal into /tmp/LTL12936759737037324745.gal : 6 ms
[2025-06-06 08:20:35] [INFO ] Time to serialize properties into /tmp/LTL17504398725585060715.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12936759737037324745.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9410115644067901668.hoa' '-atoms' '/tmp/LTL17504398725585060715.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...319
Loading property file /tmp/LTL17504398725585060715.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9410115644067901668.hoa
Detected timeout of ITS tools.
[2025-06-06 08:20:50] [INFO ] Flatten gal took : 9 ms
[2025-06-06 08:20:50] [INFO ] Flatten gal took : 9 ms
[2025-06-06 08:20:50] [INFO ] Time to serialize gal into /tmp/LTL6707061932001923854.gal : 2 ms
[2025-06-06 08:20:50] [INFO ] Time to serialize properties into /tmp/LTL4034793238945779369.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6707061932001923854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4034793238945779369.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((F((F("((s1<1)||(l2234<1))"))&&("((s1<1)||(l2218<1))")))||((F(!(("((s1>=1)&&(l2213>=1))")U("((s1>=1)&&(l2215>=1))"))))&&("((s1<...176
Formula 0 simplified : G(F(!"((s1<1)||(l2218<1))" | G("((s1>=1)&&(l2213>=1))" U "((s1>=1)&&(l2215>=1))")) & F(G!"((s1<1)||(l2234<1))" | G!"((s1<1)||(l2218<...161
Detected timeout of ITS tools.
[2025-06-06 08:21:05] [INFO ] Flatten gal took : 13 ms
[2025-06-06 08:21:05] [INFO ] Applying decomposition
[2025-06-06 08:21:05] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5404479507149873163.txt' '-o' '/tmp/graph5404479507149873163.bin' '-w' '/tmp/graph5404479507149873163.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5404479507149873163.bin' '-l' '-1' '-v' '-w' '/tmp/graph5404479507149873163.weights' '-q' '0' '-e' '0.001'
[2025-06-06 08:21:05] [INFO ] Decomposing Gal with order
[2025-06-06 08:21:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 08:21:05] [INFO ] Removed a total of 106 redundant transitions.
[2025-06-06 08:21:05] [INFO ] Flatten gal took : 46 ms
[2025-06-06 08:21:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 9 ms.
[2025-06-06 08:21:05] [INFO ] Time to serialize gal into /tmp/LTL7522999975891348564.gal : 4 ms
[2025-06-06 08:21:05] [INFO ] Time to serialize properties into /tmp/LTL16370418883530096956.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7522999975891348564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16370418883530096956.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G((F((F("((u0.s1<1)||(u0.l2234<1))"))&&("((u0.s1<1)||(u0.l2218<1))")))||((F(!(("((u0.s1>=1)&&(u0.l2213>=1))")U("((u0.s1>=1)&&(u0....206
Formula 0 simplified : G(F(!"((u0.s1<1)||(u0.l2218<1))" | G("((u0.s1>=1)&&(u0.l2213>=1))" U "((u0.s1>=1)&&(u0.l2215>=1))")) & F(G!"((u0.s1<1)||(u0.l2234<1)...191
Detected timeout of ITS tools.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-00 finished in 310829 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((X(X(X(G(p1))))||p0)))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 412/412 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 224
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 152 transition count 223
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 51 place count 136 transition count 207
Iterating global reduction 1 with 16 rules applied. Total rules applied 67 place count 136 transition count 207
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 79 place count 136 transition count 195
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 125 transition count 175
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 125 transition count 175
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 108 place count 125 transition count 168
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 122 transition count 165
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 122 transition count 165
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 119 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 119 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 117 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 117 transition count 157
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 115 transition count 155
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 115 transition count 155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 130 place count 113 transition count 153
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 113 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 133 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 112 transition count 152
Applied a total of 134 rules in 14 ms. Remains 112 /169 variables (removed 57) and now considering 152/412 (removed 260) transitions.
// Phase 1: matrix 152 rows 112 cols
[2025-06-06 08:21:20] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:21:20] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-06 08:21:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:21:20] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-06 08:21:21] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2025-06-06 08:21:21] [INFO ] Invariant cache hit.
[2025-06-06 08:21:21] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:21:22] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:21:22] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 152/264 variables, 112/119 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 75/194 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:21:24] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:21:25] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:21:26] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 8 ms to minimize.
Problem TDEAD138 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 3/197 constraints. Problems are: Problem set: 3 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:21:28] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 1/198 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/198 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 11 (OVERLAPS) 0/264 variables, 0/198 constraints. Problems are: Problem set: 3 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 198 constraints, problems are : Problem set: 3 solved, 148 unsolved in 14630 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 4/112 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 6/11 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 152/264 variables, 112/123 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 75/198 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 148/346 constraints. Problems are: Problem set: 3 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:21:42] [INFO ] Deduced a trap along path composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 1/347 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/347 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 11 (OVERLAPS) 0/264 variables, 0/347 constraints. Problems are: Problem set: 3 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 347 constraints, problems are : Problem set: 3 solved, 148 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 148/151 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44720ms problems are : Problem set: 3 solved, 148 unsolved
Search for dead transitions found 3 dead transitions in 44722ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 112/169 places, 149/412 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 109 transition count 149
Applied a total of 3 rules in 1 ms. Remains 109 /112 variables (removed 3) and now considering 149/149 (removed 0) transitions.
// Phase 1: matrix 149 rows 109 cols
[2025-06-06 08:22:05] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:22:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 08:22:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:22:06] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-06 08:22:06] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 109/169 places, 149/412 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45834 ms. Remains : 109/169 places, 149/412 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-02
Product exploration explored 100000 steps with 22666 reset in 152 ms.
Product exploration explored 100000 steps with 22494 reset in 170 ms.
Computed a total of 19 stabilizing places and 25 stable transitions
Graph (complete) has 368 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (8977 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1887 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1900 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1842108 steps, run timeout after 3001 ms. (steps per millisecond=613 ) properties seen :1 out of 2
Probabilistic random walk after 1842108 steps, saw 795892 distinct states, run finished after 3001 ms. (steps per millisecond=613 ) properties seen :1
[2025-06-06 08:22:10] [INFO ] Invariant cache hit.
[2025-06-06 08:22:10] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/75 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/79 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 117/196 variables, 79/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 42/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/258 variables, 30/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 32/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/258 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/75 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/79 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 117/196 variables, 79/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 42/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/258 variables, 30/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 32/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 520ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 553 ms.
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 149/149 transitions.
Graph (complete) has 330 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 108 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 107 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 107 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 106 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 106 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 105 transition count 131
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 105 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 105 transition count 130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 104 transition count 129
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 104 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 103 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 103 transition count 128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 102 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 102 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 102 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 101 transition count 124
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 101 transition count 124
Applied a total of 20 rules in 11 ms. Remains 101 /109 variables (removed 8) and now considering 124/149 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 101/109 places, 124/149 transitions.
RANDOM walk for 40000 steps (8977 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1792 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2222639 steps, run timeout after 3001 ms. (steps per millisecond=740 ) properties seen :0 out of 1
Probabilistic random walk after 2222639 steps, saw 933806 distinct states, run finished after 3001 ms. (steps per millisecond=740 ) properties seen :0
// Phase 1: matrix 124 rows 101 cols
[2025-06-06 08:22:14] [INFO ] Computed 3 invariants in 2 ms
[2025-06-06 08:22:14] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 135/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 42/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/225 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/225 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 135/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 42/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/225 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:22:14] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/225 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 531ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 934 ms.
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 124/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 101/101 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 124/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2025-06-06 08:22:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:22:16] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-06 08:22:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:22:16] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-06 08:22:16] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:22:16] [INFO ] Redundant transitions in 1 ms returned []
Running 123 sub problems to find dead transitions.
[2025-06-06 08:22:16] [INFO ] Invariant cache hit.
[2025-06-06 08:22:16] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 4 (OVERLAPS) 124/225 variables, 101/104 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 54/158 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 158 constraints, problems are : Problem set: 3 solved, 120 unsolved in 4541 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 123/221 variables, 98/101 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 53/154 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 14/168 constraints. Problems are: Problem set: 3 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:22:23] [INFO ] Deduced a trap along path composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/169 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 4/225 variables, 3/172 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 1/173 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 106/279 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/279 constraints. Problems are: Problem set: 3 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 225/225 variables, and 279 constraints, problems are : Problem set: 3 solved, 120 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 120/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34610ms problems are : Problem set: 3 solved, 120 unsolved
Search for dead transitions found 3 dead transitions in 34610ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/101 places, 121/124 transitions.
Graph (complete) has 289 edges and 101 vertex of which 98 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 98 /101 variables (removed 3) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 98 cols
[2025-06-06 08:22:50] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:22:51] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-06 08:22:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:22:51] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-06 08:22:51] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/101 places, 121/124 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 35352 ms. Remains : 98/101 places, 121/124 transitions.
RANDOM walk for 40000 steps (8892 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1927 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2298959 steps, run timeout after 3001 ms. (steps per millisecond=766 ) properties seen :0 out of 1
Probabilistic random walk after 2298959 steps, saw 965485 distinct states, run finished after 3001 ms. (steps per millisecond=766 ) properties seen :0
[2025-06-06 08:22:54] [INFO ] Invariant cache hit.
[2025-06-06 08:22:54] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 442ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 378 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2025-06-06 08:22:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:22:55] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-06 08:22:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:22:55] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-06 08:22:55] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:22:55] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-06 08:22:55] [INFO ] Invariant cache hit.
[2025-06-06 08:22:55] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4971 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:23:06] [INFO ] Deduced a trap along path composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 275 constraints, problems are : Problem set: 0 solved, 120 unsolved in 20677 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 25688ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 25690ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25996 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 102
Applied a total of 57 rules in 12 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2025-06-06 08:23:21] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 08:23:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 08:23:21] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 08:23:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 08:23:21] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 08:23:21] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 08:23:21] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 203 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 149/149 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 149/149 (removed 0) transitions.
// Phase 1: matrix 149 rows 109 cols
[2025-06-06 08:23:21] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:23:21] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-06 08:23:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:23:21] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-06 08:23:22] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2025-06-06 08:23:22] [INFO ] Invariant cache hit.
[2025-06-06 08:23:22] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 5 (OVERLAPS) 149/258 variables, 109/113 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 74/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 187 constraints, problems are : Problem set: 3 solved, 145 unsolved in 8138 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 145 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 2/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 149/257 variables, 108/112 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 74/186 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 18/204 constraints. Problems are: Problem set: 3 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:23:35] [INFO ] Deduced a trap along path composed of 20 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 1/205 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/205 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 12 (OVERLAPS) 1/258 variables, 1/206 constraints. Problems are: Problem set: 3 solved, 145 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 127/333 constraints. Problems are: Problem set: 3 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:23:54] [INFO ] Deduced a trap along path composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/334 constraints. Problems are: Problem set: 3 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/258 variables, and 334 constraints, problems are : Problem set: 3 solved, 145 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 145/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 38211ms problems are : Problem set: 3 solved, 145 unsolved
Search for dead transitions found 3 dead transitions in 38211ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 109/109 places, 146/149 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 106 transition count 146
Applied a total of 3 rules in 2 ms. Remains 106 /109 variables (removed 3) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2025-06-06 08:24:00] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:24:00] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-06 08:24:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:24:00] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-06-06 08:24:01] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/109 places, 146/149 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39461 ms. Remains : 106/109 places, 146/149 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 358 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (9004 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1937 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1868 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2012262 steps, run timeout after 3001 ms. (steps per millisecond=670 ) properties seen :1 out of 2
Probabilistic random walk after 2012262 steps, saw 868530 distinct states, run finished after 3001 ms. (steps per millisecond=670 ) properties seen :1
[2025-06-06 08:24:04] [INFO ] Invariant cache hit.
[2025-06-06 08:24:04] [INFO ] State equation strengthened by 73 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/73 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/77 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 114/191 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 41/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 61/252 variables, 29/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 32/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 183 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/73 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/77 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 114/191 variables, 77/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 41/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 61/252 variables, 29/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 32/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/252 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 450ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 561 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 146/146 transitions.
Graph (complete) has 321 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 144
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 104 transition count 131
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 104 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 103 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 103 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 102 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 102 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 102 transition count 127
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 101 transition count 126
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 101 transition count 126
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 100 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 100 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 99 transition count 124
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 99 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 99 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 98 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 98 transition count 121
Applied a total of 20 rules in 9 ms. Remains 98 /106 variables (removed 8) and now considering 121/146 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 98/106 places, 121/146 transitions.
RANDOM walk for 40000 steps (8901 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2126006 steps, run timeout after 3001 ms. (steps per millisecond=708 ) properties seen :0 out of 1
Probabilistic random walk after 2126006 steps, saw 891554 distinct states, run finished after 3001 ms. (steps per millisecond=708 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2025-06-06 08:24:08] [INFO ] Computed 3 invariants in 1 ms
[2025-06-06 08:24:08] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 469ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2025-06-06 08:24:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:24:09] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 08:24:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:24:09] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-06 08:24:09] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:24:09] [INFO ] Redundant transitions in 0 ms returned []
Running 120 sub problems to find dead transitions.
[2025-06-06 08:24:09] [INFO ] Invariant cache hit.
[2025-06-06 08:24:09] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4766 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:24:20] [INFO ] Deduced a trap along path composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 275 constraints, problems are : Problem set: 0 solved, 120 unsolved in 20375 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 25184ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 25184ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25502 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 102
Applied a total of 57 rules in 13 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2025-06-06 08:24:34] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 08:24:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 08:24:34] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 08:24:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-06 08:24:34] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 08:24:34] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 08:24:34] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 201 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 22354 reset in 149 ms.
Product exploration explored 100000 steps with 22489 reset in 156 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 146/146 transitions.
Applied a total of 0 rules in 12 ms. Remains 106 /106 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:24:36] [INFO ] Redundant transitions in 1 ms returned []
Running 145 sub problems to find dead transitions.
// Phase 1: matrix 146 rows 106 cols
[2025-06-06 08:24:36] [INFO ] Computed 4 invariants in 1 ms
[2025-06-06 08:24:36] [INFO ] State equation strengthened by 73 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 146/252 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 73/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 183 constraints, problems are : Problem set: 0 solved, 145 unsolved in 7010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 146/252 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 73/183 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 145/328 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:24:50] [INFO ] Deduced a trap along path composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 329 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37090ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 37090ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37112 ms. Remains : 106/106 places, 146/146 transitions.
Built C files in :
/tmp/ltsmin16544235030491403216
[2025-06-06 08:25:13] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16544235030491403216
Running compilation step : cd /tmp/ltsmin16544235030491403216;'/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 261 ms.
Running link step : cd /tmp/ltsmin16544235030491403216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16544235030491403216;'/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/stateBased18055467689262794553.hoa' '--buchi-type=spotba'
LTSmin run took 8375 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-02 finished in 241368 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 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 412/412 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 151 transition count 210
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 151 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 151 transition count 209
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 54 place count 134 transition count 192
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 134 transition count 192
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 82 place count 134 transition count 181
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 122 transition count 159
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 122 transition count 159
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 114 place count 122 transition count 151
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 118 place count 118 transition count 147
Iterating global reduction 3 with 4 rules applied. Total rules applied 122 place count 118 transition count 147
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 126 place count 114 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 114 transition count 143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 133 place count 111 transition count 137
Iterating global reduction 3 with 3 rules applied. Total rules applied 136 place count 111 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 138 place count 111 transition count 135
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 141 place count 108 transition count 132
Iterating global reduction 4 with 3 rules applied. Total rules applied 144 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 105 transition count 129
Applied a total of 150 rules in 29 ms. Remains 105 /169 variables (removed 64) and now considering 129/412 (removed 283) transitions.
// Phase 1: matrix 129 rows 105 cols
[2025-06-06 08:25:22] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:25:22] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-06 08:25:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:25:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-06 08:25:22] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:25:22] [INFO ] Redundant transitions in 0 ms returned []
Running 128 sub problems to find dead transitions.
[2025-06-06 08:25:22] [INFO ] Invariant cache hit.
[2025-06-06 08:25:22] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:25:23] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:25:23] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/234 variables, 105/112 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 57/169 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:25:25] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:25:26] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:25:26] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 8 ms to minimize.
Problem TDEAD117 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:25:26] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 4/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 173 constraints, problems are : Problem set: 3 solved, 125 unsolved in 10333 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 6/11 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 129/234 variables, 105/116 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 57/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 125/298 constraints. Problems are: Problem set: 3 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:25:37] [INFO ] Deduced a trap along path composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 1/299 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/299 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/299 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 299 constraints, problems are : Problem set: 3 solved, 125 unsolved in 23576 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 125/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33962ms problems are : Problem set: 3 solved, 125 unsolved
Search for dead transitions found 3 dead transitions in 33963ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 105/169 places, 126/412 transitions.
Graph (complete) has 335 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 102 /105 variables (removed 3) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 102 cols
[2025-06-06 08:25:56] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:25:56] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-06 08:25:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:25:56] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 08:25:56] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/169 places, 126/412 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 34842 ms. Remains : 102/169 places, 126/412 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-03 finished in 34892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&(G(F(p1)) U p2)))&&X(X(F(!p0)))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 412/412 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 211
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 152 transition count 210
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 51 place count 136 transition count 194
Iterating global reduction 1 with 16 rules applied. Total rules applied 67 place count 136 transition count 194
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 78 place count 136 transition count 183
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 126 transition count 164
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 126 transition count 164
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 105 place count 126 transition count 157
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 124 transition count 155
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 124 transition count 155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 122 transition count 153
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 122 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 121 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 121 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 120 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 120 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 119 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 119 transition count 148
Applied a total of 119 rules in 18 ms. Remains 119 /169 variables (removed 50) and now considering 148/412 (removed 264) transitions.
// Phase 1: matrix 148 rows 119 cols
[2025-06-06 08:25:56] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:25:57] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-06 08:25:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:25:57] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-06 08:25:57] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-06 08:25:57] [INFO ] Invariant cache hit.
[2025-06-06 08:25:57] [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/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/119 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:25:59] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:25:59] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/267 variables, 119/126 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 66/192 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:26:02] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 3 ms to minimize.
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:26:03] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 11 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 2/194 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/267 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 194 constraints, problems are : Problem set: 3 solved, 144 unsolved in 13214 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 119/119 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 4/119 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 4/9 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 148/267 variables, 119/128 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 66/194 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 144/338 constraints. Problems are: Problem set: 3 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:26:20] [INFO ] Deduced a trap along path composed of 5 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:26:20] [INFO ] Deduced a trap along path composed of 20 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:26:23] [INFO ] Deduced a trap along path composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 3/341 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/341 constraints. Problems are: Problem set: 3 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 341 constraints, problems are : Problem set: 3 solved, 144 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 119/119 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 144/147 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 43301ms problems are : Problem set: 3 solved, 144 unsolved
Search for dead transitions found 3 dead transitions in 43301ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 119/169 places, 145/412 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 145
Applied a total of 3 rules in 2 ms. Remains 116 /119 variables (removed 3) and now considering 145/145 (removed 0) transitions.
// Phase 1: matrix 145 rows 116 cols
[2025-06-06 08:26:41] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:26:41] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-06 08:26:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:26:41] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-06 08:26:41] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 116/169 places, 145/412 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44675 ms. Remains : 116/169 places, 145/412 transitions.
Stuttering acceptance computed with spot in 318 ms :[true, (OR (NOT p2) (NOT p0)), p0, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-04 finished in 45011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p1)||p0))))))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 412/412 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 224
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 152 transition count 223
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 51 place count 136 transition count 207
Iterating global reduction 1 with 16 rules applied. Total rules applied 67 place count 136 transition count 207
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 78 place count 136 transition count 196
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 125 transition count 176
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 125 transition count 176
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 107 place count 125 transition count 169
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 121 transition count 165
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 121 transition count 165
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 117 transition count 161
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 117 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 114 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 114 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 132 place count 114 transition count 152
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 135 place count 111 transition count 149
Iterating global reduction 4 with 3 rules applied. Total rules applied 138 place count 111 transition count 149
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 140 place count 109 transition count 147
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 109 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 108 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 108 transition count 146
Applied a total of 144 rules in 14 ms. Remains 108 /169 variables (removed 61) and now considering 146/412 (removed 266) transitions.
// Phase 1: matrix 146 rows 108 cols
[2025-06-06 08:26:41] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:26:42] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 08:26:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:26:42] [INFO ] State equation strengthened by 70 read => feed constraints.
[2025-06-06 08:26:42] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2025-06-06 08:26:42] [INFO ] Invariant cache hit.
[2025-06-06 08:26:42] [INFO ] State equation strengthened by 70 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:26:43] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:26:43] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/254 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 70/185 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:26:46] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:26:46] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 8 ms to minimize.
Problem TDEAD133 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:26:47] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 3/188 constraints. Problems are: Problem set: 3 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:26:48] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 1/189 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 189 constraints, problems are : Problem set: 3 solved, 142 unsolved in 13544 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 142 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 4/108 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 6/11 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 146/254 variables, 108/119 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 70/189 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 142/331 constraints. Problems are: Problem set: 3 solved, 142 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:27:02] [INFO ] Deduced a trap along path composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 1/332 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/332 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 0/332 constraints. Problems are: Problem set: 3 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 332 constraints, problems are : Problem set: 3 solved, 142 unsolved in 29657 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 142/145 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43258ms problems are : Problem set: 3 solved, 142 unsolved
Search for dead transitions found 3 dead transitions in 43260ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 108/169 places, 143/412 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 105 transition count 143
Applied a total of 3 rules in 7 ms. Remains 105 /108 variables (removed 3) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 105 cols
[2025-06-06 08:27:25] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:27:25] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-06 08:27:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:27:25] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-06 08:27:26] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/169 places, 143/412 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44326 ms. Remains : 105/169 places, 143/412 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-05
Product exploration explored 100000 steps with 28625 reset in 168 ms.
Product exploration explored 100000 steps with 28582 reset in 186 ms.
Computed a total of 19 stabilizing places and 25 stable transitions
Graph (complete) has 355 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 19 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9001 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1939 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1885 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1924 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1913 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 691599 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :1 out of 4
Probabilistic random walk after 691599 steps, saw 282068 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :1
[2025-06-06 08:27:30] [INFO ] Invariant cache hit.
[2025-06-06 08:27:30] [INFO ] State equation strengthened by 69 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 126/204 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 44/248 variables, 27/161 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 17/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/248 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 178 constraints, problems are : Problem set: 1 solved, 2 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:27:30] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/78 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 126/204 variables, 78/83 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 52/135 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 44/248 variables, 27/162 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 17/179 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 2/181 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:27:30] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 1/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/248 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 182 constraints, problems are : Problem set: 1 solved, 2 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 996ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 6621 ms.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 143/143 transitions.
Graph (complete) has 319 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 104 transition count 141
Applied a total of 3 rules in 4 ms. Remains 104 /105 variables (removed 1) and now considering 141/143 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/105 places, 141/143 transitions.
RANDOM walk for 40000 steps (9001 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1852 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1947 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 828536 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :0 out of 2
Probabilistic random walk after 828536 steps, saw 337867 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
// Phase 1: matrix 141 rows 104 cols
[2025-06-06 08:27:40] [INFO ] Computed 3 invariants in 2 ms
[2025-06-06 08:27:40] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 138/239 variables, 95/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 43/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/245 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/245 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 174 constraints, problems are : Problem set: 0 solved, 2 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 2/2 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 138/239 variables, 95/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 43/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/245 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:27:41] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 2 unsolved in 877 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1066ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 5662 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 8 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 104/104 places, 141/141 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2025-06-06 08:27:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:27:47] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 08:27:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:27:47] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-06 08:27:47] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:27:47] [INFO ] Redundant transitions in 1 ms returned []
Running 140 sub problems to find dead transitions.
[2025-06-06 08:27:47] [INFO ] Invariant cache hit.
[2025-06-06 08:27:47] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 4 (OVERLAPS) 141/245 variables, 104/107 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 67/174 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/245 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 174 constraints, problems are : Problem set: 3 solved, 137 unsolved in 6363 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 137 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 140/241 variables, 101/104 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 66/170 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 15/185 constraints. Problems are: Problem set: 3 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:27:56] [INFO ] Deduced a trap along path composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/186 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/186 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 4/245 variables, 3/189 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/190 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 122/312 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/312 constraints. Problems are: Problem set: 3 solved, 137 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 245/245 variables, and 312 constraints, problems are : Problem set: 3 solved, 137 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 137/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36426ms problems are : Problem set: 3 solved, 137 unsolved
Search for dead transitions found 3 dead transitions in 36427ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/104 places, 138/141 transitions.
Graph (complete) has 310 edges and 104 vertex of which 101 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 101 /104 variables (removed 3) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 101 cols
[2025-06-06 08:28:24] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:28:24] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-06 08:28:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:28:24] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-06 08:28:24] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 101/104 places, 138/141 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37162 ms. Remains : 101/104 places, 138/141 transitions.
RANDOM walk for 40000 steps (8973 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1889 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1934 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 833888 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :0 out of 2
Probabilistic random walk after 833888 steps, saw 339917 distinct states, run finished after 3001 ms. (steps per millisecond=277 ) properties seen :0
[2025-06-06 08:28:27] [INFO ] Invariant cache hit.
[2025-06-06 08:28:27] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 134/233 variables, 92/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/239 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/239 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 170 constraints, problems are : Problem set: 0 solved, 2 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 2/2 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 134/233 variables, 92/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 42/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/239 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/239 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 172 constraints, problems are : Problem set: 0 solved, 2 unsolved in 521 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 707ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2675 ms.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 138/138 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 101/101 places, 138/138 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 138/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2025-06-06 08:28:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:28:31] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 08:28:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:28:31] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-06 08:28:31] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:28:31] [INFO ] Redundant transitions in 1 ms returned []
Running 137 sub problems to find dead transitions.
[2025-06-06 08:28:31] [INFO ] Invariant cache hit.
[2025-06-06 08:28: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/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/239 variables, 101/104 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 66/170 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 170 constraints, problems are : Problem set: 0 solved, 137 unsolved in 6886 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/239 variables, 101/104 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 66/170 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 137/307 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:28:55] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/239 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 239/239 variables, and 308 constraints, problems are : Problem set: 0 solved, 137 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36950ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 36950ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37276 ms. Remains : 101/101 places, 138/138 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 25 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-05 finished in 146477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(!p0)))))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 412/412 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 151 transition count 210
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 151 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 151 transition count 209
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 54 place count 134 transition count 192
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 134 transition count 192
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 82 place count 134 transition count 181
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 122 transition count 159
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 122 transition count 159
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 114 place count 122 transition count 151
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 118 place count 118 transition count 147
Iterating global reduction 3 with 4 rules applied. Total rules applied 122 place count 118 transition count 147
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 126 place count 114 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 114 transition count 143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 133 place count 111 transition count 137
Iterating global reduction 3 with 3 rules applied. Total rules applied 136 place count 111 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 138 place count 111 transition count 135
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 141 place count 108 transition count 132
Iterating global reduction 4 with 3 rules applied. Total rules applied 144 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 105 transition count 129
Applied a total of 150 rules in 17 ms. Remains 105 /169 variables (removed 64) and now considering 129/412 (removed 283) transitions.
// Phase 1: matrix 129 rows 105 cols
[2025-06-06 08:29:08] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:29:08] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-06 08:29:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:29:08] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-06 08:29:08] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2025-06-06 08:29:08] [INFO ] Invariant cache hit.
[2025-06-06 08:29:08] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:29:10] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:29:10] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/234 variables, 105/112 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 57/169 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:29:11] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:29:12] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:29:12] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 9 ms to minimize.
Problem TDEAD117 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:29:12] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 4/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 173 constraints, problems are : Problem set: 3 solved, 125 unsolved in 10439 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 6/11 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 129/234 variables, 105/116 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 57/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 125/298 constraints. Problems are: Problem set: 3 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:29:24] [INFO ] Deduced a trap along path composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 1/299 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/299 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/299 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 299 constraints, problems are : Problem set: 3 solved, 125 unsolved in 23512 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 125/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33997ms problems are : Problem set: 3 solved, 125 unsolved
Search for dead transitions found 3 dead transitions in 33998ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 105/169 places, 126/412 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 102 transition count 126
Applied a total of 3 rules in 3 ms. Remains 102 /105 variables (removed 3) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 102 cols
[2025-06-06 08:29:42] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:29:42] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 08:29:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:29:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 08:29:43] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/169 places, 126/412 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34790 ms. Remains : 102/169 places, 126/412 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-06
Product exploration explored 100000 steps with 22349 reset in 220 ms.
Product exploration explored 100000 steps with 22455 reset in 165 ms.
Computed a total of 19 stabilizing places and 24 stable transitions
Graph (complete) has 333 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 24 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, p0, p0, p0, p0]
RANDOM walk for 40000 steps (8999 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1853 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 7 ms. (steps per millisecond=445 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 11 ms. (steps per millisecond=283 ) properties seen :1
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 157 ms :[true, p0, p0, p0, p0]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2025-06-06 08:29:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:29:44] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 08:29:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:29:44] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 08:29:44] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2025-06-06 08:29:44] [INFO ] Invariant cache hit.
[2025-06-06 08:29:44] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 5 (OVERLAPS) 126/228 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 162 constraints, problems are : Problem set: 3 solved, 122 unsolved in 5089 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 126/227 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 56/161 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 17/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:29:53] [INFO ] Deduced a trap along path composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/179 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 1/228 variables, 1/180 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 105/285 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/285 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 15 (OVERLAPS) 0/228 variables, 0/285 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 285 constraints, problems are : Problem set: 3 solved, 122 unsolved in 28371 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 122/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33523ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 33524ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 102/102 places, 123/126 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 99 transition count 123
Applied a total of 3 rules in 4 ms. Remains 99 /102 variables (removed 3) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2025-06-06 08:30:18] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:30:18] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-06 08:30:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:30:18] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 08:30:18] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/102 places, 123/126 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34282 ms. Remains : 99/102 places, 123/126 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 61 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, p0, p0, p0, p0]
RANDOM walk for 40000 steps (8961 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1866 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3121 steps, run visited all 1 properties in 13 ms. (steps per millisecond=240 )
Probabilistic random walk after 3121 steps, saw 1576 distinct states, run finished after 13 ms. (steps per millisecond=240 ) properties seen :1
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 146 ms :[true, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 132 ms :[true, p0, p0, p0, p0]
Product exploration explored 100000 steps with 22435 reset in 114 ms.
Product exploration explored 100000 steps with 22358 reset in 124 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 141 ms :[true, p0, p0, p0, p0]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:30:19] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2025-06-06 08:30:19] [INFO ] Invariant cache hit.
[2025-06-06 08:30:19] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5628 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 13981 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19658ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 19658ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19669 ms. Remains : 99/99 places, 123/123 transitions.
Built C files in :
/tmp/ltsmin18223974225094780053
[2025-06-06 08:30:39] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18223974225094780053
Running compilation step : cd /tmp/ltsmin18223974225094780053;'/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 202 ms.
Running link step : cd /tmp/ltsmin18223974225094780053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18223974225094780053;'/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/stateBased4846571439701305336.hoa' '--buchi-type=spotba'
LTSmin run took 577 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-06 finished in 92003 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 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 412/412 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 151 transition count 210
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 151 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 151 transition count 209
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 54 place count 134 transition count 192
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 134 transition count 192
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 82 place count 134 transition count 181
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 122 transition count 159
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 122 transition count 159
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 114 place count 122 transition count 151
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 118 place count 118 transition count 147
Iterating global reduction 3 with 4 rules applied. Total rules applied 122 place count 118 transition count 147
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 125 place count 115 transition count 144
Iterating global reduction 3 with 3 rules applied. Total rules applied 128 place count 115 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 130 place count 113 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 113 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 134 place count 113 transition count 138
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 136 place count 111 transition count 136
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 111 transition count 136
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 110 transition count 135
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 110 transition count 135
Applied a total of 140 rules in 26 ms. Remains 110 /169 variables (removed 59) and now considering 135/412 (removed 277) transitions.
// Phase 1: matrix 135 rows 110 cols
[2025-06-06 08:30:40] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:30:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-06 08:30:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:30:40] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-06 08:30:40] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:30:40] [INFO ] Redundant transitions in 1 ms returned []
Running 134 sub problems to find dead transitions.
[2025-06-06 08:30:40] [INFO ] Invariant cache hit.
[2025-06-06 08:30:40] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:30:42] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 135/245 variables, 110/116 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 59/175 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:30:44] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/176 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/245 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 176 constraints, problems are : Problem set: 3 solved, 131 unsolved in 9098 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 4/110 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 135/245 variables, 110/117 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 59/176 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 131/307 constraints. Problems are: Problem set: 3 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:30:54] [INFO ] Deduced a trap along path composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/308 constraints. Problems are: Problem set: 3 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/308 constraints. Problems are: Problem set: 3 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 245/245 variables, and 308 constraints, problems are : Problem set: 3 solved, 131 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 131/134 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39165ms problems are : Problem set: 3 solved, 131 unsolved
Search for dead transitions found 3 dead transitions in 39165ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 110/169 places, 132/412 transitions.
Graph (complete) has 351 edges and 110 vertex of which 107 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 107 /110 variables (removed 3) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 107 cols
[2025-06-06 08:31:20] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:31:20] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-06 08:31:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:31:20] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-06 08:31:20] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/169 places, 132/412 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40101 ms. Remains : 107/169 places, 132/412 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-08
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-08 finished in 40184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((X(X(!p0))||F(!p1)) U (G((X(X(!p0))||F(!p1)))||X(X(X(!p1)))))))))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 412/412 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 224
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 152 transition count 223
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 51 place count 136 transition count 207
Iterating global reduction 1 with 16 rules applied. Total rules applied 67 place count 136 transition count 207
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 78 place count 136 transition count 196
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 125 transition count 176
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 125 transition count 176
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 107 place count 125 transition count 169
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 122 transition count 166
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 122 transition count 166
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 119 transition count 163
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 119 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 122 place count 116 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 116 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 128 place count 116 transition count 154
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 131 place count 113 transition count 151
Iterating global reduction 4 with 3 rules applied. Total rules applied 134 place count 113 transition count 151
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 136 place count 111 transition count 149
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 111 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 110 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 110 transition count 148
Applied a total of 140 rules in 15 ms. Remains 110 /169 variables (removed 59) and now considering 148/412 (removed 264) transitions.
// Phase 1: matrix 148 rows 110 cols
[2025-06-06 08:31:20] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:31:20] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 08:31:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:31:20] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-06 08:31:21] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-06 08:31:21] [INFO ] Invariant cache hit.
[2025-06-06 08:31:21] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:31:22] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:31:22] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/258 variables, 110/117 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 71/188 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:31:24] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD134 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/189 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 189 constraints, problems are : Problem set: 3 solved, 144 unsolved in 10041 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 4/110 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 148/258 variables, 110/118 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 71/189 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 144/333 constraints. Problems are: Problem set: 3 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:31:38] [INFO ] Deduced a trap along path composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/334 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/334 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/334 constraints. Problems are: Problem set: 3 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 334 constraints, problems are : Problem set: 3 solved, 144 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 144/147 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40119ms problems are : Problem set: 3 solved, 144 unsolved
Search for dead transitions found 3 dead transitions in 40120ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/169 places, 145/412 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 145
Applied a total of 3 rules in 1 ms. Remains 107 /110 variables (removed 3) and now considering 145/145 (removed 0) transitions.
// Phase 1: matrix 145 rows 107 cols
[2025-06-06 08:32:01] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:32:01] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 08:32:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:32:01] [INFO ] State equation strengthened by 70 read => feed constraints.
[2025-06-06 08:32:01] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 107/169 places, 145/412 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41334 ms. Remains : 107/169 places, 145/412 transitions.
Stuttering acceptance computed with spot in 335 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-09
Product exploration explored 100000 steps with 25011 reset in 147 ms.
Product exploration explored 100000 steps with 24973 reset in 138 ms.
Computed a total of 19 stabilizing places and 25 stable transitions
Graph (complete) has 361 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0)]
RANDOM walk for 40000 steps (8987 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1827 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1893 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1842 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 828538 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :0 out of 3
Probabilistic random walk after 828538 steps, saw 348638 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
[2025-06-06 08:32:06] [INFO ] Invariant cache hit.
[2025-06-06 08:32:06] [INFO ] State equation strengthened by 70 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/76 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:32:06] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/80 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 128/208 variables, 80/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 53/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 11 (OVERLAPS) 44/252 variables, 27/165 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 17/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/252 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 182 constraints, problems are : Problem set: 1 solved, 2 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/76 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/80 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 128/208 variables, 80/85 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 53/138 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 44/252 variables, 27/165 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 17/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 2/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:32:06] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 1/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/252 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 185 constraints, problems are : Problem set: 1 solved, 2 unsolved in 860 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1116ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 662 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 145/145 transitions.
Graph (complete) has 324 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 106 transition count 143
Applied a total of 3 rules in 3 ms. Remains 106 /107 variables (removed 1) and now considering 143/145 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 106/107 places, 143/145 transitions.
RANDOM walk for 40000 steps (8921 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1819 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1901 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 973251 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :0 out of 2
Probabilistic random walk after 973251 steps, saw 406072 distinct states, run finished after 3002 ms. (steps per millisecond=324 ) properties seen :0
// Phase 1: matrix 143 rows 106 cols
[2025-06-06 08:32:11] [INFO ] Computed 3 invariants in 1 ms
[2025-06-06 08:32:11] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 141/243 variables, 97/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 44/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/249 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 6/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 177 constraints, problems are : Problem set: 0 solved, 2 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 2/2 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 141/243 variables, 97/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 44/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/249 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 6/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 565ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3670 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 143/143 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 106/106 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 143/143 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2025-06-06 08:32:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:32:15] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 08:32:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:32:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-06-06 08:32:15] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:32:15] [INFO ] Redundant transitions in 1 ms returned []
Running 142 sub problems to find dead transitions.
[2025-06-06 08:32:15] [INFO ] Invariant cache hit.
[2025-06-06 08:32:15] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 4 (OVERLAPS) 143/249 variables, 106/109 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 68/177 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/177 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/177 constraints. Problems are: Problem set: 3 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 177 constraints, problems are : Problem set: 3 solved, 139 unsolved in 5663 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 139 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 142/245 variables, 103/106 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 67/173 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 15/188 constraints. Problems are: Problem set: 3 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:32:23] [INFO ] Deduced a trap along path composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 1/189 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 9 (OVERLAPS) 4/249 variables, 3/192 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/193 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 124/317 constraints. Problems are: Problem set: 3 solved, 139 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/317 constraints. Problems are: Problem set: 3 solved, 139 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 249/249 variables, and 317 constraints, problems are : Problem set: 3 solved, 139 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 139/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35733ms problems are : Problem set: 3 solved, 139 unsolved
Search for dead transitions found 3 dead transitions in 35734ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/106 places, 140/143 transitions.
Graph (complete) has 315 edges and 106 vertex of which 103 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 103 /106 variables (removed 3) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 103 cols
[2025-06-06 08:32:51] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:32:51] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 08:32:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:32:51] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-06 08:32:51] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 103/106 places, 140/143 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36473 ms. Remains : 103/106 places, 140/143 transitions.
RANDOM walk for 40000 steps (8955 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1878 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1935 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1085209 steps, run timeout after 3001 ms. (steps per millisecond=361 ) properties seen :0 out of 2
Probabilistic random walk after 1085209 steps, saw 454100 distinct states, run finished after 3001 ms. (steps per millisecond=361 ) properties seen :0
[2025-06-06 08:32:54] [INFO ] Invariant cache hit.
[2025-06-06 08:32:54] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 137/237 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/243 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/243 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 2/2 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 137/237 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/243 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/243 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 175 constraints, problems are : Problem set: 0 solved, 2 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 783ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2101 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 140/140 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 103/103 places, 140/140 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 140/140 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2025-06-06 08:32:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:32:57] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-06 08:32:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:32:57] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-06 08:32:58] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:32:58] [INFO ] Redundant transitions in 0 ms returned []
Running 139 sub problems to find dead transitions.
[2025-06-06 08:32:58] [INFO ] Invariant cache hit.
[2025-06-06 08:32:58] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/243 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 173 constraints, problems are : Problem set: 0 solved, 139 unsolved in 5886 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/243 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 139/312 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:33:12] [INFO ] Deduced a trap along path composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 243/243 variables, and 313 constraints, problems are : Problem set: 0 solved, 139 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35954ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 35954ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36333 ms. Remains : 103/103 places, 140/140 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 103 transition count 133
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 133
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 97 transition count 118
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 82 transition count 118
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 75 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 74 transition count 120
Applied a total of 59 rules in 12 ms. Remains 74 /103 variables (removed 29) and now considering 120/140 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 120 rows 74 cols
[2025-06-06 08:33:34] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 08:33:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 08:33:34] [INFO ] After 96ms 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-06 08:33:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 08:33:34] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-06 08:33:34] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-06 08:33:34] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 262 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 9 states, 14 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 finished in 133785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(F(G(p2))&&p1)))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 412/412 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 153 transition count 226
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 153 transition count 226
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 137 transition count 210
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 137 transition count 210
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 76 place count 137 transition count 198
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 87 place count 126 transition count 178
Iterating global reduction 1 with 11 rules applied. Total rules applied 98 place count 126 transition count 178
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 105 place count 126 transition count 171
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 123 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 123 transition count 168
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 120 transition count 165
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 120 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 120 place count 117 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 117 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 126 place count 117 transition count 156
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 114 transition count 153
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 114 transition count 153
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 134 place count 112 transition count 151
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 112 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 111 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 111 transition count 150
Applied a total of 138 rules in 20 ms. Remains 111 /169 variables (removed 58) and now considering 150/412 (removed 262) transitions.
// Phase 1: matrix 150 rows 111 cols
[2025-06-06 08:33:34] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:33:34] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-06 08:33:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:33:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-06 08:33:34] [INFO ] Implicit Places using invariants and state equation in 345 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-06 08:33:34] [INFO ] Redundant transitions in 0 ms returned []
Running 149 sub problems to find dead transitions.
[2025-06-06 08:33:34] [INFO ] Invariant cache hit.
[2025-06-06 08:33:34] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:33:36] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:33:36] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 150/261 variables, 111/118 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 72/190 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 149 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/261 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 190 constraints, problems are : Problem set: 0 solved, 149 unsolved in 11547 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 150/261 variables, 111/118 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 72/190 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 149/339 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:33:50] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD136 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/340 constraints. Problems are: Problem set: 3 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:00] [INFO ] Deduced a trap along path composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/341 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/341 constraints. Problems are: Problem set: 3 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 261/261 variables, and 341 constraints, problems are : Problem set: 3 solved, 146 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41615ms problems are : Problem set: 3 solved, 146 unsolved
Search for dead transitions found 3 dead transitions in 41616ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 111/169 places, 147/412 transitions.
Graph (complete) has 367 edges and 111 vertex of which 108 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 108 /111 variables (removed 3) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 108 cols
[2025-06-06 08:34:16] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:34:16] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-06 08:34:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:34:16] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-06 08:34:16] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/169 places, 147/412 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42556 ms. Remains : 108/169 places, 147/412 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 finished in 42695 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 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 412/412 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 151 transition count 210
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 151 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 151 transition count 209
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 54 place count 134 transition count 192
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 134 transition count 192
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 82 place count 134 transition count 181
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 122 transition count 159
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 122 transition count 159
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 114 place count 122 transition count 151
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 118 place count 118 transition count 147
Iterating global reduction 3 with 4 rules applied. Total rules applied 122 place count 118 transition count 147
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 126 place count 114 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 114 transition count 143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 133 place count 111 transition count 137
Iterating global reduction 3 with 3 rules applied. Total rules applied 136 place count 111 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 138 place count 111 transition count 135
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 141 place count 108 transition count 132
Iterating global reduction 4 with 3 rules applied. Total rules applied 144 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 105 transition count 129
Applied a total of 150 rules in 20 ms. Remains 105 /169 variables (removed 64) and now considering 129/412 (removed 283) transitions.
// Phase 1: matrix 129 rows 105 cols
[2025-06-06 08:34:17] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:34:17] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 08:34:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:34:17] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-06 08:34:17] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:34:17] [INFO ] Redundant transitions in 0 ms returned []
Running 128 sub problems to find dead transitions.
[2025-06-06 08:34:17] [INFO ] Invariant cache hit.
[2025-06-06 08:34:17] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:18] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:18] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/234 variables, 105/112 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 57/169 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:20] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:21] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:21] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:21] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 5 ms to minimize.
Problem TDEAD117 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 4/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 173 constraints, problems are : Problem set: 3 solved, 125 unsolved in 8786 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 6/11 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 129/234 variables, 105/116 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 57/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 125/298 constraints. Problems are: Problem set: 3 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:33] [INFO ] Deduced a trap along path composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 1/299 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/299 constraints. Problems are: Problem set: 3 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:47] [INFO ] Deduced a trap along path composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/234 variables, 1/300 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/234 variables, and 300 constraints, problems are : Problem set: 3 solved, 125 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 125/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 38850ms problems are : Problem set: 3 solved, 125 unsolved
Search for dead transitions found 3 dead transitions in 38850ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 105/169 places, 126/412 transitions.
Graph (complete) has 335 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 102 /105 variables (removed 3) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 102 cols
[2025-06-06 08:34:56] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:34:56] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-06 08:34:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:34:56] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 08:34:56] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/169 places, 126/412 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39648 ms. Remains : 102/169 places, 126/412 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 finished in 39752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 412/412 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 151 transition count 210
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 151 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 151 transition count 209
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 54 place count 134 transition count 192
Iterating global reduction 1 with 17 rules applied. Total rules applied 71 place count 134 transition count 192
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 82 place count 134 transition count 181
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 122 transition count 159
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 122 transition count 159
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 114 place count 122 transition count 151
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 118 place count 118 transition count 147
Iterating global reduction 3 with 4 rules applied. Total rules applied 122 place count 118 transition count 147
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 126 place count 114 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 114 transition count 143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 133 place count 111 transition count 137
Iterating global reduction 3 with 3 rules applied. Total rules applied 136 place count 111 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 138 place count 111 transition count 135
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 141 place count 108 transition count 132
Iterating global reduction 4 with 3 rules applied. Total rules applied 144 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 106 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 105 transition count 129
Applied a total of 150 rules in 14 ms. Remains 105 /169 variables (removed 64) and now considering 129/412 (removed 283) transitions.
// Phase 1: matrix 129 rows 105 cols
[2025-06-06 08:34:56] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:34:56] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 08:34:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:34:56] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-06 08:34:57] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2025-06-06 08:34:57] [INFO ] Invariant cache hit.
[2025-06-06 08:34:57] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:58] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:34:58] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/234 variables, 105/112 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 57/169 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:00] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:01] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:01] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 9 ms to minimize.
Problem TDEAD117 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:01] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 4/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 173 constraints, problems are : Problem set: 3 solved, 125 unsolved in 10436 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 4/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 6/11 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 129/234 variables, 105/116 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 57/173 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 125/298 constraints. Problems are: Problem set: 3 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:12] [INFO ] Deduced a trap along path composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 1/299 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/299 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/299 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 299 constraints, problems are : Problem set: 3 solved, 125 unsolved in 24000 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 125/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34502ms problems are : Problem set: 3 solved, 125 unsolved
Search for dead transitions found 3 dead transitions in 34503ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 105/169 places, 126/412 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 102 transition count 126
Applied a total of 3 rules in 2 ms. Remains 102 /105 variables (removed 3) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 102 cols
[2025-06-06 08:35:31] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:35:31] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-06 08:35:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:35:31] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 08:35:32] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/169 places, 126/412 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35305 ms. Remains : 102/169 places, 126/412 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 finished in 35392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 412/412 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 152 transition count 211
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 152 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 152 transition count 210
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 51 place count 136 transition count 194
Iterating global reduction 1 with 16 rules applied. Total rules applied 67 place count 136 transition count 194
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 76 place count 136 transition count 185
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 88 place count 124 transition count 163
Iterating global reduction 2 with 12 rules applied. Total rules applied 100 place count 124 transition count 163
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 108 place count 124 transition count 155
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 112 place count 120 transition count 151
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 120 transition count 151
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 120 place count 116 transition count 147
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 116 transition count 147
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 113 transition count 141
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 113 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 113 transition count 139
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 135 place count 110 transition count 136
Iterating global reduction 4 with 3 rules applied. Total rules applied 138 place count 110 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 140 place count 108 transition count 134
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 108 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 107 transition count 133
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 107 transition count 133
Applied a total of 144 rules in 17 ms. Remains 107 /169 variables (removed 62) and now considering 133/412 (removed 279) transitions.
// Phase 1: matrix 133 rows 107 cols
[2025-06-06 08:35:32] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:35:32] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-06 08:35:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:35:32] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-06 08:35:32] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 08:35:32] [INFO ] Redundant transitions in 1 ms returned []
Running 132 sub problems to find dead transitions.
[2025-06-06 08:35:32] [INFO ] Invariant cache hit.
[2025-06-06 08:35:32] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:34] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:34] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/240 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 59/173 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:36] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 1/174 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/240 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 174 constraints, problems are : Problem set: 3 solved, 129 unsolved in 8287 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 129 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 4/107 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 133/240 variables, 107/115 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 59/174 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 129/303 constraints. Problems are: Problem set: 3 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:46] [INFO ] Deduced a trap along path composed of 5 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:46] [INFO ] Deduced a trap along path composed of 20 places in 34 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 2/305 constraints. Problems are: Problem set: 3 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 08:35:56] [INFO ] Deduced a trap along path composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/306 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/306 constraints. Problems are: Problem set: 3 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 306 constraints, problems are : Problem set: 3 solved, 129 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 107/107 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 129/132 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 38359ms problems are : Problem set: 3 solved, 129 unsolved
Search for dead transitions found 3 dead transitions in 38360ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 107/169 places, 130/412 transitions.
Graph (complete) has 343 edges and 107 vertex of which 104 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 104 /107 variables (removed 3) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 104 cols
[2025-06-06 08:36:11] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:36:11] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 08:36:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 08:36:11] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-06 08:36:11] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/169 places, 130/412 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39395 ms. Remains : 104/169 places, 130/412 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-14
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-14 finished in 39480 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((F((F(p0)&&p1))||(F(!(p2 U p3))&&p1)))))'
[2025-06-06 08:36:11] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7184791485332371133
[2025-06-06 08:36:11] [INFO ] Computing symmetric may disable matrix : 412 transitions.
[2025-06-06 08:36:11] [INFO ] Applying decomposition
[2025-06-06 08:36:11] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 08:36:11] [INFO ] Computing symmetric may enable matrix : 412 transitions.
[2025-06-06 08:36:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 08:36:11] [INFO ] Flatten gal took : 37 ms
[2025-06-06 08:36:11] [INFO ] Computing Do-Not-Accords matrix : 412 transitions.
[2025-06-06 08:36:11] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 08:36:11] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7184791485332371133
Running compilation step : cd /tmp/ltsmin7184791485332371133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10980680014279060715.txt' '-o' '/tmp/graph10980680014279060715.bin' '-w' '/tmp/graph10980680014279060715.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10980680014279060715.bin' '-l' '-1' '-v' '-w' '/tmp/graph10980680014279060715.weights' '-q' '0' '-e' '0.001'
[2025-06-06 08:36:11] [INFO ] Decomposing Gal with order
[2025-06-06 08:36:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 08:36:12] [INFO ] Removed a total of 234 redundant transitions.
[2025-06-06 08:36:12] [INFO ] Flatten gal took : 36 ms
[2025-06-06 08:36:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 183 labels/synchronizations in 16 ms.
[2025-06-06 08:36:12] [INFO ] Time to serialize gal into /tmp/LTLFireability3581718744962947979.gal : 9 ms
[2025-06-06 08:36:12] [INFO ] Time to serialize properties into /tmp/LTLFireability13406535496304741686.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3581718744962947979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13406535496304741686.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((F((F("((u0.s1<1)||(u0.l2234<1))"))&&("((u0.s1<1)||(u0.l2218<1))")))||((F(!(("((u0.s1>=1)&&(u0.l2213>=1))")U("((u0.s1>=1)&&(u0....206
Formula 0 simplified : G(F(!"((u0.s1<1)||(u0.l2218<1))" | G("((u0.s1>=1)&&(u0.l2213>=1))" U "((u0.s1>=1)&&(u0.l2215>=1))")) & F(G!"((u0.s1<1)||(u0.l2234<1)...191
Compilation finished in 938 ms.
Running link step : cd /tmp/ltsmin7184791485332371133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7184791485332371133;'/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' '--ltl' '<>([]((<>((<>((LTLAPp0==true))&&(LTLAPp1==true)))||(<>(!((LTLAPp2==true) U (LTLAPp3==true)))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-06 09:03:57] [INFO ] Flatten gal took : 40 ms
[2025-06-06 09:03:57] [INFO ] Time to serialize gal into /tmp/LTLFireability11305176064692478737.gal : 3 ms
[2025-06-06 09:03:57] [INFO ] Time to serialize properties into /tmp/LTLFireability10409511573307748540.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11305176064692478737.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10409511573307748540.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((F(G((F((F("((s1<1)||(l2234<1))"))&&("((s1<1)||(l2218<1))")))||((F(!(("((s1>=1)&&(l2213>=1))")U("((s1>=1)&&(l2215>=1))"))))&&("((s1<...176
Formula 0 simplified : G(F(!"((s1<1)||(l2218<1))" | G("((s1>=1)&&(l2213>=1))" U "((s1>=1)&&(l2215>=1))")) & F(G!"((s1<1)||(l2234<1))" | G!"((s1<1)||(l2218<...161

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m96"
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 SieveSingleMsgMbox-PT-d2m96, 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 r212-tall-174901994500492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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