Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K 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.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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 450K 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-d1m04-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749156437057

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-d1m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 20:47:18] [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-05 20:47:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 20:47:18] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2025-06-05 20:47:18] [INFO ] Transformed 1295 places.
[2025-06-05 20:47:18] [INFO ] Transformed 749 transitions.
[2025-06-05 20:47:18] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1036 places in 9 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 300 place count 199 transition count 401
Iterating global reduction 1 with 43 rules applied. Total rules applied 343 place count 199 transition count 401
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 348 place count 199 transition count 396
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 377 place count 170 transition count 367
Iterating global reduction 2 with 29 rules applied. Total rules applied 406 place count 170 transition count 367
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 416 place count 170 transition count 357
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 431 place count 155 transition count 341
Iterating global reduction 3 with 15 rules applied. Total rules applied 446 place count 155 transition count 341
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 489 place count 155 transition count 298
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 492 place count 152 transition count 294
Iterating global reduction 4 with 3 rules applied. Total rules applied 495 place count 152 transition count 294
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 498 place count 149 transition count 291
Iterating global reduction 4 with 3 rules applied. Total rules applied 501 place count 149 transition count 291
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 502 place count 148 transition count 289
Iterating global reduction 4 with 1 rules applied. Total rules applied 503 place count 148 transition count 289
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 504 place count 147 transition count 288
Iterating global reduction 4 with 1 rules applied. Total rules applied 505 place count 147 transition count 288
Applied a total of 505 rules in 88 ms. Remains 147 /259 variables (removed 112) and now considering 288/749 (removed 461) transitions.
// Phase 1: matrix 288 rows 147 cols
[2025-06-05 20:47:18] [INFO ] Computed 5 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:47:19] [INFO ] Implicit Places using invariants in 285 ms returned []
[2025-06-05 20:47:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:47:19] [INFO ] State equation strengthened by 188 read => feed constraints.
[2025-06-05 20:47:20] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2025-06-05 20:47:20] [INFO ] Invariant cache hit.
[2025-06-05 20:47:20] [INFO ] State equation strengthened by 188 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:22] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:22] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:22] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:22] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 1/147 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:26] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:26] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:26] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:26] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Problem TDEAD243 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 7 (OVERLAPS) 288/435 variables, 147/160 constraints. Problems are: Problem set: 2 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 188/348 constraints. Problems are: Problem set: 2 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:35] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:42] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 9 ms to minimize.
Problem TDEAD242 is UNSAT
Problem TDEAD251 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:42] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 6 ms to minimize.
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:43] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:43] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 5 ms to minimize.
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 5/353 constraints. Problems are: Problem set: 23 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 435/435 variables, and 353 constraints, problems are : Problem set: 23 solved, 264 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 147/147 constraints, ReadFeed: 188/188 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 23 solved, 264 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 1/1 constraints. Problems are: Problem set: 23 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/1 constraints. Problems are: Problem set: 23 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 4/124 variables, 2/3 constraints. Problems are: Problem set: 23 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/4 constraints. Problems are: Problem set: 23 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 23 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 19/143 variables, 2/6 constraints. Problems are: Problem set: 23 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 8/14 constraints. Problems are: Problem set: 23 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/14 constraints. Problems are: Problem set: 23 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 287/430 variables, 143/157 constraints. Problems are: Problem set: 23 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 187/344 constraints. Problems are: Problem set: 23 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 15/359 constraints. Problems are: Problem set: 23 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:56] [INFO ] Deduced a trap along path composed of 17 places in 40 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 1/360 constraints. Problems are: Problem set: 23 solved, 264 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/360 constraints. Problems are: Problem set: 23 solved, 264 unsolved
SMT process timed out in 60384ms, After SMT, problems are : Problem set: 23 solved, 264 unsolved
Search for dead transitions found 23 dead transitions in 60398ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in LTL mode, iteration 1 : 147/259 places, 265/749 transitions.
Reduce places removed 31 places and 139 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 116 transition count 116
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 53 place count 104 transition count 104
Reduce places removed 7 places and 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 60 place count 97 transition count 97
Reduce places removed 4 places and 9 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 64 place count 93 transition count 88
Reduce places removed 7 places and 9 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 71 place count 86 transition count 79
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 73 place count 84 transition count 77
Deduced a syphon composed of 17 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 84 transition count 77
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 76 place count 83 transition count 76
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 77 place count 83 transition count 76
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 77 rules in 7 ms. Remains 83 /147 variables (removed 64) and now considering 76/265 (removed 189) transitions.
// Phase 1: matrix 76 rows 83 cols
[2025-06-05 20:48:20] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:20] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-05 20:48:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-05 20:48:20] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 83/259 places, 76/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62271 ms. Remains : 83/259 places, 76/749 transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Support contains 9 out of 66 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 20:48:21] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2025-06-05 20:48:21] [INFO ] Flatten gal took : 23 ms
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 20:48:21] [INFO ] Flatten gal took : 8 ms
[2025-06-05 20:48:21] [INFO ] Input system was already deterministic with 76 transitions.
RANDOM walk for 40000 steps (8969 resets) in 1378 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1811 resets) in 174 ms. (228 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1869 resets) in 140 ms. (283 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (1932 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (4075 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1872 resets) in 107 ms. (370 steps per ms) remains 4/5 properties
// Phase 1: matrix 76 rows 66 cols
[2025-06-05 20:48:21] [INFO ] Computed 4 invariants in 1 ms
[2025-06-05 20:48:21] [INFO ] State equation strengthened by 37 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) 52/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/63 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 76/139 variables, 63/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 37/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/142 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/142 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 107 constraints, problems are : Problem set: 0 solved, 4 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 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) 52/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/63 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 76/139 variables, 63/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 37/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/142 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/142 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/142 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 111 constraints, problems are : Problem set: 0 solved, 4 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 931ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 162 ms.
Support contains 7 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 76/76 transitions.
Graph (complete) has 179 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 63 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 63 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 7 place count 63 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 62 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 62 transition count 71
Applied a total of 9 rules in 13 ms. Remains 62 /66 variables (removed 4) and now considering 71/76 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 62/66 places, 71/76 transitions.
RANDOM walk for 40000 steps (8895 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1894 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1908 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4045 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1932 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 1996 steps, run visited all 4 properties in 26 ms. (steps per millisecond=76 )
Probabilistic random walk after 1996 steps, saw 826 distinct states, run finished after 30 ms. (steps per millisecond=66 ) properties seen :4
Computed a total of 66 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 76
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 76/76 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 76
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 60 transition count 69
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 60 transition count 69
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 60 transition count 66
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 56 transition count 62
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 56 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 56 transition count 60
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 27 place count 53 transition count 56
Iterating global reduction 3 with 3 rules applied. Total rules applied 30 place count 53 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 53 transition count 55
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 33 place count 51 transition count 53
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 51 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 37 place count 51 transition count 51
Applied a total of 37 rules in 5 ms. Remains 51 /66 variables (removed 15) and now considering 51/76 (removed 25) transitions.
// Phase 1: matrix 51 rows 51 cols
[2025-06-05 20:48:23] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:23] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-05 20:48:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-05 20:48:23] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2025-06-05 20:48:23] [INFO ] Invariant cache hit.
[2025-06-05 20:48:23] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Problem TDEAD48 is UNSAT
At refinement iteration 4 (OVERLAPS) 51/102 variables, 51/54 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 20/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 74 constraints, problems are : Problem set: 1 solved, 49 unsolved in 1458 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 51/101 variables, 50/53 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 20/73 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 12/85 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 1/102 variables, 1/86 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 37/123 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/102 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 123 constraints, problems are : Problem set: 1 solved, 49 unsolved in 3586 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 49/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5065ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 5065ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 51/66 places, 50/76 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 50 transition count 50
Applied a total of 1 rules in 2 ms. Remains 50 /51 variables (removed 1) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2025-06-05 20:48:28] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:28] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-05 20:48:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-05 20:48:28] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/66 places, 50/76 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5340 ms. Remains : 50/66 places, 50/76 transitions.
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m04-LTLFireability-01
Product exploration explored 100000 steps with 22359 reset in 235 ms.
Product exploration explored 100000 steps with 22374 reset in 139 ms.
Computed a total of 50 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8956 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1893 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1017 steps, run visited all 1 properties in 5 ms. (steps per millisecond=203 )
Probabilistic random walk after 1017 steps, saw 454 distinct states, run finished after 5 ms. (steps per millisecond=203 ) properties seen :1
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2025-06-05 20:48:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:29] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-05 20:48:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-05 20:48:29] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 49 sub problems to find dead transitions.
[2025-06-05 20:48:29] [INFO ] Invariant cache hit.
[2025-06-05 20:48:29] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 50/100 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 73 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1500 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 50/100 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 49/122 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 122 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2899 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4417ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 4418ms
Finished structural reductions in LTL mode , in 1 iterations and 4541 ms. Remains : 50/50 places, 50/50 transitions.
Computed a total of 50 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8915 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1883 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1017 steps, run visited all 1 properties in 5 ms. (steps per millisecond=203 )
Probabilistic random walk after 1017 steps, saw 454 distinct states, run finished after 5 ms. (steps per millisecond=203 ) properties seen :1
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22312 reset in 85 ms.
Product exploration explored 100000 steps with 22427 reset in 99 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 8 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:48:35] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2025-06-05 20:48:35] [INFO ] Invariant cache hit.
[2025-06-05 20:48:35] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 50/100 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 73 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1413 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 50/100 variables, 50/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 49/122 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 122 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2835 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4262ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 4262ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4275 ms. Remains : 50/50 places, 50/50 transitions.
Built C files in :
/tmp/ltsmin12735814841301258540
[2025-06-05 20:48:40] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12735814841301258540
Running compilation step : cd /tmp/ltsmin12735814841301258540;'/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 231 ms.
Running link step : cd /tmp/ltsmin12735814841301258540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin12735814841301258540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17886609252217547337.hoa' '--buchi-type=spotba'
LTSmin run took 139 ms.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m04-LTLFireability-01 finished in 17311 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 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 76/76 transitions.
Graph (complete) has 205 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 59 transition count 68
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 59 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 17 place count 59 transition count 64
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 55 transition count 60
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 55 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 55 transition count 58
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 52 transition count 54
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 52 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 52 transition count 53
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 50 transition count 51
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 50 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 40 place count 50 transition count 49
Applied a total of 40 rules in 15 ms. Remains 50 /66 variables (removed 16) and now considering 49/76 (removed 27) transitions.
// Phase 1: matrix 49 rows 50 cols
[2025-06-05 20:48:40] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:40] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-05 20:48:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:40] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-05 20:48:40] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:48:40] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-05 20:48:40] [INFO ] Invariant cache hit.
[2025-06-05 20:48:40] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem TDEAD46 is UNSAT
At refinement iteration 4 (OVERLAPS) 49/99 variables, 50/53 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 18/71 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/99 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 71 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1387 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 49/98 variables, 49/52 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 18/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 12/82 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 1/99 variables, 1/83 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 35/118 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/99 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 118 constraints, problems are : Problem set: 1 solved, 47 unsolved in 3539 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4938ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 4940ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 50/66 places, 48/76 transitions.
Graph (complete) has 145 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 49 /50 variables (removed 1) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 49 cols
[2025-06-05 20:48:45] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:45] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-05 20:48:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-05 20:48:45] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/66 places, 48/76 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5186 ms. Remains : 49/66 places, 48/76 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m04-LTLFireability-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m04-LTLFireability-03 finished in 5231 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 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 76/76 transitions.
Graph (complete) has 205 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 58 transition count 65
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 58 transition count 65
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 19 place count 58 transition count 61
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 53 transition count 56
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 53 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 53 transition count 55
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 50 transition count 52
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 50 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 50 transition count 50
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 49 transition count 49
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 49 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 49 transition count 47
Applied a total of 42 rules in 12 ms. Remains 49 /66 variables (removed 17) and now considering 47/76 (removed 29) transitions.
// Phase 1: matrix 47 rows 49 cols
[2025-06-05 20:48:45] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:45] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-05 20:48:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:45] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-05 20:48:45] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:48:45] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2025-06-05 20:48:45] [INFO ] Invariant cache hit.
[2025-06-05 20:48:45] [INFO ] State equation strengthened by 17 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 47/96 variables, 49/52 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 17/69 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/96 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 69 constraints, problems are : Problem set: 1 solved, 45 unsolved in 1249 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 45 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 47/95 variables, 48/51 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 17/68 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 12/80 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 1/96 variables, 1/81 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 33/114 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/96 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 11 (OVERLAPS) 0/96 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 114 constraints, problems are : Problem set: 1 solved, 45 unsolved in 3268 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 45/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4530ms problems are : Problem set: 1 solved, 45 unsolved
Search for dead transitions found 1 dead transitions in 4531ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 49/66 places, 46/76 transitions.
Graph (complete) has 141 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 48 /49 variables (removed 1) and now considering 46/46 (removed 0) transitions.
// Phase 1: matrix 46 rows 48 cols
[2025-06-05 20:48:50] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:50] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-05 20:48:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:50] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-05 20:48:50] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/66 places, 46/76 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4782 ms. Remains : 48/66 places, 46/76 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m04-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m04-LTLFireability-04 finished in 4831 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))))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 76/76 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 76
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 59 transition count 66
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 59 transition count 66
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 59 transition count 62
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 21 place count 55 transition count 58
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 55 transition count 58
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 52 transition count 55
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 52 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 52 transition count 53
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 51 transition count 52
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 51 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 51 transition count 50
Applied a total of 37 rules in 12 ms. Remains 51 /66 variables (removed 15) and now considering 50/76 (removed 26) transitions.
// Phase 1: matrix 50 rows 51 cols
[2025-06-05 20:48:50] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:50] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-05 20:48:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:50] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-05 20:48:50] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 49 sub problems to find dead transitions.
[2025-06-05 20:48:50] [INFO ] Invariant cache hit.
[2025-06-05 20:48:50] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Problem TDEAD47 is UNSAT
At refinement iteration 4 (OVERLAPS) 50/101 variables, 51/54 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 18/72 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 72 constraints, problems are : Problem set: 1 solved, 48 unsolved in 1388 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 50/100 variables, 50/53 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 18/71 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 13/84 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/101 variables, 1/85 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 35/120 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/101 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 120 constraints, problems are : Problem set: 1 solved, 48 unsolved in 3352 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 48/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4752ms problems are : Problem set: 1 solved, 48 unsolved
Search for dead transitions found 1 dead transitions in 4753ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 51/66 places, 49/76 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 50 transition count 49
Applied a total of 1 rules in 3 ms. Remains 50 /51 variables (removed 1) and now considering 49/49 (removed 0) transitions.
// Phase 1: matrix 49 rows 50 cols
[2025-06-05 20:48:55] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-05 20:48:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:55] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-05 20:48:55] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/66 places, 49/76 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5028 ms. Remains : 50/66 places, 49/76 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m04-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 115 ms.
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Computed a total of 50 stabilizing places and 49 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 49
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m04-LTLFireability-07 finished in 5454 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 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 76/76 transitions.
Graph (complete) has 205 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 59 transition count 66
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 59 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 16 place count 59 transition count 63
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 55 transition count 59
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 55 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 55 transition count 58
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 52 transition count 54
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 52 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 52 transition count 52
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 51 transition count 51
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 51 transition count 51
Applied a total of 35 rules in 13 ms. Remains 51 /66 variables (removed 15) and now considering 51/76 (removed 25) transitions.
// Phase 1: matrix 51 rows 51 cols
[2025-06-05 20:48:55] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-05 20:48:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:48:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-05 20:48:56] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:48:56] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2025-06-05 20:48:56] [INFO ] Invariant cache hit.
[2025-06-05 20:48:56] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Problem TDEAD48 is UNSAT
At refinement iteration 4 (OVERLAPS) 51/102 variables, 51/54 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 20/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 74 constraints, problems are : Problem set: 1 solved, 49 unsolved in 1426 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 51/101 variables, 50/53 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 20/73 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 11/84 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 1/102 variables, 1/85 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 38/123 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/102 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 123 constraints, problems are : Problem set: 1 solved, 49 unsolved in 5085 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 49/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6523ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 6524ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 51/66 places, 50/76 transitions.
Graph (complete) has 148 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 50 /51 variables (removed 1) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2025-06-05 20:49:02] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:49:02] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-05 20:49:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:49:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-05 20:49:02] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/66 places, 50/76 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6781 ms. Remains : 50/66 places, 50/76 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m04-LTLFireability-08
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m04-LTLFireability-08 finished in 6829 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 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 76/76 transitions.
Graph (complete) has 205 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 59 transition count 66
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 59 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 16 place count 59 transition count 63
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 55 transition count 59
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 55 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 55 transition count 58
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 29 place count 51 transition count 53
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 51 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 51 transition count 51
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 49 transition count 49
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 49 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 49 transition count 48
Applied a total of 40 rules in 14 ms. Remains 49 /66 variables (removed 17) and now considering 48/76 (removed 28) transitions.
// Phase 1: matrix 48 rows 49 cols
[2025-06-05 20:49:02] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:49:02] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-05 20:49:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:49:02] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-05 20:49:02] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:49:02] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2025-06-05 20:49:02] [INFO ] Invariant cache hit.
[2025-06-05 20:49:02] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem TDEAD45 is UNSAT
At refinement iteration 4 (OVERLAPS) 48/97 variables, 49/52 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 19/71 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/97 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 71 constraints, problems are : Problem set: 1 solved, 46 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/48 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 48/96 variables, 48/51 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 19/70 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 11/81 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/81 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 1/97 variables, 1/82 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 35/117 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/97 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 117 constraints, problems are : Problem set: 1 solved, 46 unsolved in 3683 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 46/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4908ms problems are : Problem set: 1 solved, 46 unsolved
Search for dead transitions found 1 dead transitions in 4909ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 49/66 places, 47/76 transitions.
Graph (complete) has 141 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 48 /49 variables (removed 1) and now considering 47/47 (removed 0) transitions.
// Phase 1: matrix 47 rows 48 cols
[2025-06-05 20:49:07] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:49:07] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-05 20:49:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 20:49:07] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-05 20:49:07] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/66 places, 47/76 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5156 ms. Remains : 48/66 places, 47/76 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m04-LTLFireability-10
Product exploration explored 100000 steps with 22387 reset in 96 ms.
Product exploration explored 100000 steps with 22351 reset in 93 ms.
Computed a total of 48 stabilizing places and 47 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 47
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m04-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m04-LTLFireability-10 finished in 5429 ms.
All properties solved by simple procedures.
Total runtime 110022 ms.

BK_STOP 1749156548607

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

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

Sequence of Actions to be Executed by the VM

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

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

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