Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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-d2m64-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749190594124

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-d2m64
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 06:16:35] [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 06:16:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 06:16:35] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2025-06-06 06:16:35] [INFO ] Transformed 2398 places.
[2025-06-06 06:16:35] [INFO ] Transformed 1954 transitions.
[2025-06-06 06:16:35] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1984 places in 29 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 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 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 953 place count 289 transition count 600
Iterating global reduction 1 with 100 rules applied. Total rules applied 1053 place count 289 transition count 600
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1064 place count 289 transition count 589
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 1137 place count 216 transition count 516
Iterating global reduction 2 with 73 rules applied. Total rules applied 1210 place count 216 transition count 516
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 1243 place count 216 transition count 483
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1268 place count 191 transition count 453
Iterating global reduction 3 with 25 rules applied. Total rules applied 1293 place count 191 transition count 453
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 3 with 49 rules applied. Total rules applied 1342 place count 191 transition count 404
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1346 place count 187 transition count 398
Iterating global reduction 4 with 4 rules applied. Total rules applied 1350 place count 187 transition count 398
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1354 place count 183 transition count 394
Iterating global reduction 4 with 4 rules applied. Total rules applied 1358 place count 183 transition count 394
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1360 place count 181 transition count 391
Iterating global reduction 4 with 2 rules applied. Total rules applied 1362 place count 181 transition count 391
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1363 place count 180 transition count 390
Iterating global reduction 4 with 1 rules applied. Total rules applied 1364 place count 180 transition count 390
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1365 place count 179 transition count 389
Iterating global reduction 4 with 1 rules applied. Total rules applied 1366 place count 179 transition count 389
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1367 place count 178 transition count 388
Iterating global reduction 4 with 1 rules applied. Total rules applied 1368 place count 178 transition count 388
Applied a total of 1368 rules in 111 ms. Remains 178 /414 variables (removed 236) and now considering 388/1954 (removed 1566) transitions.
// Phase 1: matrix 388 rows 178 cols
[2025-06-06 06:16:35] [INFO ] Computed 5 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:16:36] [INFO ] Implicit Places using invariants in 293 ms returned []
[2025-06-06 06:16:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:16:36] [INFO ] State equation strengthened by 254 read => feed constraints.
[2025-06-06 06:16:37] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned []
Implicit Place search using SMT with State Equation took 1676 ms to find 0 implicit places.
Running 387 sub problems to find dead transitions.
[2025-06-06 06:16:37] [INFO ] Invariant cache hit.
[2025-06-06 06:16:37] [INFO ] State equation strengthened by 254 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 1/178 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:16:44] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:16:44] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 6 (OVERLAPS) 388/566 variables, 178/185 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 254/439 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:16:58] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 3 ms to minimize.
Problem TDEAD361 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:17:02] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:17:02] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:17:03] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 15 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD75 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 4/443 constraints. Problems are: Problem set: 3 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/566 variables, and 443 constraints, problems are : Problem set: 3 solved, 384 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 178/178 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 384 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 4/178 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 6/11 constraints. Problems are: Problem set: 3 solved, 384 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 384 unsolved
Problem TDEAD357 is UNSAT
At refinement iteration 6 (OVERLAPS) 388/566 variables, 178/189 constraints. Problems are: Problem set: 4 solved, 383 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 254/443 constraints. Problems are: Problem set: 4 solved, 383 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 383/826 constraints. Problems are: Problem set: 4 solved, 383 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 826 constraints, problems are : Problem set: 4 solved, 383 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 178/178 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 383/387 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60549ms problems are : Problem set: 4 solved, 383 unsolved
Search for dead transitions found 4 dead transitions in 60563ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 178/414 places, 384/1954 transitions.
Reduce places removed 4 places and 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 174 transition count 383
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 4 rules in 9 ms. Remains 174 /178 variables (removed 4) and now considering 383/384 (removed 1) transitions.
// Phase 1: matrix 383 rows 174 cols
[2025-06-06 06:17:38] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:17:38] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-06-06 06:17:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:17:38] [INFO ] State equation strengthened by 252 read => feed constraints.
[2025-06-06 06:17:39] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1452 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 174/414 places, 383/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63836 ms. Remains : 174/414 places, 383/1954 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 31 out of 173 places after structural reductions.
[2025-06-06 06:17:39] [INFO ] Flatten gal took : 45 ms
[2025-06-06 06:17:39] [INFO ] Flatten gal took : 25 ms
[2025-06-06 06:17:39] [INFO ] Input system was already deterministic with 383 transitions.
Support contains 30 out of 173 places (down from 31) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 27
RANDOM walk for 40000 steps (8805 resets) in 3453 ms. (11 steps per ms) remains 23/27 properties
BEST_FIRST walk for 4003 steps (379 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (185 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (422 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (189 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (388 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (172 resets) in 48 ms. (81 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (174 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (172 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (182 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (177 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (177 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (168 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (168 resets) in 61 ms. (64 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (366 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (179 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (188 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (178 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (194 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (196 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (172 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (174 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (175 resets) in 22 ms. (173 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (182 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
// Phase 1: matrix 383 rows 173 cols
[2025-06-06 06:17:41] [INFO ] Computed 4 invariants in 2 ms
[2025-06-06 06:17:41] [INFO ] State equation strengthened by 252 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 84/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 34/144 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 363/507 variables, 144/148 constraints. Problems are: Problem set: 0 solved, 23 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 232/380 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 8 (OVERLAPS) 49/556 variables, 29/409 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 20/429 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 0/429 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 0/556 variables, 0/429 constraints. Problems are: Problem set: 1 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 429 constraints, problems are : Problem set: 1 solved, 22 unsolved in 3606 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 173/173 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 22 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 84/110 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 34/144 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 363/507 variables, 144/148 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 232/380 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/380 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 49/556 variables, 29/409 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 20/429 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 22/451 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:17:48] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/556 variables, 1/452 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/556 variables, and 452 constraints, problems are : Problem set: 1 solved, 22 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 173/173 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 22/23 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8678ms problems are : Problem set: 1 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 383/383 transitions.
Graph (complete) has 658 edges and 173 vertex of which 172 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 172 transition count 381
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 170 transition count 377
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 170 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 170 transition count 376
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 169 transition count 375
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 169 transition count 375
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 168 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 168 transition count 374
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 168 transition count 373
Applied a total of 13 rules in 66 ms. Remains 168 /173 variables (removed 5) and now considering 373/383 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 168/173 places, 373/383 transitions.
RANDOM walk for 40000 steps (8951 resets) in 722 ms. (55 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (391 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (182 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (396 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (183 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (431 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (214 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (192 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (199 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (187 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (196 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (187 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (183 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (392 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (203 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (196 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (170 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (200 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (179 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (190 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (178 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (187 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (208 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 286318 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :10 out of 22
Probabilistic random walk after 286318 steps, saw 126266 distinct states, run finished after 3009 ms. (steps per millisecond=95 ) properties seen :10
// Phase 1: matrix 373 rows 168 cols
[2025-06-06 06:17:53] [INFO ] Computed 3 invariants in 3 ms
[2025-06-06 06:17:53] [INFO ] State equation strengthened by 244 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 82/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/100 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 281/381 variables, 100/103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 152/255 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 160/541 variables, 68/323 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 92/415 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/541 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 415 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1429 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, ReadFeed: 244/244 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 82/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/100 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 281/381 variables, 100/103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 152/255 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 160/541 variables, 68/323 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 92/415 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 12/427 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:17:57] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:18:03] [INFO ] Deduced a trap composed of 54 places in 42 ms of which 3 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/541 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/541 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 429 constraints, problems are : Problem set: 0 solved, 12 unsolved in 17467 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, ReadFeed: 244/244 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18921ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 30132 ms.
Support contains 14 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 373/373 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 160 transition count 299
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 160 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 160 transition count 298
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 153 transition count 291
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 153 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 153 transition count 288
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 40 place count 147 transition count 277
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 147 transition count 277
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 51 place count 147 transition count 272
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 53 place count 145 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 145 transition count 270
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 143 transition count 268
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 143 transition count 268
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 142 transition count 267
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 142 transition count 267
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 69 place count 142 transition count 259
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 141 transition count 258
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 141 transition count 258
Applied a total of 71 rules in 40 ms. Remains 141 /168 variables (removed 27) and now considering 258/373 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 141/168 places, 258/373 transitions.
RANDOM walk for 40000 steps (8945 resets) in 258 ms. (154 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (4182 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1860 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1916 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1854 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1941 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1885 resets) in 61 ms. (645 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1897 resets) in 62 ms. (634 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1889 resets) in 63 ms. (625 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1865 resets) in 61 ms. (645 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1892 resets) in 64 ms. (615 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1846 resets) in 69 ms. (571 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 334266 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 12
Probabilistic random walk after 334266 steps, saw 144178 distinct states, run finished after 3002 ms. (steps per millisecond=111 ) properties seen :0
// Phase 1: matrix 258 rows 141 cols
[2025-06-06 06:18:46] [INFO ] Computed 3 invariants in 1 ms
[2025-06-06 06:18:46] [INFO ] State equation strengthened by 153 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 70/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/88 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 239/327 variables, 88/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 134/225 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 72/399 variables, 53/278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 19/297 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/399 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 297 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1279 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 141/141 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 70/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/88 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 239/327 variables, 88/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 134/225 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 72/399 variables, 53/278 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 19/297 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 12/309 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:18:49] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/399 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 310 constraints, problems are : Problem set: 0 solved, 12 unsolved in 8295 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 141/141 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9591ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 32894 ms.
Support contains 14 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 258/258 transitions.
Applied a total of 0 rules in 13 ms. Remains 141 /141 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 141/141 places, 258/258 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 258/258 transitions.
Applied a total of 0 rules in 10 ms. Remains 141 /141 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2025-06-06 06:19:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:19:28] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-06 06:19:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:19:28] [INFO ] State equation strengthened by 153 read => feed constraints.
[2025-06-06 06:19:31] [INFO ] Implicit Places using invariants and state equation in 2457 ms returned []
Implicit Place search using SMT with State Equation took 2549 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:19:31] [INFO ] Redundant transitions in 17 ms returned []
Running 257 sub problems to find dead transitions.
[2025-06-06 06:19:31] [INFO ] Invariant cache hit.
[2025-06-06 06:19:31] [INFO ] State equation strengthened by 153 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD236 is UNSAT
At refinement iteration 4 (OVERLAPS) 258/399 variables, 141/144 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 153/297 constraints. Problems are: Problem set: 3 solved, 254 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:19:38] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 3 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 1/298 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 0/399 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 298 constraints, problems are : Problem set: 3 solved, 254 unsolved in 24403 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 141/141 constraints, ReadFeed: 153/153 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 254 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 257/395 variables, 138/141 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 152/293 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 22/315 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/315 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 4/399 variables, 3/318 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 1/319 constraints. Problems are: Problem set: 3 solved, 254 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 232/551 constraints. Problems are: Problem set: 3 solved, 254 unsolved
SMT process timed out in 54576ms, After SMT, problems are : Problem set: 3 solved, 254 unsolved
Search for dead transitions found 3 dead transitions in 54580ms
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 : 141/141 places, 255/258 transitions.
Graph (complete) has 483 edges and 141 vertex of which 138 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 12 ms. Remains 138 /141 variables (removed 3) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 138 cols
[2025-06-06 06:20:25] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:20:25] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-06 06:20:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:20:25] [INFO ] State equation strengthened by 152 read => feed constraints.
[2025-06-06 06:20:28] [INFO ] Implicit Places using invariants and state equation in 2710 ms returned []
Implicit Place search using SMT with State Equation took 2804 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 138/141 places, 255/258 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 59980 ms. Remains : 138/141 places, 255/258 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 41 stabilizing places and 67 stable transitions
Graph (complete) has 720 edges and 173 vertex of which 172 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p1||X(X(p2))||G(p3)))&&p0)))'
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 383/383 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 215
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 153 transition count 211
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 135 transition count 191
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 135 transition count 191
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 86 place count 135 transition count 185
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 101 place count 120 transition count 161
Iterating global reduction 2 with 15 rules applied. Total rules applied 116 place count 120 transition count 161
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 128 place count 120 transition count 149
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 132 place count 116 transition count 145
Iterating global reduction 3 with 4 rules applied. Total rules applied 136 place count 116 transition count 145
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 139 place count 113 transition count 142
Iterating global reduction 3 with 3 rules applied. Total rules applied 142 place count 113 transition count 142
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 112 transition count 141
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 112 transition count 141
Applied a total of 144 rules in 9 ms. Remains 112 /173 variables (removed 61) and now considering 141/383 (removed 242) transitions.
// Phase 1: matrix 141 rows 112 cols
[2025-06-06 06:20:28] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:20:28] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-06 06:20:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:20:28] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-06-06 06:20:29] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2025-06-06 06:20:29] [INFO ] Invariant cache hit.
[2025-06-06 06:20:29] [INFO ] State equation strengthened by 62 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, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 5 (OVERLAPS) 141/253 variables, 112/116 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 62/178 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/178 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 06:20:35] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/253 variables, 1/179 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 0/253 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 179 constraints, problems are : Problem set: 3 solved, 137 unsolved in 11576 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 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/108 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 2/111 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 141/252 variables, 111/115 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 62/177 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 18/195 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 06:20:43] [INFO ] Deduced a trap along path composed of 20 places in 30 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 1/196 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 12 (OVERLAPS) 1/253 variables, 1/197 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/253 variables, 119/316 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 1/317 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 06:20:56] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 4 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/253 variables, 1/318 constraints. Problems are: Problem set: 8 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:21:08] [INFO ] Deduced a trap along path composed of 10 places in 26 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 1/319 constraints. Problems are: Problem set: 8 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 253/253 variables, and 319 constraints, problems are : Problem set: 8 solved, 132 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 137/140 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41651ms problems are : Problem set: 8 solved, 132 unsolved
Search for dead transitions found 8 dead transitions in 41653ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 112/173 places, 133/383 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 106 transition count 133
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 6 rules in 1 ms. Remains 106 /112 variables (removed 6) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 106 cols
[2025-06-06 06:21:11] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:21:11] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-06 06:21:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:21:11] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-06 06:21:11] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/173 places, 133/383 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42664 ms. Remains : 106/173 places, 133/383 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Stuttering acceptance computed with spot in 510 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (NOT p2), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-01 finished in 43265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||X(!p0)))))'
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 383/383 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 152 transition count 201
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 152 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 152 transition count 198
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 65 place count 132 transition count 176
Iterating global reduction 1 with 20 rules applied. Total rules applied 85 place count 132 transition count 176
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 93 place count 132 transition count 168
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 110 place count 115 transition count 141
Iterating global reduction 2 with 17 rules applied. Total rules applied 127 place count 115 transition count 141
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 139 place count 115 transition count 129
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 145 place count 109 transition count 123
Iterating global reduction 3 with 6 rules applied. Total rules applied 151 place count 109 transition count 123
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 156 place count 104 transition count 118
Iterating global reduction 3 with 5 rules applied. Total rules applied 161 place count 104 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 101 transition count 115
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 101 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 169 place count 101 transition count 113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 172 place count 98 transition count 108
Iterating global reduction 4 with 3 rules applied. Total rules applied 175 place count 98 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 176 place count 97 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 177 place count 97 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 178 place count 96 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 179 place count 96 transition count 106
Applied a total of 179 rules in 11 ms. Remains 96 /173 variables (removed 77) and now considering 106/383 (removed 277) transitions.
// Phase 1: matrix 106 rows 96 cols
[2025-06-06 06:21:12] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:21:12] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 06:21:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:21:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-06 06:21:12] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-06-06 06:21:12] [INFO ] Invariant cache hit.
[2025-06-06 06:21:12] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 5 (OVERLAPS) 106/202 variables, 96/100 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 42/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 142 constraints, problems are : Problem set: 3 solved, 102 unsolved in 3892 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 2/95 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 106/201 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 42/141 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 16/157 constraints. Problems are: Problem set: 3 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:21:18] [INFO ] Deduced a trap along path composed of 20 places in 23 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/158 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 1/202 variables, 1/159 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 86/245 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/202 variables, 0/245 constraints. Problems are: Problem set: 3 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:21:28] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/202 variables, 1/246 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/202 variables, 0/246 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 17 (OVERLAPS) 0/202 variables, 0/246 constraints. Problems are: Problem set: 3 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 246 constraints, problems are : Problem set: 3 solved, 102 unsolved in 29103 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 102/105 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33055ms problems are : Problem set: 3 solved, 102 unsolved
Search for dead transitions found 3 dead transitions in 33055ms
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 : 96/173 places, 103/383 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 93 transition count 103
Applied a total of 3 rules in 2 ms. Remains 93 /96 variables (removed 3) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 93 cols
[2025-06-06 06:21:45] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:21:45] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-06 06:21:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:21:45] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 06:21:46] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/173 places, 103/383 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33951 ms. Remains : 93/173 places, 103/383 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, p0, (NOT p0), false, false, false]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-04
Product exploration explored 100000 steps with 22422 reset in 221 ms.
Product exploration explored 100000 steps with 22541 reset in 189 ms.
Computed a total of 17 stabilizing places and 21 stable transitions
Graph (complete) has 293 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 17 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 6 states, 10 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8972 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1891 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1654 steps, run visited all 1 properties in 26 ms. (steps per millisecond=63 )
Probabilistic random walk after 1654 steps, saw 793 distinct states, run finished after 45 ms. (steps per millisecond=36 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-04 finished in 34988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 383/383 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 151 transition count 200
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 151 transition count 200
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 151 transition count 196
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 67 place count 132 transition count 175
Iterating global reduction 1 with 19 rules applied. Total rules applied 86 place count 132 transition count 175
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 93 place count 132 transition count 168
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 109 place count 116 transition count 143
Iterating global reduction 2 with 16 rules applied. Total rules applied 125 place count 116 transition count 143
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 136 place count 116 transition count 132
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 141 place count 111 transition count 127
Iterating global reduction 3 with 5 rules applied. Total rules applied 146 place count 111 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 150 place count 107 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 107 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 156 place count 105 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 158 place count 105 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 159 place count 105 transition count 120
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 161 place count 103 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 103 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 164 place count 102 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 102 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 166 place count 101 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 101 transition count 114
Applied a total of 167 rules in 14 ms. Remains 101 /173 variables (removed 72) and now considering 114/383 (removed 269) transitions.
// Phase 1: matrix 114 rows 101 cols
[2025-06-06 06:21:47] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:21:47] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-06 06:21:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:21:47] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-06 06:21:47] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-06 06:21:47] [INFO ] Invariant cache hit.
[2025-06-06 06:21:47] [INFO ] State equation strengthened by 44 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, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD100 is UNSAT
At refinement iteration 5 (OVERLAPS) 114/215 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 44/149 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 149 constraints, problems are : Problem set: 3 solved, 110 unsolved in 4589 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 110 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, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 2/100 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 114/214 variables, 100/104 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 44/148 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 17/165 constraints. Problems are: Problem set: 3 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:21:55] [INFO ] Deduced a trap along path composed of 20 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 1/166 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 1/215 variables, 1/167 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 93/260 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 0/260 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 15 (OVERLAPS) 0/215 variables, 0/260 constraints. Problems are: Problem set: 3 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 260 constraints, problems are : Problem set: 3 solved, 110 unsolved in 22652 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 110/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 27289ms problems are : Problem set: 3 solved, 110 unsolved
Search for dead transitions found 3 dead transitions in 27290ms
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 : 101/173 places, 111/383 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 98 transition count 111
Applied a total of 3 rules in 3 ms. Remains 98 /101 variables (removed 3) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 98 cols
[2025-06-06 06:22:14] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:22:14] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-06 06:22:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:22:14] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 06:22:14] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 98/173 places, 111/383 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27901 ms. Remains : 98/173 places, 111/383 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-05 finished in 28019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 383/383 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 228
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 153 transition count 224
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 135 transition count 204
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 135 transition count 204
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 88 place count 135 transition count 196
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 103 place count 120 transition count 173
Iterating global reduction 2 with 15 rules applied. Total rules applied 118 place count 120 transition count 173
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 130 place count 120 transition count 161
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 134 place count 116 transition count 157
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 116 transition count 157
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 113 transition count 154
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 113 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 112 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 112 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 111 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 111 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 110 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 110 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 109 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 109 transition count 148
Applied a total of 152 rules in 30 ms. Remains 109 /173 variables (removed 64) and now considering 148/383 (removed 235) transitions.
// Phase 1: matrix 148 rows 109 cols
[2025-06-06 06:22:15] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:22:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 06:22:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:22:15] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-06 06:22:15] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:22:15] [INFO ] Redundant transitions in 2 ms returned []
Running 147 sub problems to find dead transitions.
[2025-06-06 06:22:15] [INFO ] Invariant cache hit.
[2025-06-06 06:22:15] [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, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD132 is UNSAT
At refinement iteration 5 (OVERLAPS) 148/257 variables, 109/113 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 74/187 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 187 constraints, problems are : Problem set: 3 solved, 144 unsolved in 6958 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: 147/147 constraints, Known Traps: 0/0 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/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 2/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 148/256 variables, 108/112 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 74/186 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 18/204 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 06:22:27] [INFO ] Deduced a trap along path composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 1/205 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 0/205 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 1/257 variables, 1/206 constraints. Problems are: Problem set: 3 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 126/332 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 06:22:39] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 1/333 constraints. Problems are: Problem set: 3 solved, 144 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 257/257 variables, and 333 constraints, problems are : Problem set: 3 solved, 144 unsolved in 30018 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: 144/147 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37026ms problems are : Problem set: 3 solved, 144 unsolved
Search for dead transitions found 3 dead transitions in 37027ms
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 : 109/173 places, 145/383 transitions.
Graph (complete) has 359 edges and 109 vertex of which 106 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 6 ms. Remains 106 /109 variables (removed 3) and now considering 145/145 (removed 0) transitions.
// Phase 1: matrix 145 rows 106 cols
[2025-06-06 06:22:52] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:22:52] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-06 06:22:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:22:52] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-06-06 06:22:53] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/173 places, 145/383 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38291 ms. Remains : 106/173 places, 145/383 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-06
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-06 finished in 38348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 383/383 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 215
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 153 transition count 211
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 135 transition count 191
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 135 transition count 191
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 87 place count 135 transition count 184
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 102 place count 120 transition count 161
Iterating global reduction 2 with 15 rules applied. Total rules applied 117 place count 120 transition count 161
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 128 place count 120 transition count 150
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 133 place count 115 transition count 145
Iterating global reduction 3 with 5 rules applied. Total rules applied 138 place count 115 transition count 145
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 142 place count 111 transition count 141
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 111 transition count 141
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 148 place count 109 transition count 139
Iterating global reduction 3 with 2 rules applied. Total rules applied 150 place count 109 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 152 place count 109 transition count 137
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 154 place count 107 transition count 133
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 107 transition count 133
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 106 transition count 132
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 159 place count 105 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 105 transition count 131
Applied a total of 160 rules in 14 ms. Remains 105 /173 variables (removed 68) and now considering 131/383 (removed 252) transitions.
// Phase 1: matrix 131 rows 105 cols
[2025-06-06 06:22:53] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:22:53] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-06 06:22:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:22:53] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-06 06:22:53] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2025-06-06 06:22:53] [INFO ] Invariant cache hit.
[2025-06-06 06:22:53] [INFO ] State equation strengthened by 58 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, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD116 is UNSAT
At refinement iteration 5 (OVERLAPS) 131/236 variables, 105/109 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 58/167 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/167 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/167 constraints. Problems are: Problem set: 3 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 167 constraints, problems are : Problem set: 3 solved, 127 unsolved in 5049 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 127 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, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 2/104 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 131/235 variables, 104/108 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 58/166 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 18/184 constraints. Problems are: Problem set: 3 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:23:02] [INFO ] Deduced a trap along path composed of 20 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 1/185 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 12 (OVERLAPS) 1/236 variables, 1/186 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/236 variables, 109/295 constraints. Problems are: Problem set: 3 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:23:12] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 1/296 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 0/296 constraints. Problems are: Problem set: 3 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/236 variables, and 296 constraints, problems are : Problem set: 3 solved, 127 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 127/130 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35102ms problems are : Problem set: 3 solved, 127 unsolved
Search for dead transitions found 3 dead transitions in 35104ms
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/173 places, 128/383 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 128
Applied a total of 3 rules in 2 ms. Remains 102 /105 variables (removed 3) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 102 cols
[2025-06-06 06:23:29] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:23:29] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 06:23:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:23:29] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-06 06:23:29] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/173 places, 128/383 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35998 ms. Remains : 102/173 places, 128/383 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-07 finished in 36163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(!p0) U (!p1&&G(p2)))) U (X(p4)&&p3)))'
Support contains 6 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 383/383 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 154 transition count 229
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 154 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 154 transition count 226
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 58 place count 137 transition count 208
Iterating global reduction 1 with 17 rules applied. Total rules applied 75 place count 137 transition count 208
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 81 place count 137 transition count 202
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 95 place count 123 transition count 180
Iterating global reduction 2 with 14 rules applied. Total rules applied 109 place count 123 transition count 180
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 121 place count 123 transition count 168
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 124 place count 120 transition count 165
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 120 transition count 165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 118 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 118 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 117 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 117 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 136 place count 117 transition count 159
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 116 transition count 158
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 116 transition count 158
Applied a total of 138 rules in 16 ms. Remains 116 /173 variables (removed 57) and now considering 158/383 (removed 225) transitions.
// Phase 1: matrix 158 rows 116 cols
[2025-06-06 06:23:29] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:23:29] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-06 06:23:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:23:29] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-06 06:23:30] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2025-06-06 06:23:30] [INFO ] Invariant cache hit.
[2025-06-06 06:23:30] [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/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 1/116 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD142 is UNSAT
At refinement iteration 5 (OVERLAPS) 158/274 variables, 116/120 constraints. Problems are: Problem set: 3 solved, 154 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 75/195 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/195 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/195 constraints. Problems are: Problem set: 3 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 195 constraints, problems are : Problem set: 3 solved, 154 unsolved in 8030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 2/115 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 158/273 variables, 115/119 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 75/194 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 19/213 constraints. Problems are: Problem set: 3 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:23:41] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/214 constraints. Problems are: Problem set: 3 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:23:46] [INFO ] Deduced a trap along path composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 1/215 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 0/215 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 13 (OVERLAPS) 1/274 variables, 1/216 constraints. Problems are: Problem set: 3 solved, 154 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 135/351 constraints. Problems are: Problem set: 3 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:24:04] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 4 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:24:04] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 4 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD137 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 353 constraints, problems are : Problem set: 11 solved, 146 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 154/157 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38115ms problems are : Problem set: 11 solved, 146 unsolved
Search for dead transitions found 11 dead transitions in 38116ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 116/173 places, 147/383 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 108 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 8 rules in 3 ms. Remains 108 /116 variables (removed 8) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 108 cols
[2025-06-06 06:24:08] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:24:08] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-06 06:24:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:24:08] [INFO ] State equation strengthened by 70 read => feed constraints.
[2025-06-06 06:24:09] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 108/173 places, 147/383 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39530 ms. Remains : 108/173 places, 147/383 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p3) (NOT p4)), (OR (NOT p2) p1), (NOT p4), true, p0, (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-08
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-08 finished in 39857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(!p0) U X(p1)))&&F(p2)))'
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 383/383 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 228
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 153 transition count 224
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 135 transition count 204
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 135 transition count 204
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 87 place count 135 transition count 197
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 102 place count 120 transition count 174
Iterating global reduction 2 with 15 rules applied. Total rules applied 117 place count 120 transition count 174
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 129 place count 120 transition count 162
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 133 place count 116 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 116 transition count 158
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 140 place count 113 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 143 place count 113 transition count 155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 111 transition count 153
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 111 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 150 place count 111 transition count 150
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 109 transition count 146
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 108 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 108 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 107 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 107 transition count 144
Applied a total of 158 rules in 17 ms. Remains 107 /173 variables (removed 66) and now considering 144/383 (removed 239) transitions.
// Phase 1: matrix 144 rows 107 cols
[2025-06-06 06:24:09] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:24:09] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-06 06:24:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:24:09] [INFO ] State equation strengthened by 70 read => feed constraints.
[2025-06-06 06:24:09] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2025-06-06 06:24:09] [INFO ] Invariant cache hit.
[2025-06-06 06:24:09] [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/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 5 (OVERLAPS) 144/251 variables, 107/111 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 70/181 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/251 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 181 constraints, problems are : Problem set: 3 solved, 140 unsolved in 6451 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: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 140 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, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 2/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 144/250 variables, 106/110 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 70/180 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 18/198 constraints. Problems are: Problem set: 3 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:24:20] [INFO ] Deduced a trap along path composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 1/199 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/199 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 1/251 variables, 1/200 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 122/322 constraints. Problems are: Problem set: 3 solved, 140 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:24:30] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 1/323 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 0/323 constraints. Problems are: Problem set: 3 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/251 variables, and 323 constraints, problems are : Problem set: 3 solved, 140 unsolved in 30012 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: 140/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36517ms problems are : Problem set: 3 solved, 140 unsolved
Search for dead transitions found 3 dead transitions in 36518ms
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 : 107/173 places, 141/383 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 104 transition count 141
Applied a total of 3 rules in 1 ms. Remains 104 /107 variables (removed 3) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2025-06-06 06:24:46] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:24:46] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-06 06:24:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:24:46] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-06 06:24:47] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/173 places, 141/383 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37854 ms. Remains : 104/173 places, 141/383 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-09
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-09 finished in 38155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&(!p1 U p2)) U X(X(!p3)))))'
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 383/383 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 155 transition count 230
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 155 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 155 transition count 227
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 56 place count 138 transition count 208
Iterating global reduction 1 with 17 rules applied. Total rules applied 73 place count 138 transition count 208
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 79 place count 138 transition count 202
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 93 place count 124 transition count 180
Iterating global reduction 2 with 14 rules applied. Total rules applied 107 place count 124 transition count 180
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 116 place count 124 transition count 171
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 121 place count 119 transition count 166
Iterating global reduction 3 with 5 rules applied. Total rules applied 126 place count 119 transition count 166
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 130 place count 115 transition count 162
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 115 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 113 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 113 transition count 160
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 141 place count 113 transition count 157
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 143 place count 111 transition count 153
Iterating global reduction 4 with 2 rules applied. Total rules applied 145 place count 111 transition count 153
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 146 place count 110 transition count 152
Iterating global reduction 4 with 1 rules applied. Total rules applied 147 place count 110 transition count 152
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 148 place count 109 transition count 151
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 109 transition count 151
Applied a total of 149 rules in 19 ms. Remains 109 /173 variables (removed 64) and now considering 151/383 (removed 232) transitions.
// Phase 1: matrix 151 rows 109 cols
[2025-06-06 06:24:47] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:24:47] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 06:24:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:24:47] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-06 06:24:48] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-06 06:24:48] [INFO ] Invariant cache hit.
[2025-06-06 06:24:48] [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/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 5 (OVERLAPS) 151/260 variables, 109/113 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 75/188 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/188 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 0/260 variables, 0/188 constraints. Problems are: Problem set: 3 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 188 constraints, problems are : Problem set: 3 solved, 147 unsolved in 6661 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 147 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, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 2/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 151/259 variables, 108/112 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 75/187 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 18/205 constraints. Problems are: Problem set: 3 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:24:59] [INFO ] Deduced a trap along path composed of 20 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 1/206 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/206 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 12 (OVERLAPS) 1/260 variables, 1/207 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 129/336 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 0/336 constraints. Problems are: Problem set: 3 solved, 147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 260/260 variables, and 336 constraints, problems are : Problem set: 3 solved, 147 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 147/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36737ms problems are : Problem set: 3 solved, 147 unsolved
Search for dead transitions found 3 dead transitions in 36738ms
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/173 places, 148/383 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 148
Applied a total of 3 rules in 1 ms. Remains 106 /109 variables (removed 3) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 106 cols
[2025-06-06 06:25:24] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:25:24] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-06 06:25:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:25:24] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-06 06:25:25] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/173 places, 148/383 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37592 ms. Remains : 106/173 places, 148/383 transitions.
Stuttering acceptance computed with spot in 455 ms :[p3, p3, p3, p3, (AND (NOT p2) p3), p3, true, p3, (AND (NOT p2) p3), p3, (AND (NOT p2) p3), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-10
Product exploration explored 100000 steps with 28587 reset in 225 ms.
Product exploration explored 100000 steps with 28532 reset in 230 ms.
Computed a total of 18 stabilizing places and 25 stable transitions
Graph (complete) has 361 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 18 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (OR p0 (AND (NOT p2) p1)))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p0 (AND (NOT p2) p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 121 ms. Reduced automaton from 12 states, 22 edges and 4 AP (stutter sensitive) to 10 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 404 ms :[p3, p3, p3, p3, true, p3, (AND (NOT p2) p3), p3, (AND (NOT p2) p3), (NOT p2)]
RANDOM walk for 40000 steps (8898 resets) in 233 ms. (170 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40004 steps (1794 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1784 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1833 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1829 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1814 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1813 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1845 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
[2025-06-06 06:25:26] [INFO ] Invariant cache hit.
[2025-06-06 06:25:26] [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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 22/79 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 130/209 variables, 79/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 45/254 variables, 27/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 18/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/254 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 184 constraints, problems are : Problem set: 0 solved, 7 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
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, 7 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 22/79 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 130/209 variables, 79/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 45/254 variables, 27/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 18/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 7/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/254 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 191 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2602 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3107ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 17639 ms.
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 148/148 transitions.
Graph (complete) has 324 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 146
Applied a total of 3 rules in 3 ms. Remains 105 /106 variables (removed 1) and now considering 146/148 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 105/106 places, 146/148 transitions.
RANDOM walk for 40000 steps (8952 resets) in 127 ms. (312 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1825 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1748 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1826 resets) in 54 ms. (727 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1819 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1738 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1834 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1801 resets) in 50 ms. (784 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 424816 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :3 out of 7
Probabilistic random walk after 424816 steps, saw 210396 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :3
// Phase 1: matrix 146 rows 105 cols
[2025-06-06 06:25:50] [INFO ] Computed 3 invariants in 3 ms
[2025-06-06 06:25:50] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 128/189 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 54/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 62/251 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 18/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/251 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 180 constraints, problems are : Problem set: 0 solved, 4 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 128/189 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 54/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 62/251 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 18/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/251 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 184 constraints, problems are : Problem set: 0 solved, 4 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 978ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3012 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 146/146 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 105/105 places, 146/146 transitions.
RANDOM walk for 40000 steps (8900 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1785 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1869 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1788 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1852 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 436425 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 4
Probabilistic random walk after 436425 steps, saw 215674 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
[2025-06-06 06:25:57] [INFO ] Invariant cache hit.
[2025-06-06 06:25:57] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 128/189 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 54/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 62/251 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 18/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/251 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 180 constraints, problems are : Problem set: 0 solved, 4 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 128/189 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 54/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 62/251 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 18/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/251 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 184 constraints, problems are : Problem set: 0 solved, 4 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1006ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3067 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 146/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 105/105 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 146/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2025-06-06 06:26:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:26:02] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 06:26:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:26:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-06 06:26:02] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:26:02] [INFO ] Redundant transitions in 2 ms returned []
Running 145 sub problems to find dead transitions.
[2025-06-06 06:26:02] [INFO ] Invariant cache hit.
[2025-06-06 06:26:02] [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/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/251 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 72/180 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 180 constraints, problems are : Problem set: 0 solved, 145 unsolved in 8177 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 72/72 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/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/251 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 72/180 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 145/325 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/251 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 325 constraints, problems are : Problem set: 0 solved, 145 unsolved in 27464 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35706ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 35707ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36049 ms. Remains : 105/105 places, 146/146 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 105 transition count 140
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 100 transition count 140
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 11 place count 100 transition count 126
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 39 place count 86 transition count 126
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 53 place count 79 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 78 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 78 transition count 128
Applied a total of 56 rules in 19 ms. Remains 78 /105 variables (removed 27) and now considering 128/146 (removed 18) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 128 rows 78 cols
[2025-06-06 06:26:38] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 06:26:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 06:26:38] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 06:26:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 06:26:38] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2025-06-06 06:26:38] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-06-06 06:26:38] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 430 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (OR p0 (AND (NOT p2) p1)))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR p0 (AND (NOT p2) p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1 (NOT p3)))), (F (NOT (AND (OR p0 (NOT p2) (NOT p3)) (OR p0 p1 (NOT p3))))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F p3), (F (NOT (OR p2 p1 (NOT p3)))), (F p0)]
Knowledge based reduction with 15 factoid took 345 ms. Reduced automaton from 10 states, 16 edges and 4 AP (stutter sensitive) to 10 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 442 ms :[p3, p3, p3, p3, true, p3, (AND (NOT p2) p3), p3, (AND (NOT p2) p3), (NOT p2)]
Stuttering acceptance computed with spot in 383 ms :[p3, p3, p3, p3, true, p3, (AND (NOT p2) p3), p3, (AND (NOT p2) p3), (NOT p2)]
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 106 cols
[2025-06-06 06:26:39] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:26:39] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-06 06:26:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:26:39] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-06 06:26:40] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-06-06 06:26:40] [INFO ] Invariant cache hit.
[2025-06-06 06:26:40] [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/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 148/254 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 74/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 0/254 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 184 constraints, problems are : Problem set: 0 solved, 147 unsolved in 6274 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 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, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 148/254 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 74/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 147/331 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (OVERLAPS) 0/254 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 331 constraints, problems are : Problem set: 0 solved, 147 unsolved in 23713 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30060ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 30062ms
Finished structural reductions in LTL mode , in 1 iterations and 30461 ms. Remains : 106/106 places, 148/148 transitions.
Computed a total of 18 stabilizing places and 25 stable transitions
Graph (complete) has 361 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 18 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 10 states, 16 edges and 4 AP (stutter sensitive) to 10 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[p3, p3, p3, p3, true, p3, (AND (NOT p2) p3), p3, (AND (NOT p2) p3), (NOT p2)]
RANDOM walk for 40000 steps (8916 resets) in 320 ms. (124 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40003 steps (1772 resets) in 155 ms. (256 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1812 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1748 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1833 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1814 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1848 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1794 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
[2025-06-06 06:27:10] [INFO ] Invariant cache hit.
[2025-06-06 06:27: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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 22/79 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 130/209 variables, 79/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 45/254 variables, 27/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 18/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/254 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 184 constraints, problems are : Problem set: 0 solved, 7 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
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, 7 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 22/79 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 130/209 variables, 79/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 45/254 variables, 27/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 18/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 7/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/254 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 191 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2106 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2779ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 7856 ms.
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 148/148 transitions.
Graph (complete) has 324 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 146
Applied a total of 3 rules in 9 ms. Remains 105 /106 variables (removed 1) and now considering 146/148 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 105/106 places, 146/148 transitions.
RANDOM walk for 40000 steps (8811 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1813 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1881 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1732 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1831 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1817 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1812 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 557572 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :3 out of 7
Probabilistic random walk after 557572 steps, saw 274891 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :3
// Phase 1: matrix 146 rows 105 cols
[2025-06-06 06:27:24] [INFO ] Computed 3 invariants in 1 ms
[2025-06-06 06:27:24] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 128/189 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 54/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 62/251 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 18/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/251 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 180 constraints, problems are : Problem set: 0 solved, 4 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 128/189 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 54/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 62/251 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 18/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/251 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 184 constraints, problems are : Problem set: 0 solved, 4 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1099ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1219 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 146/146 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 105/105 places, 146/146 transitions.
RANDOM walk for 40000 steps (8879 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1810 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1754 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1758 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1871 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 561700 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 4
Probabilistic random walk after 561700 steps, saw 276787 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
[2025-06-06 06:27:30] [INFO ] Invariant cache hit.
[2025-06-06 06:27:30] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 128/189 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 54/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 62/251 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 18/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/251 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 180 constraints, problems are : Problem set: 0 solved, 4 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 128/189 variables, 61/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 54/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 62/251 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 18/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/251 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 184 constraints, problems are : Problem set: 0 solved, 4 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1071ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1836 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 146/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 105/105 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 146/146 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2025-06-06 06:27:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:27:33] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-06 06:27:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:27:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-06 06:27:33] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:27:33] [INFO ] Redundant transitions in 1 ms returned []
Running 145 sub problems to find dead transitions.
[2025-06-06 06:27:33] [INFO ] Invariant cache hit.
[2025-06-06 06:27:33] [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/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/251 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 72/180 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 180 constraints, problems are : Problem set: 0 solved, 145 unsolved in 8143 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 72/72 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/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/251 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 72/180 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 145/325 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/251 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 325 constraints, problems are : Problem set: 0 solved, 145 unsolved in 26924 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35134ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 35134ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35496 ms. Remains : 105/105 places, 146/146 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 105 transition count 140
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 100 transition count 140
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 11 place count 100 transition count 126
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 39 place count 86 transition count 126
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 53 place count 79 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 78 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 78 transition count 128
Applied a total of 56 rules in 9 ms. Remains 78 /105 variables (removed 27) and now considering 128/146 (removed 18) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 128 rows 78 cols
[2025-06-06 06:28:08] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 06:28:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 06:28:08] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 06:28:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 06:28:09] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2025-06-06 06:28:09] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-06-06 06:28:09] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 435 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p1 (NOT p3)) (OR p0 (NOT p2) (NOT p3))))), (F (NOT (OR p1 p2 (NOT p3)))), (F p2), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F p3), (F p0), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 1 factoid took 298 ms. Reduced automaton from 10 states, 16 edges and 4 AP (stutter sensitive) to 10 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[p3, p3, p3, p3, true, p3, (AND (NOT p2) p3), p3, (AND (NOT p2) p3), (NOT p2)]
Stuttering acceptance computed with spot in 404 ms :[p3, p3, p3, p3, true, p3, (AND (NOT p2) p3), p3, (AND (NOT p2) p3), (NOT p2)]
Stuttering acceptance computed with spot in 395 ms :[p3, p3, p3, p3, true, p3, (AND (NOT p2) p3), p3, (AND (NOT p2) p3), (NOT p2)]
Product exploration explored 100000 steps with 28538 reset in 154 ms.
Product exploration explored 100000 steps with 28594 reset in 145 ms.
Applying partial POR strategy [false, false, false, true, true, false, false, false, true, true]
Stuttering acceptance computed with spot in 412 ms :[p3, p3, p3, p3, true, p3, (AND (NOT p2) p3), p3, (AND (NOT p2) p3), (NOT p2)]
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 148/148 transitions.
Applied a total of 0 rules in 9 ms. Remains 106 /106 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:28:11] [INFO ] Redundant transitions in 1 ms returned []
Running 147 sub problems to find dead transitions.
// Phase 1: matrix 148 rows 106 cols
[2025-06-06 06:28:11] [INFO ] Computed 4 invariants in 2 ms
[2025-06-06 06:28:11] [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/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 148/254 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 74/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 0/254 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 184 constraints, problems are : Problem set: 0 solved, 147 unsolved in 6200 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 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, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 148/254 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 74/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 147/331 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (OVERLAPS) 0/254 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 331 constraints, problems are : Problem set: 0 solved, 147 unsolved in 23840 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30104ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 30105ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30121 ms. Remains : 106/106 places, 148/148 transitions.
Built C files in :
/tmp/ltsmin8144541393669323057
[2025-06-06 06:28:41] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8144541393669323057
Running compilation step : cd /tmp/ltsmin8144541393669323057;'/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 377 ms.
Running link step : cd /tmp/ltsmin8144541393669323057;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin8144541393669323057;'/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/stateBased10175221405990952779.hoa' '--buchi-type=spotba'
LTSmin run took 168 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-10 finished in 234804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||G(p2))))'
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 383/383 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 216
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 153 transition count 212
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 135 transition count 192
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 135 transition count 192
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 88 place count 135 transition count 184
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 103 place count 120 transition count 160
Iterating global reduction 2 with 15 rules applied. Total rules applied 118 place count 120 transition count 160
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 130 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 134 place count 116 transition count 144
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 116 transition count 144
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 113 transition count 141
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 113 transition count 141
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 146 place count 111 transition count 139
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 111 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 150 place count 111 transition count 137
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 151 place count 110 transition count 136
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 110 transition count 136
Applied a total of 152 rules in 20 ms. Remains 110 /173 variables (removed 63) and now considering 136/383 (removed 247) transitions.
// Phase 1: matrix 136 rows 110 cols
[2025-06-06 06:28:42] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:28:42] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-06 06:28:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:28:42] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-06-06 06:28:42] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2025-06-06 06:28:42] [INFO ] Invariant cache hit.
[2025-06-06 06:28:42] [INFO ] State equation strengthened by 60 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, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD122 is UNSAT
At refinement iteration 5 (OVERLAPS) 136/246 variables, 110/114 constraints. Problems are: Problem set: 3 solved, 132 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 60/174 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/246 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 174 constraints, problems are : Problem set: 3 solved, 132 unsolved in 6237 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 132 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, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 2/109 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 136/245 variables, 109/113 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 60/173 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 18/191 constraints. Problems are: Problem set: 3 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:28:51] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/192 constraints. Problems are: Problem set: 3 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:28:55] [INFO ] Deduced a trap along path composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 1/193 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/193 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 13 (OVERLAPS) 1/246 variables, 1/194 constraints. Problems are: Problem set: 3 solved, 132 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 114/308 constraints. Problems are: Problem set: 3 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:29:10] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:29:10] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 2/310 constraints. Problems are: Problem set: 3 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 310 constraints, problems are : Problem set: 3 solved, 132 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 132/135 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36297ms problems are : Problem set: 3 solved, 132 unsolved
Search for dead transitions found 3 dead transitions in 36298ms
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/173 places, 133/383 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 133
Applied a total of 3 rules in 3 ms. Remains 107 /110 variables (removed 3) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 107 cols
[2025-06-06 06:29:19] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:29:19] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 06:29:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:29:19] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-06 06:29:19] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 107/173 places, 133/383 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37428 ms. Remains : 107/173 places, 133/383 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-11 finished in 37619 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(p1))))'
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 383/383 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 152 transition count 214
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 152 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 152 transition count 210
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 133 transition count 189
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 133 transition count 189
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 91 place count 133 transition count 182
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 107 place count 117 transition count 157
Iterating global reduction 2 with 16 rules applied. Total rules applied 123 place count 117 transition count 157
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 135 place count 117 transition count 145
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 140 place count 112 transition count 140
Iterating global reduction 3 with 5 rules applied. Total rules applied 145 place count 112 transition count 140
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 149 place count 108 transition count 136
Iterating global reduction 3 with 4 rules applied. Total rules applied 153 place count 108 transition count 136
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 155 place count 106 transition count 134
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 106 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 159 place count 106 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 161 place count 104 transition count 128
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 164 place count 103 transition count 127
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 103 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 166 place count 102 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 102 transition count 126
Applied a total of 167 rules in 31 ms. Remains 102 /173 variables (removed 71) and now considering 126/383 (removed 257) transitions.
// Phase 1: matrix 126 rows 102 cols
[2025-06-06 06:29:20] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:29:20] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 06:29:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:29:20] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 06:29:20] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:29:20] [INFO ] Redundant transitions in 1 ms returned []
Running 125 sub problems to find dead transitions.
[2025-06-06 06:29:20] [INFO ] Invariant cache hit.
[2025-06-06 06:29:20] [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
All remaining problems are real, not stopping.
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 7952 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 06:29:31] [INFO ] Deduced a trap along path composed of 20 places in 30 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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:29:47] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/228 variables, 1/286 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/286 constraints. Problems are: Problem set: 3 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 228/228 variables, and 286 constraints, problems are : Problem set: 3 solved, 122 unsolved in 30012 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: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38004ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 38005ms
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 : 102/173 places, 123/383 transitions.
Graph (complete) has 325 edges and 102 vertex of which 99 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 5 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 06:29:58] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:29:58] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-06 06:29:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:29:58] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 06:29:58] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/173 places, 123/383 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38762 ms. Remains : 99/173 places, 123/383 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-12
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-12 finished in 38907 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))&&G((X(p0)||p1))))'
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 383/383 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 215
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 153 transition count 212
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 61 place count 135 transition count 193
Iterating global reduction 1 with 18 rules applied. Total rules applied 79 place count 135 transition count 193
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 86 place count 135 transition count 186
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 101 place count 120 transition count 162
Iterating global reduction 2 with 15 rules applied. Total rules applied 116 place count 120 transition count 162
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 128 place count 120 transition count 150
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 132 place count 116 transition count 146
Iterating global reduction 3 with 4 rules applied. Total rules applied 136 place count 116 transition count 146
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 139 place count 113 transition count 143
Iterating global reduction 3 with 3 rules applied. Total rules applied 142 place count 113 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 112 transition count 142
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 112 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 146 place count 112 transition count 140
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 147 place count 111 transition count 139
Iterating global reduction 4 with 1 rules applied. Total rules applied 148 place count 111 transition count 139
Applied a total of 148 rules in 12 ms. Remains 111 /173 variables (removed 62) and now considering 139/383 (removed 244) transitions.
// Phase 1: matrix 139 rows 111 cols
[2025-06-06 06:29:58] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:29:58] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 06:29:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:29:59] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-06 06:29:59] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2025-06-06 06:29:59] [INFO ] Invariant cache hit.
[2025-06-06 06:29:59] [INFO ] State equation strengthened by 61 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, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD125 is UNSAT
At refinement iteration 5 (OVERLAPS) 139/250 variables, 111/115 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 61/176 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:30:05] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/250 variables, 1/177 constraints. Problems are: Problem set: 3 solved, 135 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/177 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/250 variables, 0/177 constraints. Problems are: Problem set: 3 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 177 constraints, problems are : Problem set: 3 solved, 135 unsolved in 10834 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 135 unsolved
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: 3 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 2/110 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 139/249 variables, 110/114 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 61/175 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 18/193 constraints. Problems are: Problem set: 3 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:30:12] [INFO ] Deduced a trap along path composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/194 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 12 (OVERLAPS) 1/250 variables, 1/195 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 117/312 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 1/313 constraints. Problems are: Problem set: 3 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:30:24] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 3 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 1/314 constraints. Problems are: Problem set: 6 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 250/250 variables, and 314 constraints, problems are : Problem set: 6 solved, 132 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 135/138 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40911ms problems are : Problem set: 6 solved, 132 unsolved
Search for dead transitions found 6 dead transitions in 40912ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 111/173 places, 133/383 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 105 transition count 133
Applied a total of 6 rules in 1 ms. Remains 105 /111 variables (removed 6) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 105 cols
[2025-06-06 06:30:40] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:30:40] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-06 06:30:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:30:40] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-06 06:30:40] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/173 places, 133/383 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41775 ms. Remains : 105/173 places, 133/383 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-13 finished in 41983 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 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 383/383 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 152 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 152 transition count 203
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 47 place count 152 transition count 198
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 66 place count 133 transition count 177
Iterating global reduction 1 with 19 rules applied. Total rules applied 85 place count 133 transition count 177
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 93 place count 133 transition count 169
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 109 place count 117 transition count 143
Iterating global reduction 2 with 16 rules applied. Total rules applied 125 place count 117 transition count 143
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 136 place count 117 transition count 132
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 142 place count 111 transition count 126
Iterating global reduction 3 with 6 rules applied. Total rules applied 148 place count 111 transition count 126
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 152 place count 107 transition count 122
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 107 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 105 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 105 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 162 place count 105 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 164 place count 103 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 166 place count 103 transition count 116
Applied a total of 166 rules in 15 ms. Remains 103 /173 variables (removed 70) and now considering 116/383 (removed 267) transitions.
// Phase 1: matrix 116 rows 103 cols
[2025-06-06 06:30:40] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:30:40] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 06:30:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:30:41] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-06 06:30:41] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2025-06-06 06:30:41] [INFO ] Invariant cache hit.
[2025-06-06 06:30:41] [INFO ] State equation strengthened by 45 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, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 5 (OVERLAPS) 116/219 variables, 103/107 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 45/152 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/152 constraints. Problems are: Problem set: 3 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:30:44] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:30:45] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/219 variables, 2/154 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 3 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 3 solved, 112 unsolved in 7621 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 2/102 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 116/218 variables, 102/107 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 45/152 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 17/169 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 12 (OVERLAPS) 1/219 variables, 1/170 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 95/265 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 1/266 constraints. Problems are: Problem set: 3 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:31:00] [INFO ] Deduced a trap along path composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 1/267 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 0/267 constraints. Problems are: Problem set: 3 solved, 112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 219/219 variables, and 267 constraints, problems are : Problem set: 3 solved, 112 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 112/115 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37715ms problems are : Problem set: 3 solved, 112 unsolved
Search for dead transitions found 3 dead transitions in 37716ms
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 : 103/173 places, 113/383 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 100 transition count 113
Applied a total of 3 rules in 2 ms. Remains 100 /103 variables (removed 3) and now considering 113/113 (removed 0) transitions.
// Phase 1: matrix 113 rows 100 cols
[2025-06-06 06:31:18] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:31:18] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-06 06:31:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:31:19] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-06 06:31:19] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/173 places, 113/383 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38364 ms. Remains : 100/173 places, 113/383 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-15
Product exploration explored 100000 steps with 22497 reset in 122 ms.
Product exploration explored 100000 steps with 22376 reset in 124 ms.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 317 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 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 152 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8912 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1928 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2064357 steps, run timeout after 3001 ms. (steps per millisecond=687 ) properties seen :0 out of 1
Probabilistic random walk after 2064357 steps, saw 963979 distinct states, run finished after 3001 ms. (steps per millisecond=687 ) properties seen :0
[2025-06-06 06:31:22] [INFO ] Invariant cache hit.
[2025-06-06 06:31:22] [INFO ] State equation strengthened by 44 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) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/174 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 29/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 39/213 variables, 24/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 15/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/213 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 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) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/174 variables, 76/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 29/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 39/213 variables, 24/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 15/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/213 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 408ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 166 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 113/113 transitions.
Graph (complete) has 283 edges and 100 vertex of which 99 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 99 transition count 111
Applied a total of 3 rules in 3 ms. Remains 99 /100 variables (removed 1) and now considering 111/113 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 99/100 places, 111/113 transitions.
RANDOM walk for 40000 steps (9036 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1898 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2183679 steps, run timeout after 3001 ms. (steps per millisecond=727 ) properties seen :0 out of 1
Probabilistic random walk after 2183679 steps, saw 1017588 distinct states, run finished after 3001 ms. (steps per millisecond=727 ) properties seen :0
// Phase 1: matrix 111 rows 99 cols
[2025-06-06 06:31:26] [INFO ] Computed 3 invariants in 2 ms
[2025-06-06 06:31:26] [INFO ] State equation strengthened by 42 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) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/158 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 27/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 52/210 variables, 37/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/210 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 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) 51/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/158 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 27/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 52/210 variables, 37/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/210 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 443ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 169 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 99/99 places, 111/111 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2025-06-06 06:31:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:31:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 06:31:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:31:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-06 06:31:27] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:31:27] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2025-06-06 06:31:27] [INFO ] Invariant cache hit.
[2025-06-06 06:31:27] [INFO ] State equation strengthened by 42 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, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/210 variables, 99/102 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 42/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:31:30] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 3 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/210 variables, 1/145 constraints. Problems are: Problem set: 2 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/145 constraints. Problems are: Problem set: 2 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/145 constraints. Problems are: Problem set: 2 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 145 constraints, problems are : Problem set: 2 solved, 108 unsolved in 6816 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 3/99 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 111/210 variables, 99/103 constraints. Problems are: Problem set: 2 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 42/145 constraints. Problems are: Problem set: 2 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 108/253 constraints. Problems are: Problem set: 2 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/253 constraints. Problems are: Problem set: 2 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/253 constraints. Problems are: Problem set: 2 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 253 constraints, problems are : Problem set: 2 solved, 108 unsolved in 19139 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 108/110 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25994ms problems are : Problem set: 2 solved, 108 unsolved
Search for dead transitions found 2 dead transitions in 25995ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/99 places, 109/111 transitions.
Graph (complete) has 277 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 97 /99 variables (removed 2) and now considering 109/109 (removed 0) transitions.
// Phase 1: matrix 109 rows 97 cols
[2025-06-06 06:31:53] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:31:53] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-06 06:31:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:31:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 06:31:53] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 97/99 places, 109/111 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 26554 ms. Remains : 97/99 places, 109/111 transitions.
RANDOM walk for 40000 steps (9042 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1866 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2164607 steps, run timeout after 3001 ms. (steps per millisecond=721 ) properties seen :0 out of 1
Probabilistic random walk after 2164607 steps, saw 1009261 distinct states, run finished after 3001 ms. (steps per millisecond=721 ) properties seen :0
[2025-06-06 06:31:56] [INFO ] Invariant cache hit.
[2025-06-06 06:31:56] [INFO ] State equation strengthened by 41 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) 70/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 128/200 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/204 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/206 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 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) 70/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 128/200 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/204 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/206 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 509ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 284 ms.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 97/97 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2025-06-06 06:31:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:31:57] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 06:31:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:31:57] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 06:31:57] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:31:57] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2025-06-06 06:31:57] [INFO ] Invariant cache hit.
[2025-06-06 06:31:57] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/206 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:32:01] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/206 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 141 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/206 variables, 97/100 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 108/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 249 constraints, problems are : Problem set: 0 solved, 108 unsolved in 17751 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24970ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 24970ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25232 ms. Remains : 97/97 places, 109/109 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 97 transition count 102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 91 transition count 102
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 13 place count 91 transition count 86
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 45 place count 75 transition count 86
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 53 place count 71 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 55 place count 70 transition count 90
Applied a total of 55 rules in 15 ms. Remains 70 /97 variables (removed 27) and now considering 90/109 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 90 rows 70 cols
[2025-06-06 06:32:22] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 06:32:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 06:32:22] [INFO ] After 63ms 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 06:32:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 06:32:22] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 06:32:22] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 06:32:22] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 161 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 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 175 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 113/113 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 113/113 (removed 0) transitions.
// Phase 1: matrix 113 rows 100 cols
[2025-06-06 06:32:23] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:32:23] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 06:32:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:32:23] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-06 06:32:23] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2025-06-06 06:32:23] [INFO ] Invariant cache hit.
[2025-06-06 06:32:23] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/213 variables, 100/104 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 44/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:32:27] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/213 variables, 1/149 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 149 constraints, problems are : Problem set: 2 solved, 110 unsolved in 6308 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 3/100 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 113/213 variables, 100/105 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 44/149 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 110/259 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/259 constraints. Problems are: Problem set: 2 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 259 constraints, problems are : Problem set: 2 solved, 110 unsolved in 13550 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 110/112 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19901ms problems are : Problem set: 2 solved, 110 unsolved
Search for dead transitions found 2 dead transitions in 19902ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 100/100 places, 111/113 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 98 transition count 111
Applied a total of 2 rules in 2 ms. Remains 98 /100 variables (removed 2) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 98 cols
[2025-06-06 06:32:43] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:32:43] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 06:32:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:32:43] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 06:32:43] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 98/100 places, 111/113 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20534 ms. Remains : 98/100 places, 111/113 transitions.
Computed a total of 20 stabilizing places and 26 stable transitions
Graph (complete) has 310 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 26 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 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 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8980 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1866 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2215306 steps, run timeout after 3001 ms. (steps per millisecond=738 ) properties seen :0 out of 1
Probabilistic random walk after 2215306 steps, saw 1031303 distinct states, run finished after 3001 ms. (steps per millisecond=738 ) properties seen :0
[2025-06-06 06:32:47] [INFO ] Invariant cache hit.
[2025-06-06 06:32:47] [INFO ] State equation strengthened by 43 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) 49/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/165 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 28/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/209 variables, 29/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/209 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 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) 49/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/165 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 28/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/209 variables, 29/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 15/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 586ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 111/111 transitions.
Graph (complete) has 277 edges and 98 vertex of which 97 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 97 transition count 109
Applied a total of 3 rules in 3 ms. Remains 97 /98 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/98 places, 109/111 transitions.
RANDOM walk for 40000 steps (9005 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1901 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2264415 steps, run timeout after 3001 ms. (steps per millisecond=754 ) properties seen :0 out of 1
Probabilistic random walk after 2264415 steps, saw 1054434 distinct states, run finished after 3001 ms. (steps per millisecond=754 ) properties seen :0
// Phase 1: matrix 109 rows 97 cols
[2025-06-06 06:32:50] [INFO ] Computed 2 invariants in 2 ms
[2025-06-06 06:32:50] [INFO ] State equation strengthened by 41 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) 70/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 128/200 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/204 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/206 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 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) 70/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 128/200 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/204 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/206 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 280 ms.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 97/97 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2025-06-06 06:32:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:32:51] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-06 06:32:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 06:32:51] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-06 06:32:51] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:32:51] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2025-06-06 06:32:51] [INFO ] Invariant cache hit.
[2025-06-06 06:32:51] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/206 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:32:55] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/206 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 141 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7185 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/206 variables, 97/100 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 108/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 249 constraints, problems are : Problem set: 0 solved, 108 unsolved in 17809 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25035ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 25036ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25284 ms. Remains : 97/97 places, 109/109 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 97 transition count 102
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 91 transition count 102
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 13 place count 91 transition count 86
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 45 place count 75 transition count 86
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 53 place count 71 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 55 place count 70 transition count 90
Applied a total of 55 rules in 11 ms. Remains 70 /97 variables (removed 27) and now considering 90/109 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 90 rows 70 cols
[2025-06-06 06:33:16] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-06 06:33:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 06:33:17] [INFO ] After 67ms 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 06:33:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 06:33:17] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-06 06:33:17] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-06 06:33:17] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 166 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 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 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22460 reset in 124 ms.
Product exploration explored 100000 steps with 22432 reset in 125 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 111/111 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 06:33:18] [INFO ] Redundant transitions in 0 ms returned []
Running 110 sub problems to find dead transitions.
// Phase 1: matrix 111 rows 98 cols
[2025-06-06 06:33:18] [INFO ] Computed 3 invariants in 2 ms
[2025-06-06 06:33:18] [INFO ] State equation strengthened by 43 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, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/209 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 43/144 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:33:20] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 145 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5621 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 111/209 variables, 98/102 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 43/145 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 110/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:33:37] [INFO ] Deduced a trap along path composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/209 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 06:33:43] [INFO ] Deduced a trap along path composed of 23 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/209 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 209/209 variables, and 257 constraints, problems are : Problem set: 0 solved, 110 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 35668ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 35670ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35681 ms. Remains : 98/98 places, 111/111 transitions.
Built C files in :
/tmp/ltsmin10819422320324390421
[2025-06-06 06:33:53] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10819422320324390421
Running compilation step : cd /tmp/ltsmin10819422320324390421;'/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 204 ms.
Running link step : cd /tmp/ltsmin10819422320324390421;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10819422320324390421;'/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/stateBased9169163558661676838.hoa' '--buchi-type=spotba'
LTSmin run took 198 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-15 finished in 193503 ms.
All properties solved by simple procedures.
Total runtime 1039075 ms.

BK_STOP 1749191634450

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

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