Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 3.8K 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-d2m06-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749176983713

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-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 02:29:44] [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 02:29:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 02:29:45] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2025-06-06 02:29:45] [INFO ] Transformed 2398 places.
[2025-06-06 02:29:45] [INFO ] Transformed 1954 transitions.
[2025-06-06 02:29:45] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 266 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 2 formulas.
Deduced a syphon composed of 1984 places in 29 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 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 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 951 place count 291 transition count 682
Iterating global reduction 1 with 98 rules applied. Total rules applied 1049 place count 291 transition count 682
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1058 place count 291 transition count 673
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 1130 place count 219 transition count 601
Iterating global reduction 2 with 72 rules applied. Total rules applied 1202 place count 219 transition count 601
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 1240 place count 219 transition count 563
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1265 place count 194 transition count 533
Iterating global reduction 3 with 25 rules applied. Total rules applied 1290 place count 194 transition count 533
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 3 with 81 rules applied. Total rules applied 1371 place count 194 transition count 452
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1376 place count 189 transition count 443
Iterating global reduction 4 with 5 rules applied. Total rules applied 1381 place count 189 transition count 443
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1386 place count 184 transition count 438
Iterating global reduction 4 with 5 rules applied. Total rules applied 1391 place count 184 transition count 438
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1393 place count 182 transition count 436
Iterating global reduction 4 with 2 rules applied. Total rules applied 1395 place count 182 transition count 436
Applied a total of 1395 rules in 91 ms. Remains 182 /414 variables (removed 232) and now considering 436/1954 (removed 1518) transitions.
// Phase 1: matrix 436 rows 182 cols
[2025-06-06 02:29:45] [INFO ] Computed 5 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:29:45] [INFO ] Implicit Places using invariants in 265 ms returned []
[2025-06-06 02:29:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:29:45] [INFO ] State equation strengthened by 298 read => feed constraints.
[2025-06-06 02:29:47] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 1835 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2025-06-06 02:29:47] [INFO ] Invariant cache hit.
[2025-06-06 02:29:47] [INFO ] State equation strengthened by 298 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:51] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:51] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:51] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:57] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:57] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:57] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:58] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:58] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:29:58] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 7 (OVERLAPS) 436/618 variables, 182/196 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/618 variables, 298/494 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:10] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:11] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:14] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:15] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 4 ms to minimize.
Problem TDEAD406 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:15] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 24 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD70 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/618 variables, 5/499 constraints. Problems are: Problem set: 3 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/618 variables, and 499 constraints, problems are : Problem set: 3 solved, 432 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 182/182 constraints, ReadFeed: 298/298 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 432 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 432 unsolved
At refinement iteration 3 (OVERLAPS) 4/182 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 432 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 11/19 constraints. Problems are: Problem set: 3 solved, 432 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:21] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 1/20 constraints. Problems are: Problem set: 3 solved, 432 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 432 unsolved
At refinement iteration 8 (OVERLAPS) 436/618 variables, 182/202 constraints. Problems are: Problem set: 3 solved, 432 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/618 variables, 298/500 constraints. Problems are: Problem set: 3 solved, 432 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/618 variables, 432/932 constraints. Problems are: Problem set: 3 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/618 variables, and 932 constraints, problems are : Problem set: 3 solved, 432 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 182/182 constraints, ReadFeed: 298/298 constraints, PredecessorRefiner: 432/435 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60560ms problems are : Problem set: 3 solved, 432 unsolved
Search for dead transitions found 3 dead transitions in 60576ms
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 : 182/414 places, 433/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 179 transition count 433
Applied a total of 3 rules in 5 ms. Remains 179 /182 variables (removed 3) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 179 cols
[2025-06-06 02:30:47] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:30:48] [INFO ] Implicit Places using invariants in 341 ms returned []
[2025-06-06 02:30:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:30:48] [INFO ] State equation strengthened by 297 read => feed constraints.
[2025-06-06 02:30:52] [INFO ] Implicit Places using invariants and state equation in 4510 ms returned []
Implicit Place search using SMT with State Equation took 4854 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 179/414 places, 433/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67398 ms. Remains : 179/414 places, 433/1954 transitions.
Support contains 31 out of 179 places after structural reductions.
[2025-06-06 02:30:52] [INFO ] Flatten gal took : 71 ms
[2025-06-06 02:30:52] [INFO ] Flatten gal took : 30 ms
[2025-06-06 02:30:53] [INFO ] Input system was already deterministic with 433 transitions.
Reduction of identical properties reduced properties to check from 32 to 30
RANDOM walk for 40000 steps (8961 resets) in 2573 ms. (15 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4001 steps (193 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (188 resets) in 80 ms. (49 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (171 resets) in 46 ms. (85 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (165 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (189 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (180 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (181 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (176 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (181 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (191 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (426 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (201 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (197 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (199 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (179 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (192 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (185 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (186 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (202 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (181 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (185 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (203 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (186 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (169 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (160 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (195 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (193 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (180 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (174 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 448949 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :25 out of 29
Probabilistic random walk after 448949 steps, saw 176944 distinct states, run finished after 3005 ms. (steps per millisecond=149 ) properties seen :25
[2025-06-06 02:30:57] [INFO ] Invariant cache hit.
[2025-06-06 02:30:57] [INFO ] State equation strengthened by 297 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 86/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 42/135 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 245/380 variables, 135/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 109/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 8 (OVERLAPS) 232/612 variables, 44/292 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/612 variables, 188/480 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/612 variables, 0/480 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/612 variables, 0/480 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 612/612 variables, and 480 constraints, problems are : Problem set: 2 solved, 2 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 297/297 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 86/89 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 42/131 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 193/324 variables, 131/135 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 57/192 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/192 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 288/612 variables, 48/240 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/612 variables, 240/480 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/612 variables, 2/482 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:58] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:30:58] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/612 variables, 2/484 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/612 variables, 0/484 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/612 variables, 0/484 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 612/612 variables, and 484 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1345 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 297/297 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1852ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 223 ms.
Support contains 3 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 433/433 transitions.
Graph (complete) has 711 edges and 179 vertex of which 178 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 178 transition count 431
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 156 transition count 203
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 156 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 156 transition count 200
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 70 place count 136 transition count 179
Iterating global reduction 2 with 20 rules applied. Total rules applied 90 place count 136 transition count 179
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 99 place count 136 transition count 170
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 111 place count 124 transition count 149
Iterating global reduction 3 with 12 rules applied. Total rules applied 123 place count 124 transition count 149
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 131 place count 124 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 136 place count 119 transition count 135
Iterating global reduction 4 with 5 rules applied. Total rules applied 141 place count 119 transition count 135
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 146 place count 114 transition count 130
Iterating global reduction 4 with 5 rules applied. Total rules applied 151 place count 114 transition count 130
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 155 place count 110 transition count 126
Iterating global reduction 4 with 4 rules applied. Total rules applied 159 place count 110 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 161 place count 110 transition count 124
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 164 place count 107 transition count 121
Iterating global reduction 5 with 3 rules applied. Total rules applied 167 place count 107 transition count 121
Applied a total of 167 rules in 37 ms. Remains 107 /179 variables (removed 72) and now considering 121/433 (removed 312) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 107/179 places, 121/433 transitions.
RANDOM walk for 40000 steps (8935 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1907 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1899 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Probably explored full state space saw : 75554 states, properties seen :0
Probabilistic random walk after 183050 steps, saw 75554 distinct states, run finished after 557 ms. (steps per millisecond=328 ) properties seen :0
Explored full state space saw : 75554 states, properties seen :0
Exhaustive walk after 183050 steps, saw 75554 distinct states, run finished after 544 ms. (steps per millisecond=336 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 45 stabilizing places and 75 stable transitions
Graph (complete) has 777 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(p1)||((p1 U X(X(!p3)))&&p2))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 433/433 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 158 transition count 240
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 158 transition count 240
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 158 transition count 237
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 64 place count 139 transition count 217
Iterating global reduction 1 with 19 rules applied. Total rules applied 83 place count 139 transition count 217
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 89 place count 139 transition count 211
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 100 place count 128 transition count 194
Iterating global reduction 2 with 11 rules applied. Total rules applied 111 place count 128 transition count 194
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 118 place count 128 transition count 187
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 122 place count 124 transition count 182
Iterating global reduction 3 with 4 rules applied. Total rules applied 126 place count 124 transition count 182
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 130 place count 120 transition count 178
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 120 transition count 178
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 118 transition count 176
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 118 transition count 176
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 116 transition count 172
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 116 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 115 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 115 transition count 171
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 114 transition count 170
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 114 transition count 170
Applied a total of 146 rules in 15 ms. Remains 114 /179 variables (removed 65) and now considering 170/433 (removed 263) transitions.
// Phase 1: matrix 170 rows 114 cols
[2025-06-06 02:31:00] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:31:00] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 02:31:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:31:01] [INFO ] State equation strengthened by 89 read => feed constraints.
[2025-06-06 02:31:01] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2025-06-06 02:31:01] [INFO ] Invariant cache hit.
[2025-06-06 02:31:01] [INFO ] State equation strengthened by 89 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:03] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD152 is UNSAT
At refinement iteration 6 (OVERLAPS) 170/284 variables, 114/119 constraints. Problems are: Problem set: 3 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 89/208 constraints. Problems are: Problem set: 3 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/208 constraints. Problems are: Problem set: 3 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 0/284 variables, 0/208 constraints. Problems are: Problem set: 3 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 208 constraints, problems are : Problem set: 3 solved, 166 unsolved in 11165 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 166 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 2/113 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 166 unsolved
At refinement iteration 8 (OVERLAPS) 170/283 variables, 113/118 constraints. Problems are: Problem set: 3 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 89/207 constraints. Problems are: Problem set: 3 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 19/226 constraints. Problems are: Problem set: 3 solved, 166 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:18] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 1/227 constraints. Problems are: Problem set: 3 solved, 166 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 0/227 constraints. Problems are: Problem set: 3 solved, 166 unsolved
SMT process timed out in 41249ms, After SMT, problems are : Problem set: 3 solved, 166 unsolved
Search for dead transitions found 3 dead transitions in 41251ms
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 : 114/179 places, 167/433 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 167
Applied a total of 3 rules in 2 ms. Remains 111 /114 variables (removed 3) and now considering 167/167 (removed 0) transitions.
// Phase 1: matrix 167 rows 111 cols
[2025-06-06 02:31:42] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:31:42] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-06 02:31:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:31:42] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-06-06 02:31:43] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/179 places, 167/433 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42163 ms. Remains : 111/179 places, 167/433 transitions.
Stuttering acceptance computed with spot in 429 ms :[(AND (NOT p1) p3), (AND (NOT p1) p3), (AND (NOT p1) p3), (AND (NOT p1) p3), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (AND (NOT p1) p3), (AND (NOT p1) p3)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-00
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-00 finished in 42657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((!p0 U p1) U p0) U X((!p2||(!p3 U (G(!p3)||(!p3&&G(!p2))))))))'
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 433/433 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 158 transition count 228
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 158 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 158 transition count 226
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 63 place count 139 transition count 207
Iterating global reduction 1 with 19 rules applied. Total rules applied 82 place count 139 transition count 207
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 90 place count 139 transition count 199
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 102 place count 127 transition count 179
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 127 transition count 179
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 127 transition count 170
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 128 place count 122 transition count 164
Iterating global reduction 3 with 5 rules applied. Total rules applied 133 place count 122 transition count 164
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 138 place count 117 transition count 159
Iterating global reduction 3 with 5 rules applied. Total rules applied 143 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 115 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 115 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 150 place count 115 transition count 154
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 113 transition count 152
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 113 transition count 152
Applied a total of 154 rules in 15 ms. Remains 113 /179 variables (removed 66) and now considering 152/433 (removed 281) transitions.
// Phase 1: matrix 152 rows 113 cols
[2025-06-06 02:31:43] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:31:43] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 02:31:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:31:43] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-06-06 02:31:43] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2025-06-06 02:31:43] [INFO ] Invariant cache hit.
[2025-06-06 02:31:43] [INFO ] State equation strengthened by 73 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:45] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:45] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD137 is UNSAT
At refinement iteration 7 (OVERLAPS) 152/265 variables, 113/119 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 73/192 constraints. Problems are: Problem set: 3 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:48] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:49] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:49] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 3/195 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/195 constraints. Problems are: Problem set: 3 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:31:53] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/265 variables, 1/196 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 196 constraints, problems are : Problem set: 3 solved, 148 unsolved in 18921 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 1/110 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 2/112 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 152/264 variables, 112/120 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 73/193 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 19/212 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 13 (OVERLAPS) 1/265 variables, 1/213 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 129/342 constraints. Problems are: Problem set: 3 solved, 148 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 2/344 constraints. Problems are: Problem set: 3 solved, 148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/265 variables, and 344 constraints, problems are : Problem set: 3 solved, 148 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 148/151 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48992ms problems are : Problem set: 3 solved, 148 unsolved
Search for dead transitions found 3 dead transitions in 48993ms
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 : 113/179 places, 149/433 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 110 transition count 149
Applied a total of 3 rules in 4 ms. Remains 110 /113 variables (removed 3) and now considering 149/149 (removed 0) transitions.
// Phase 1: matrix 149 rows 110 cols
[2025-06-06 02:32:32] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:32:33] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 02:32:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:32:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-06 02:32:33] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 110/179 places, 149/433 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49937 ms. Remains : 110/179 places, 149/433 transitions.
Stuttering acceptance computed with spot in 586 ms :[(AND p2 p3), (AND p3 p2 p0 (NOT p1)), (AND (NOT p0) p2 p3), (AND p2 p3), true, (AND p0 (NOT p1)), p3, (AND p0 (NOT p1) p3), (AND p3 p2), (NOT p0), (AND (NOT p0) p3), (AND p3 p2 p0 (NOT p1)), p2, (AND (NOT p0) p2 p3), (AND p2 p0 (NOT p1)), (AND (NOT p0) p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 374 ms.
Product exploration explored 100000 steps with 50000 reset in 271 ms.
Computed a total of 26 stabilizing places and 36 stable transitions
Graph (complete) has 370 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 26 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 38 factoid took 29 ms. Reduced automaton from 16 states, 53 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-01 finished in 51241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U !p1)&&X(X(G(p2)))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 433/433 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 158 transition count 228
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 158 transition count 228
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 158 transition count 225
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 64 place count 139 transition count 205
Iterating global reduction 1 with 19 rules applied. Total rules applied 83 place count 139 transition count 205
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 90 place count 139 transition count 198
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 101 place count 128 transition count 180
Iterating global reduction 2 with 11 rules applied. Total rules applied 112 place count 128 transition count 180
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 120 place count 128 transition count 172
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 125 place count 123 transition count 167
Iterating global reduction 3 with 5 rules applied. Total rules applied 130 place count 123 transition count 167
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 135 place count 118 transition count 162
Iterating global reduction 3 with 5 rules applied. Total rules applied 140 place count 118 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 142 place count 116 transition count 160
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 116 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 147 place count 116 transition count 157
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 149 place count 114 transition count 153
Iterating global reduction 4 with 2 rules applied. Total rules applied 151 place count 114 transition count 153
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 152 place count 113 transition count 152
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 113 transition count 152
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 154 place count 112 transition count 151
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 112 transition count 151
Applied a total of 155 rules in 10 ms. Remains 112 /179 variables (removed 67) and now considering 151/433 (removed 282) transitions.
// Phase 1: matrix 151 rows 112 cols
[2025-06-06 02:32:34] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:32:34] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-06 02:32:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:32:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-06 02:32:35] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2025-06-06 02:32:35] [INFO ] Invariant cache hit.
[2025-06-06 02:32:35] [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/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:32:36] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 6 (OVERLAPS) 151/263 variables, 112/117 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 72/189 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 02:32:40] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 1/190 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/190 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/263 variables, 0/190 constraints. Problems are: Problem set: 3 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 190 constraints, problems are : Problem set: 3 solved, 147 unsolved in 12092 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 2/2 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/108 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 2/111 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 9 (OVERLAPS) 151/262 variables, 111/117 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 72/189 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 19/208 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 0/208 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 13 (OVERLAPS) 1/263 variables, 1/209 constraints. Problems are: Problem set: 3 solved, 147 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 128/337 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 02:33:10] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:11] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:12] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 3/340 constraints. Problems are: Problem set: 3 solved, 147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 340 constraints, problems are : Problem set: 3 solved, 147 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 147/150 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42165ms problems are : Problem set: 3 solved, 147 unsolved
Search for dead transitions found 3 dead transitions in 42165ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 112/179 places, 148/433 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 109 transition count 148
Applied a total of 3 rules in 2 ms. Remains 109 /112 variables (removed 3) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 109 cols
[2025-06-06 02:33:17] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:33:17] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 02:33:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:33:17] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-06 02:33:17] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 109/179 places, 148/433 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42971 ms. Remains : 109/179 places, 148/433 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) p1), true, (NOT p0), p1, (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-02 finished in 43167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 433/433 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 156 transition count 214
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 156 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 156 transition count 211
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 70 place count 135 transition count 189
Iterating global reduction 1 with 21 rules applied. Total rules applied 91 place count 135 transition count 189
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 99 place count 135 transition count 181
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 112 place count 122 transition count 160
Iterating global reduction 2 with 13 rules applied. Total rules applied 125 place count 122 transition count 160
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 134 place count 122 transition count 151
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 140 place count 116 transition count 144
Iterating global reduction 3 with 6 rules applied. Total rules applied 146 place count 116 transition count 144
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 152 place count 110 transition count 138
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 110 transition count 138
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 161 place count 107 transition count 135
Iterating global reduction 3 with 3 rules applied. Total rules applied 164 place count 107 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 166 place count 107 transition count 133
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 169 place count 104 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 172 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 173 place count 103 transition count 127
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 103 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 175 place count 102 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 176 place count 102 transition count 126
Applied a total of 176 rules in 31 ms. Remains 102 /179 variables (removed 77) and now considering 126/433 (removed 307) transitions.
// Phase 1: matrix 126 rows 102 cols
[2025-06-06 02:33:17] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:33:17] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 02:33:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:33:18] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 02:33:18] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:33:18] [INFO ] Redundant transitions in 2 ms returned []
Running 125 sub problems to find dead transitions.
[2025-06-06 02:33:18] [INFO ] Invariant cache hit.
[2025-06-06 02:33:18] [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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:19] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 6 (OVERLAPS) 126/228 variables, 102/107 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 56/163 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/228 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 163 constraints, problems are : Problem set: 3 solved, 122 unsolved in 6996 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: 1/1 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, 1/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 2/101 variables, 1/5 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 02:33:26] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 126/227 variables, 101/107 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 56/163 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 17/180 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 13 (OVERLAPS) 1/228 variables, 1/181 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 105/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: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37046ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 37046ms
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/179 places, 123/433 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 11 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 02:33:55] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:33:55] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 02:33:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:33:55] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 02:33:55] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/179 places, 123/433 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37975 ms. Remains : 99/179 places, 123/433 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-03
Product exploration explored 100000 steps with 22390 reset in 172 ms.
Product exploration explored 100000 steps with 22551 reset in 189 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8950 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1855 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3036 steps, run visited all 1 properties in 9 ms. (steps per millisecond=337 )
Probabilistic random walk after 3036 steps, saw 1527 distinct states, run finished after 12 ms. (steps per millisecond=253 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 12 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2025-06-06 02:33:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:33:56] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-06 02:33:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:33:56] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 02:33:57] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:33:57] [INFO ] Redundant transitions in 3 ms returned []
Running 122 sub problems to find dead transitions.
[2025-06-06 02:33:57] [INFO ] Invariant cache hit.
[2025-06-06 02:33:57] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:33:58] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/222 variables, 99/104 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:34:00] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 160 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8082 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 1/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 123/222 variables, 99/105 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 55/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 122/282 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/222 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 282 constraints, problems are : Problem set: 0 solved, 122 unsolved in 26004 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34139ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 34140ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34564 ms. Remains : 99/99 places, 123/123 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8972 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1894 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3036 steps, run visited all 1 properties in 8 ms. (steps per millisecond=379 )
Probabilistic random walk after 3036 steps, saw 1527 distinct states, run finished after 8 ms. (steps per millisecond=379 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22453 reset in 137 ms.
Product exploration explored 100000 steps with 22390 reset in 147 ms.
Built C files in :
/tmp/ltsmin15371080487680639207
[2025-06-06 02:34:31] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2025-06-06 02:34:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 02:34:31] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2025-06-06 02:34:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 02:34:31] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2025-06-06 02:34:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 02:34:32] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15371080487680639207
Running compilation step : cd /tmp/ltsmin15371080487680639207;'/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 363 ms.
Running link step : cd /tmp/ltsmin15371080487680639207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin15371080487680639207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7412260259051206935.hoa' '--buchi-type=spotba'
LTSmin run took 648 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-03 finished in 75187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 433/433 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 156 transition count 214
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 156 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 156 transition count 211
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 70 place count 135 transition count 189
Iterating global reduction 1 with 21 rules applied. Total rules applied 91 place count 135 transition count 189
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 99 place count 135 transition count 181
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 112 place count 122 transition count 160
Iterating global reduction 2 with 13 rules applied. Total rules applied 125 place count 122 transition count 160
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 134 place count 122 transition count 151
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 140 place count 116 transition count 144
Iterating global reduction 3 with 6 rules applied. Total rules applied 146 place count 116 transition count 144
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 152 place count 110 transition count 138
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 110 transition count 138
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 161 place count 107 transition count 135
Iterating global reduction 3 with 3 rules applied. Total rules applied 164 place count 107 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 166 place count 107 transition count 133
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 169 place count 104 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 172 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 173 place count 103 transition count 127
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 103 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 175 place count 102 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 176 place count 102 transition count 126
Applied a total of 176 rules in 28 ms. Remains 102 /179 variables (removed 77) and now considering 126/433 (removed 307) transitions.
// Phase 1: matrix 126 rows 102 cols
[2025-06-06 02:34:33] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:34:33] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-06 02:34:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:34:33] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-06 02:34:33] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:34:33] [INFO ] Redundant transitions in 6 ms returned []
Running 125 sub problems to find dead transitions.
[2025-06-06 02:34:33] [INFO ] Invariant cache hit.
[2025-06-06 02:34:33] [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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:34:34] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 6 (OVERLAPS) 126/228 variables, 102/107 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 56/163 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/228 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 163 constraints, problems are : Problem set: 3 solved, 122 unsolved in 7599 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: 1/1 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, 1/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 2/101 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 126/227 variables, 101/106 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 17/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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 228/228 variables, and 285 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: 0/0 constraints]
After SMT, in 37647ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 37648ms
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/179 places, 123/433 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.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 99 /102 variables (removed 3) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2025-06-06 02:35:11] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:35:11] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 02:35:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:35:11] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 02:35:11] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/179 places, 123/433 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38426 ms. Remains : 99/179 places, 123/433 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-05
Product exploration explored 100000 steps with 22417 reset in 128 ms.
Product exploration explored 100000 steps with 22482 reset in 136 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8940 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1905 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14183 steps, run visited all 1 properties in 27 ms. (steps per millisecond=525 )
Probabilistic random walk after 14183 steps, saw 6934 distinct states, run finished after 27 ms. (steps per millisecond=525 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2025-06-06 02:35:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:35:12] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-06 02:35:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:35:12] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 02:35:12] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:35:12] [INFO ] Redundant transitions in 3 ms returned []
Running 122 sub problems to find dead transitions.
[2025-06-06 02:35:12] [INFO ] Invariant cache hit.
[2025-06-06 02:35:12] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:13] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/222 variables, 99/104 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:15] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 160 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7449 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 1/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 123/222 variables, 99/105 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 55/160 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 122/282 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 222/222 variables, and 282 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37494ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 37495ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37809 ms. Remains : 99/99 places, 123/123 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8925 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1894 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14183 steps, run visited all 1 properties in 24 ms. (steps per millisecond=590 )
Probabilistic random walk after 14183 steps, saw 6934 distinct states, run finished after 24 ms. (steps per millisecond=590 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22384 reset in 146 ms.
Product exploration explored 100000 steps with 22410 reset in 135 ms.
Built C files in :
/tmp/ltsmin10701436490551048180
[2025-06-06 02:35:50] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2025-06-06 02:35:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 02:35:50] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2025-06-06 02:35:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 02:35:50] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2025-06-06 02:35:50] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 02:35:50] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10701436490551048180
Running compilation step : cd /tmp/ltsmin10701436490551048180;'/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 255 ms.
Running link step : cd /tmp/ltsmin10701436490551048180;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10701436490551048180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6428928907103134960.hoa' '--buchi-type=spotba'
LTSmin run took 3067 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-05 finished in 81201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((F(p0)&&(p0||X(p1))))) U (!p2&&F(p0))))'
Support contains 5 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 433/433 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 157 transition count 215
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 157 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 157 transition count 213
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 66 place count 137 transition count 192
Iterating global reduction 1 with 20 rules applied. Total rules applied 86 place count 137 transition count 192
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 137 transition count 185
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 105 place count 125 transition count 166
Iterating global reduction 2 with 12 rules applied. Total rules applied 117 place count 125 transition count 166
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 125 place count 125 transition count 158
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 130 place count 120 transition count 152
Iterating global reduction 3 with 5 rules applied. Total rules applied 135 place count 120 transition count 152
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 140 place count 115 transition count 147
Iterating global reduction 3 with 5 rules applied. Total rules applied 145 place count 115 transition count 147
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 147 place count 113 transition count 145
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 113 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 151 place count 111 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 111 transition count 141
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 110 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 110 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 109 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 109 transition count 139
Applied a total of 157 rules in 11 ms. Remains 109 /179 variables (removed 70) and now considering 139/433 (removed 294) transitions.
// Phase 1: matrix 139 rows 109 cols
[2025-06-06 02:35:54] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:35:54] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-06 02:35:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:35:54] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-06-06 02:35:54] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2025-06-06 02:35:54] [INFO ] Invariant cache hit.
[2025-06-06 02:35:54] [INFO ] State equation strengthened by 63 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, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:56] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 6 (OVERLAPS) 139/248 variables, 109/114 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 63/177 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 02:35:59] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:35:59] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 2/179 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 179 constraints, problems are : Problem set: 3 solved, 135 unsolved in 10492 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 3/3 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/105 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 1/106 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 2/108 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 139/247 variables, 108/115 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 63/178 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 18/196 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 13 (OVERLAPS) 1/248 variables, 1/197 constraints. Problems are: Problem set: 3 solved, 135 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 117/314 constraints. Problems are: Problem set: 3 solved, 135 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 248/248 variables, and 314 constraints, problems are : Problem set: 3 solved, 135 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 135/138 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40564ms problems are : Problem set: 3 solved, 135 unsolved
Search for dead transitions found 3 dead transitions in 40565ms
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/179 places, 136/433 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 136
Applied a total of 3 rules in 2 ms. Remains 106 /109 variables (removed 3) and now considering 136/136 (removed 0) transitions.
// Phase 1: matrix 136 rows 106 cols
[2025-06-06 02:36:35] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:36:35] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 02:36:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:36:35] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-06-06 02:36:35] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/179 places, 136/433 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41511 ms. Remains : 106/179 places, 136/433 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) p2), (NOT p0), (NOT p0), (NOT p1), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-06
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-06 finished in 41684 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 3 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 433/433 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 157 transition count 227
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 157 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 157 transition count 224
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 137 transition count 203
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 137 transition count 203
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 95 place count 137 transition count 195
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 107 place count 125 transition count 176
Iterating global reduction 2 with 12 rules applied. Total rules applied 119 place count 125 transition count 176
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 127 place count 125 transition count 168
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 132 place count 120 transition count 162
Iterating global reduction 3 with 5 rules applied. Total rules applied 137 place count 120 transition count 162
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 142 place count 115 transition count 157
Iterating global reduction 3 with 5 rules applied. Total rules applied 147 place count 115 transition count 157
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 150 place count 112 transition count 154
Iterating global reduction 3 with 3 rules applied. Total rules applied 153 place count 112 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 156 place count 112 transition count 151
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 159 place count 109 transition count 146
Iterating global reduction 4 with 3 rules applied. Total rules applied 162 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 163 place count 108 transition count 145
Iterating global reduction 4 with 1 rules applied. Total rules applied 164 place count 108 transition count 145
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 165 place count 107 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 166 place count 107 transition count 144
Applied a total of 166 rules in 15 ms. Remains 107 /179 variables (removed 72) and now considering 144/433 (removed 289) transitions.
// Phase 1: matrix 144 rows 107 cols
[2025-06-06 02:36:35] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:36:36] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 02:36:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:36:36] [INFO ] State equation strengthened by 70 read => feed constraints.
[2025-06-06 02:36:36] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2025-06-06 02:36:36] [INFO ] Invariant cache hit.
[2025-06-06 02:36:36] [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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:36:37] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 6 (OVERLAPS) 144/251 variables, 107/112 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 70/182 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 02:36:40] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:36:40] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 2/184 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/184 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/184 constraints. Problems are: Problem set: 3 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 184 constraints, problems are : Problem set: 3 solved, 140 unsolved in 10061 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: 3/3 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, 2/4 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 1/104 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/6 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 02:36:47] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 2/106 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 144/250 variables, 106/114 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 70/184 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 18/202 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 02:36:54] [INFO ] Deduced a trap along path composed of 20 places in 23 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 1/203 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/203 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 15 (OVERLAPS) 1/251 variables, 1/204 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 122/326 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 326 constraints, problems are : Problem set: 3 solved, 140 unsolved in 30014 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: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40127ms problems are : Problem set: 3 solved, 140 unsolved
Search for dead transitions found 3 dead transitions in 40128ms
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/179 places, 141/433 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 3 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 02:37:16] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:37:16] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-06 02:37:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:37:16] [INFO ] State equation strengthened by 69 read => feed constraints.
[2025-06-06 02:37:17] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/179 places, 141/433 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41089 ms. Remains : 104/179 places, 141/433 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-07 finished in 41268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1)||(G(p3)&&p2))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 433/433 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 157 transition count 227
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 157 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 157 transition count 224
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 67 place count 137 transition count 203
Iterating global reduction 1 with 20 rules applied. Total rules applied 87 place count 137 transition count 203
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 94 place count 137 transition count 196
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 106 place count 125 transition count 177
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 125 transition count 177
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 126 place count 125 transition count 169
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 131 place count 120 transition count 163
Iterating global reduction 3 with 5 rules applied. Total rules applied 136 place count 120 transition count 163
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 141 place count 115 transition count 158
Iterating global reduction 3 with 5 rules applied. Total rules applied 146 place count 115 transition count 158
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 148 place count 113 transition count 156
Iterating global reduction 3 with 2 rules applied. Total rules applied 150 place count 113 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 111 transition count 152
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 111 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 110 transition count 151
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 110 transition count 151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 109 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 109 transition count 150
Applied a total of 158 rules in 17 ms. Remains 109 /179 variables (removed 70) and now considering 150/433 (removed 283) transitions.
// Phase 1: matrix 150 rows 109 cols
[2025-06-06 02:37:17] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:37:17] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-06 02:37:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:37:17] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-06 02:37:17] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2025-06-06 02:37:17] [INFO ] Invariant cache hit.
[2025-06-06 02:37:17] [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, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:19] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD134 is UNSAT
At refinement iteration 6 (OVERLAPS) 150/259 variables, 109/114 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 74/188 constraints. Problems are: Problem set: 3 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:22] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 1/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/259 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 189 constraints, problems are : Problem set: 3 solved, 146 unsolved in 10571 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: 149/149 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 146 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, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 2/108 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 150/258 variables, 108/114 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 74/188 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 18/206 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/206 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 13 (OVERLAPS) 1/259 variables, 1/207 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 128/335 constraints. Problems are: Problem set: 3 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:37:54] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/259 variables, and 336 constraints, problems are : Problem set: 3 solved, 146 unsolved in 30020 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: 146/149 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40653ms problems are : Problem set: 3 solved, 146 unsolved
Search for dead transitions found 3 dead transitions in 40654ms
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/179 places, 147/433 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 147
Applied a total of 3 rules in 1 ms. Remains 106 /109 variables (removed 3) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 106 cols
[2025-06-06 02:37:58] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:37:58] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-06 02:37:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:37:58] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-06-06 02:37:59] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/179 places, 147/433 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41765 ms. Remains : 106/179 places, 147/433 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0)), true, (NOT p3), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-08
Product exploration explored 100000 steps with 37325 reset in 241 ms.
Product exploration explored 100000 steps with 37392 reset in 246 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 359 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 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3 p0), (X p0), (X p3), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p1))), (X (X p3)), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 122 ms. Reduced automaton from 9 states, 23 edges and 4 AP (stutter sensitive) to 9 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0)), true, (NOT p3), (NOT p1), (AND (NOT p3) (NOT p1))]
Reduction of identical properties reduced properties to check from 20 to 18
RANDOM walk for 40000 steps (9001 resets) in 322 ms. (123 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (180 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (179 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (202 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (190 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (194 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (211 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (195 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (176 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (178 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (187 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (200 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (194 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (183 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (181 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (182 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (164 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (180 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (185 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
Probably explored full state space saw : 119950 states, properties seen :11
Probabilistic random walk after 305448 steps, saw 119950 distinct states, run finished after 1462 ms. (steps per millisecond=208 ) properties seen :11
Explored full state space saw : 119950 states, properties seen :0
Exhaustive walk after 305448 steps, saw 119950 distinct states, run finished after 1154 ms. (steps per millisecond=264 ) properties seen :0
Found 8 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3 p0), (X p0), (X p3), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p1))), (X (X p3)), (X (X (NOT (AND p1 (NOT p3))))), (G (OR p1 (NOT p3) (NOT p2))), (G (OR p0 (NOT p1))), (G (OR p0 (NOT p1) p3)), (G (OR p0 (NOT p3))), (G (OR p0 (NOT p1) (NOT p3))), (G (OR p0 p1 (NOT p3))), (G (OR (NOT p1) (NOT p3) (NOT p2))), (G (OR (NOT p1) p3))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (F (NOT (AND (OR (NOT p1) p3) (OR (NOT p1) p2)))), (F (NOT (OR p0 p3))), (F (NOT (AND (NOT p1) p3))), (F (NOT (OR (NOT p1) (NOT p3)))), (F (NOT (OR p0 p1))), (F p1), (F p2), (F (NOT (OR p0 p1 p3))), (F (NOT p3)), (F (NOT (OR p1 p3))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p3)))
Knowledge based reduction with 26 factoid took 181 ms. Reduced automaton from 9 states, 23 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-08 finished in 46038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0)&&F(p1))) U (!p2 U p3))))'
Support contains 5 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 433/433 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 159 transition count 253
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 159 transition count 253
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 159 transition count 250
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 61 place count 141 transition count 231
Iterating global reduction 1 with 18 rules applied. Total rules applied 79 place count 141 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 85 place count 141 transition count 225
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 96 place count 130 transition count 208
Iterating global reduction 2 with 11 rules applied. Total rules applied 107 place count 130 transition count 208
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 114 place count 130 transition count 201
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 119 place count 125 transition count 195
Iterating global reduction 3 with 5 rules applied. Total rules applied 124 place count 125 transition count 195
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 129 place count 120 transition count 190
Iterating global reduction 3 with 5 rules applied. Total rules applied 134 place count 120 transition count 190
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 118 transition count 188
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 118 transition count 188
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 116 transition count 184
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 116 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 115 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 115 transition count 183
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 114 transition count 182
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 114 transition count 182
Applied a total of 146 rules in 20 ms. Remains 114 /179 variables (removed 65) and now considering 182/433 (removed 251) transitions.
// Phase 1: matrix 182 rows 114 cols
[2025-06-06 02:38:03] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:38:03] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 02:38:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:38:03] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-06 02:38:03] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-06-06 02:38:03] [INFO ] Invariant cache hit.
[2025-06-06 02:38:03] [INFO ] State equation strengthened by 101 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:38:05] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD164 is UNSAT
At refinement iteration 6 (OVERLAPS) 182/296 variables, 114/119 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 101/220 constraints. Problems are: Problem set: 3 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:38:10] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 1/221 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/221 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/296 variables, 0/221 constraints. Problems are: Problem set: 3 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 221 constraints, problems are : Problem set: 3 solved, 178 unsolved in 14468 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 1/111 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 2/113 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 9 (OVERLAPS) 182/295 variables, 113/119 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 101/220 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 20/240 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 0/240 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 13 (OVERLAPS) 1/296 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 178 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/296 variables, 158/399 constraints. Problems are: Problem set: 3 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 296/296 variables, and 399 constraints, problems are : Problem set: 3 solved, 178 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 178/181 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44550ms problems are : Problem set: 3 solved, 178 unsolved
Search for dead transitions found 3 dead transitions in 44553ms
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 : 114/179 places, 179/433 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 179
Applied a total of 3 rules in 1 ms. Remains 111 /114 variables (removed 3) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 111 cols
[2025-06-06 02:38:48] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:38:48] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-06 02:38:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:38:48] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-06 02:38:48] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 111/179 places, 179/433 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45676 ms. Remains : 111/179 places, 179/433 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p3), (NOT p3), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-09 finished in 45882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||X((G(p1) U (!p0&&G(p1))))) U (p1 U G(p2))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 433/433 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 158 transition count 240
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 158 transition count 240
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 158 transition count 237
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 64 place count 139 transition count 217
Iterating global reduction 1 with 19 rules applied. Total rules applied 83 place count 139 transition count 217
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 89 place count 139 transition count 211
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 100 place count 128 transition count 194
Iterating global reduction 2 with 11 rules applied. Total rules applied 111 place count 128 transition count 194
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 118 place count 128 transition count 187
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 123 place count 123 transition count 181
Iterating global reduction 3 with 5 rules applied. Total rules applied 128 place count 123 transition count 181
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 133 place count 118 transition count 176
Iterating global reduction 3 with 5 rules applied. Total rules applied 138 place count 118 transition count 176
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 115 transition count 173
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 115 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 148 place count 115 transition count 169
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 151 place count 112 transition count 164
Iterating global reduction 4 with 3 rules applied. Total rules applied 154 place count 112 transition count 164
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 111 transition count 163
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 111 transition count 163
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 110 transition count 162
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 110 transition count 162
Applied a total of 158 rules in 15 ms. Remains 110 /179 variables (removed 69) and now considering 162/433 (removed 271) transitions.
// Phase 1: matrix 162 rows 110 cols
[2025-06-06 02:38:49] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:38:49] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-06 02:38:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:38:49] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-06-06 02:38:49] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-06 02:38:49] [INFO ] Invariant cache hit.
[2025-06-06 02:38:49] [INFO ] State equation strengthened by 83 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, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 1/110 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:38:51] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD145 is UNSAT
At refinement iteration 6 (OVERLAPS) 162/272 variables, 110/115 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 83/198 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/198 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/198 constraints. Problems are: Problem set: 3 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 198 constraints, problems are : Problem set: 3 solved, 158 unsolved in 9801 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 158 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, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 2/109 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 8 (OVERLAPS) 162/271 variables, 109/114 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 83/197 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 19/216 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/216 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 12 (OVERLAPS) 1/272 variables, 1/217 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 139/356 constraints. Problems are: Problem set: 3 solved, 158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 272/272 variables, and 356 constraints, problems are : Problem set: 3 solved, 158 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 158/161 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39870ms problems are : Problem set: 3 solved, 158 unsolved
Search for dead transitions found 3 dead transitions in 39871ms
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/179 places, 159/433 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 159
Applied a total of 3 rules in 4 ms. Remains 107 /110 variables (removed 3) and now considering 159/159 (removed 0) transitions.
// Phase 1: matrix 159 rows 107 cols
[2025-06-06 02:39:29] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:39:29] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 02:39:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:39:29] [INFO ] State equation strengthened by 82 read => feed constraints.
[2025-06-06 02:39:29] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 107/179 places, 159/433 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40714 ms. Remains : 107/179 places, 159/433 transitions.
Stuttering acceptance computed with spot in 306 ms :[(NOT p2), (OR (NOT p1) p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, (NOT p1), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-10 finished in 41039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((X(p0)||F(!p1))&&(p0||F(G(p2)))))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 433/433 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 158 transition count 229
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 158 transition count 229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 158 transition count 227
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 64 place count 138 transition count 206
Iterating global reduction 1 with 20 rules applied. Total rules applied 84 place count 138 transition count 206
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 138 transition count 199
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 103 place count 126 transition count 180
Iterating global reduction 2 with 12 rules applied. Total rules applied 115 place count 126 transition count 180
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 123 place count 126 transition count 172
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 122 transition count 167
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 122 transition count 167
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 135 place count 118 transition count 163
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 118 transition count 163
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 141 place count 116 transition count 161
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 116 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 114 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 114 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 113 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 113 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 112 transition count 155
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 112 transition count 155
Applied a total of 151 rules in 27 ms. Remains 112 /179 variables (removed 67) and now considering 155/433 (removed 278) transitions.
// Phase 1: matrix 155 rows 112 cols
[2025-06-06 02:39:30] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:39:30] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-06 02:39:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:39:30] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-06 02:39:30] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:39:30] [INFO ] Redundant transitions in 1 ms returned []
Running 154 sub problems to find dead transitions.
[2025-06-06 02:39:30] [INFO ] Invariant cache hit.
[2025-06-06 02:39:30] [INFO ] State equation strengthened by 76 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, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:39:32] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD138 is UNSAT
At refinement iteration 6 (OVERLAPS) 155/267 variables, 112/117 constraints. Problems are: Problem set: 3 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 76/193 constraints. Problems are: Problem set: 3 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/193 constraints. Problems are: Problem set: 3 solved, 151 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/267 variables, 0/193 constraints. Problems are: Problem set: 3 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 193 constraints, problems are : Problem set: 3 solved, 151 unsolved in 9931 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 151 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, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 2/111 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:39:41] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:39:42] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 151 unsolved
At refinement iteration 9 (OVERLAPS) 155/266 variables, 111/118 constraints. Problems are: Problem set: 3 solved, 151 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 76/194 constraints. Problems are: Problem set: 3 solved, 151 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 18/212 constraints. Problems are: Problem set: 3 solved, 151 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 151 unsolved
At refinement iteration 13 (OVERLAPS) 1/267 variables, 1/213 constraints. Problems are: Problem set: 3 solved, 151 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 133/346 constraints. Problems are: Problem set: 3 solved, 151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 346 constraints, problems are : Problem set: 3 solved, 151 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 151/154 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40006ms problems are : Problem set: 3 solved, 151 unsolved
Search for dead transitions found 3 dead transitions in 40007ms
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 : 112/179 places, 152/433 transitions.
Graph (complete) has 372 edges and 112 vertex of which 109 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 7 ms. Remains 109 /112 variables (removed 3) and now considering 152/152 (removed 0) transitions.
// Phase 1: matrix 152 rows 109 cols
[2025-06-06 02:40:10] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:40:10] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-06 02:40:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:40:11] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-06 02:40:11] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/179 places, 152/433 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40978 ms. Remains : 109/179 places, 152/433 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-11 finished in 41238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 433/433 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 155 transition count 201
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 155 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 51 place count 155 transition count 198
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 73 place count 133 transition count 175
Iterating global reduction 1 with 22 rules applied. Total rules applied 95 place count 133 transition count 175
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 104 place count 133 transition count 166
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 117 place count 120 transition count 145
Iterating global reduction 2 with 13 rules applied. Total rules applied 130 place count 120 transition count 145
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 139 place count 120 transition count 136
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 145 place count 114 transition count 129
Iterating global reduction 3 with 6 rules applied. Total rules applied 151 place count 114 transition count 129
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 157 place count 108 transition count 123
Iterating global reduction 3 with 6 rules applied. Total rules applied 163 place count 108 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 105 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 105 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 105 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 173 place count 102 transition count 114
Iterating global reduction 4 with 3 rules applied. Total rules applied 176 place count 102 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 177 place count 101 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 101 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 179 place count 100 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 180 place count 100 transition count 112
Applied a total of 180 rules in 19 ms. Remains 100 /179 variables (removed 79) and now considering 112/433 (removed 321) transitions.
// Phase 1: matrix 112 rows 100 cols
[2025-06-06 02:40:11] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:40:11] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-06 02:40:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:40:11] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-06 02:40:11] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:40:11] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2025-06-06 02:40:11] [INFO ] Invariant cache hit.
[2025-06-06 02:40:11] [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, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:40:12] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 6 (OVERLAPS) 112/212 variables, 100/105 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 44/149 constraints. Problems are: Problem set: 3 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:40:14] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:40:14] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 2/151 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 151 constraints, problems are : Problem set: 3 solved, 108 unsolved in 8674 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: 111/111 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 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: 3 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 1/97 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 2/99 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 112/211 variables, 99/105 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 44/149 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 16/165 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 0/165 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 13 (OVERLAPS) 1/212 variables, 1/166 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 92/258 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/212 variables, 1/259 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/212 variables, 0/259 constraints. Problems are: Problem set: 3 solved, 108 unsolved
At refinement iteration 17 (OVERLAPS) 0/212 variables, 0/259 constraints. Problems are: Problem set: 3 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 259 constraints, problems are : Problem set: 3 solved, 108 unsolved in 30013 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: 108/111 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38721ms problems are : Problem set: 3 solved, 108 unsolved
Search for dead transitions found 3 dead transitions in 38722ms
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 : 100/179 places, 109/433 transitions.
Graph (complete) has 308 edges and 100 vertex of which 97 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 97 /100 variables (removed 3) and now considering 109/109 (removed 0) transitions.
// Phase 1: matrix 109 rows 97 cols
[2025-06-06 02:40:50] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:40:50] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-06 02:40:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:40:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 02:40:50] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/179 places, 109/433 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39249 ms. Remains : 97/179 places, 109/433 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-13
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-13 finished in 39298 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) U X((p1&&X(F(p2)))))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 433/433 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 158 transition count 229
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 158 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 45 place count 158 transition count 226
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 64 place count 139 transition count 206
Iterating global reduction 1 with 19 rules applied. Total rules applied 83 place count 139 transition count 206
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 92 place count 139 transition count 197
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 103 place count 128 transition count 179
Iterating global reduction 2 with 11 rules applied. Total rules applied 114 place count 128 transition count 179
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 121 place count 128 transition count 172
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 125 place count 124 transition count 167
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 124 transition count 167
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 133 place count 120 transition count 163
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 120 transition count 163
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 118 transition count 161
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 118 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 117 transition count 160
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 117 transition count 160
Applied a total of 143 rules in 14 ms. Remains 117 /179 variables (removed 62) and now considering 160/433 (removed 273) transitions.
// Phase 1: matrix 160 rows 117 cols
[2025-06-06 02:40:50] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:40:50] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 02:40:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:40:50] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-06-06 02:40:51] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2025-06-06 02:40:51] [INFO ] Invariant cache hit.
[2025-06-06 02:40:51] [INFO ] State equation strengthened by 79 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:40:53] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD144 is UNSAT
At refinement iteration 6 (OVERLAPS) 160/277 variables, 117/122 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 79/201 constraints. Problems are: Problem set: 3 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:40:55] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:40:56] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 2/203 constraints. Problems are: Problem set: 3 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:40:59] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 1/204 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:41:04] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/277 variables, 1/205 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/205 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 13 (OVERLAPS) 0/277 variables, 0/205 constraints. Problems are: Problem set: 3 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 205 constraints, problems are : Problem set: 3 solved, 156 unsolved in 27018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 1/114 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 2/116 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 160/276 variables, 116/123 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 79/202 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 19/221 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 0/221 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 14 (OVERLAPS) 1/277 variables, 1/222 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/277 variables, 137/359 constraints. Problems are: Problem set: 3 solved, 156 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/277 variables, 2/361 constraints. Problems are: Problem set: 3 solved, 156 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/277 variables, and 361 constraints, problems are : Problem set: 3 solved, 156 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 156/159 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57099ms problems are : Problem set: 3 solved, 156 unsolved
Search for dead transitions found 3 dead transitions in 57099ms
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 : 117/179 places, 157/433 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 114 transition count 157
Applied a total of 3 rules in 2 ms. Remains 114 /117 variables (removed 3) and now considering 157/157 (removed 0) transitions.
// Phase 1: matrix 157 rows 114 cols
[2025-06-06 02:41:48] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:41:48] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 02:41:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:41:48] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-06-06 02:41:48] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 114/179 places, 157/433 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58073 ms. Remains : 114/179 places, 157/433 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m06-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m06-LTLFireability-15 finished in 58324 ms.
All properties solved by simple procedures.
Total runtime 724198 ms.

BK_STOP 1749177709076

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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-d2m06"
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-d2m06, 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-174901994400460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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