Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K 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 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.8M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749076544096

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 22:35:45] [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-04 22:35:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 22:35:46] [INFO ] Load time of PNML (sax parser for PT used): 586 ms
[2025-06-04 22:35:46] [INFO ] Transformed 6690 places.
[2025-06-04 22:35:46] [INFO ] Transformed 11934 transitions.
[2025-06-04 22:35:46] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 792 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4305 places in 28 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1080 places :
Symmetric choice reduction at 1 with 1080 rule applications. Total rules 1199 place count 1288 transition count 8435
Iterating global reduction 1 with 1080 rules applied. Total rules applied 2279 place count 1288 transition count 8435
Ensure Unique test removed 338 transitions
Reduce isomorphic transitions removed 338 transitions.
Iterating post reduction 1 with 338 rules applied. Total rules applied 2617 place count 1288 transition count 8097
Discarding 884 places :
Symmetric choice reduction at 2 with 884 rule applications. Total rules 3501 place count 404 transition count 7213
Iterating global reduction 2 with 884 rules applied. Total rules applied 4385 place count 404 transition count 7213
Ensure Unique test removed 5589 transitions
Reduce isomorphic transitions removed 5589 transitions.
Iterating post reduction 2 with 5589 rules applied. Total rules applied 9974 place count 404 transition count 1624
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 10023 place count 355 transition count 1575
Iterating global reduction 3 with 49 rules applied. Total rules applied 10072 place count 355 transition count 1575
Ensure Unique test removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Iterating post reduction 3 with 131 rules applied. Total rules applied 10203 place count 355 transition count 1444
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 10211 place count 347 transition count 1436
Iterating global reduction 4 with 8 rules applied. Total rules applied 10219 place count 347 transition count 1436
Applied a total of 10219 rules in 380 ms. Remains 347 /2385 variables (removed 2038) and now considering 1436/11934 (removed 10498) transitions.
// Phase 1: matrix 1436 rows 347 cols
[2025-06-04 22:35:46] [INFO ] Computed 3 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:35:47] [INFO ] Implicit Places using invariants in 459 ms returned []
[2025-06-04 22:35:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:35:47] [INFO ] State equation strengthened by 1124 read => feed constraints.
[2025-06-04 22:35:52] [INFO ] Implicit Places using invariants and state equation in 5333 ms returned []
Implicit Place search using SMT with State Equation took 5839 ms to find 0 implicit places.
Running 1435 sub problems to find dead transitions.
[2025-06-04 22:35:52] [INFO ] Invariant cache hit.
[2025-06-04 22:35:52] [INFO ] State equation strengthened by 1124 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
At refinement iteration 2 (OVERLAPS) 1/347 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 35.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 347/1783 variables, and 3 constraints, problems are : Problem set: 0 solved, 1435 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/347 constraints, ReadFeed: 0/1124 constraints, PredecessorRefiner: 1435/1435 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1435 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/346 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
At refinement iteration 2 (OVERLAPS) 1/347 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1435 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 347/1783 variables, and 3 constraints, problems are : Problem set: 0 solved, 1435 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/347 constraints, ReadFeed: 0/1124 constraints, PredecessorRefiner: 0/1435 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63205ms problems are : Problem set: 0 solved, 1435 unsolved
Search for dead transitions found 0 dead transitions in 63233ms
Starting structural reductions in LTL mode, iteration 1 : 347/2385 places, 1436/11934 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69485 ms. Remains : 347/2385 places, 1436/11934 transitions.
Support contains 35 out of 347 places after structural reductions.
[2025-06-04 22:36:56] [INFO ] Flatten gal took : 116 ms
[2025-06-04 22:36:56] [INFO ] Flatten gal took : 77 ms
[2025-06-04 22:36:56] [INFO ] Input system was already deterministic with 1436 transitions.
RANDOM walk for 40000 steps (6390 resets) in 2327 ms. (17 steps per ms) remains 3/32 properties
BEST_FIRST walk for 40003 steps (764 resets) in 192 ms. (207 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (930 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (731 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
[2025-06-04 22:36:57] [INFO ] Invariant cache hit.
[2025-06-04 22:36:57] [INFO ] State equation strengthened by 1124 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 106/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 47/160 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:36:57] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 508/668 variables, 160/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/668 variables, 196/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp24 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1115/1783 variables, 187/547 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1783 variables, 928/1475 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1783 variables, 0/1475 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1783 variables, 0/1475 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1783/1783 variables, and 1475 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1378 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 347/347 constraints, ReadFeed: 1124/1124 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/109 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/156 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:36:58] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:36:59] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 344/500 variables, 156/162 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 32/194 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 1/195 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 0/195 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1279/1779 variables, 187/382 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1779 variables, 1092/1474 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1779 variables, 0/1474 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/1783 variables, 4/1478 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:37:00] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 23 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1783 variables, 1/1479 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1783 variables, 0/1479 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1783 variables, 0/1479 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1783/1783 variables, and 1479 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1685 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 347/347 constraints, ReadFeed: 1124/1124 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3152ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 2 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 1436/1436 transitions.
Graph (complete) has 2060 edges and 347 vertex of which 346 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 346 transition count 1427
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 40 place count 316 transition count 517
Iterating global reduction 1 with 30 rules applied. Total rules applied 70 place count 316 transition count 517
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 316 transition count 513
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 123 place count 267 transition count 464
Iterating global reduction 2 with 49 rules applied. Total rules applied 172 place count 267 transition count 464
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 203 place count 267 transition count 433
Discarding 88 places :
Symmetric choice reduction at 3 with 88 rule applications. Total rules 291 place count 179 transition count 345
Iterating global reduction 3 with 88 rules applied. Total rules applied 379 place count 179 transition count 345
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 459 place count 179 transition count 265
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 462 place count 176 transition count 226
Iterating global reduction 4 with 3 rules applied. Total rules applied 465 place count 176 transition count 226
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 467 place count 174 transition count 224
Iterating global reduction 4 with 2 rules applied. Total rules applied 469 place count 174 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 470 place count 174 transition count 223
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 474 place count 170 transition count 219
Iterating global reduction 5 with 4 rules applied. Total rules applied 478 place count 170 transition count 219
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 482 place count 170 transition count 215
Applied a total of 482 rules in 75 ms. Remains 170 /347 variables (removed 177) and now considering 215/1436 (removed 1221) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 170/347 places, 215/1436 transitions.
RANDOM walk for 40000 steps (8463 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2856 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 608 steps, run visited all 1 properties in 11 ms. (steps per millisecond=55 )
Probabilistic random walk after 608 steps, saw 313 distinct states, run finished after 14 ms. (steps per millisecond=43 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 89 stabilizing places and 634 stable transitions
Graph (complete) has 2143 edges and 347 vertex of which 346 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((!p0||F(p1)))&&F(!p0)) U (G(((X((!p0||F(p1)))&&F(!p0))||X(G((!p0||F(p1))))))||(!p2&&((X((!p0||F(p1)))&&F(!p0))||X(G((!p0||F(p1)))))))))'
Support contains 5 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1436/1436 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 321 transition count 650
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 321 transition count 650
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 321 transition count 647
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 101 place count 275 transition count 601
Iterating global reduction 1 with 46 rules applied. Total rules applied 147 place count 275 transition count 601
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 202 place count 275 transition count 546
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 278 place count 199 transition count 470
Iterating global reduction 2 with 76 rules applied. Total rules applied 354 place count 199 transition count 470
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 2 with 112 rules applied. Total rules applied 466 place count 199 transition count 358
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 467 place count 198 transition count 345
Iterating global reduction 3 with 1 rules applied. Total rules applied 468 place count 198 transition count 345
Applied a total of 468 rules in 19 ms. Remains 198 /347 variables (removed 149) and now considering 345/1436 (removed 1091) transitions.
// Phase 1: matrix 345 rows 198 cols
[2025-06-04 22:37:01] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:37:01] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-04 22:37:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:37:01] [INFO ] State equation strengthened by 160 read => feed constraints.
[2025-06-04 22:37:05] [INFO ] Implicit Places using invariants and state equation in 3837 ms returned []
Implicit Place search using SMT with State Equation took 3973 ms to find 0 implicit places.
Running 344 sub problems to find dead transitions.
[2025-06-04 22:37:05] [INFO ] Invariant cache hit.
[2025-06-04 22:37:05] [INFO ] State equation strengthened by 160 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (OVERLAPS) 1/198 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
At refinement iteration 4 (OVERLAPS) 345/543 variables, 198/201 constraints. Problems are: Problem set: 24 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 160/361 constraints. Problems are: Problem set: 24 solved, 320 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 0/361 constraints. Problems are: Problem set: 24 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/543 variables, and 361 constraints, problems are : Problem set: 24 solved, 320 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 17/190 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 8/198 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 345/543 variables, 198/201 constraints. Problems are: Problem set: 24 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 160/361 constraints. Problems are: Problem set: 24 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 320/681 constraints. Problems are: Problem set: 24 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 681 constraints, problems are : Problem set: 24 solved, 320 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 198/198 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 320/344 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60277ms problems are : Problem set: 24 solved, 320 unsolved
Search for dead transitions found 24 dead transitions in 60280ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 198/347 places, 321/1436 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 174 transition count 309
Applied a total of 36 rules in 3 ms. Remains 174 /198 variables (removed 24) and now considering 309/321 (removed 12) transitions.
// Phase 1: matrix 309 rows 174 cols
[2025-06-04 22:38:05] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:38:05] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-04 22:38:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:38:05] [INFO ] State equation strengthened by 156 read => feed constraints.
[2025-06-04 22:38:08] [INFO ] Implicit Places using invariants and state equation in 2660 ms returned []
Implicit Place search using SMT with State Equation took 2772 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 174/347 places, 309/1436 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67052 ms. Remains : 174/347 places, 309/1436 transitions.
Stuttering acceptance computed with spot in 352 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 540 ms.
Product exploration explored 100000 steps with 50000 reset in 423 ms.
Computed a total of 13 stabilizing places and 68 stable transitions
Graph (complete) has 675 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 68 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-01 finished in 68712 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(!p0))||F(!p1)) U (G((X(X(!p0))||F(!p1)))||(!p2&&(X(X(!p0))||F(!p1))&&X(F((!p2 U (p3||G(!p2)))))))))'
Support contains 5 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1436/1436 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 321 transition count 650
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 321 transition count 650
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 321 transition count 647
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 101 place count 275 transition count 601
Iterating global reduction 1 with 46 rules applied. Total rules applied 147 place count 275 transition count 601
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 202 place count 275 transition count 546
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 278 place count 199 transition count 470
Iterating global reduction 2 with 76 rules applied. Total rules applied 354 place count 199 transition count 470
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 2 with 120 rules applied. Total rules applied 474 place count 199 transition count 350
Applied a total of 474 rules in 21 ms. Remains 199 /347 variables (removed 148) and now considering 350/1436 (removed 1086) transitions.
// Phase 1: matrix 350 rows 199 cols
[2025-06-04 22:38:09] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:38:10] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-04 22:38:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:38:10] [INFO ] State equation strengthened by 166 read => feed constraints.
[2025-06-04 22:38:11] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2025-06-04 22:38:11] [INFO ] Invariant cache hit.
[2025-06-04 22:38:11] [INFO ] State equation strengthened by 166 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 1/199 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 349 unsolved
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
At refinement iteration 4 (OVERLAPS) 350/549 variables, 199/202 constraints. Problems are: Problem set: 24 solved, 325 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/549 variables, 166/368 constraints. Problems are: Problem set: 24 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/368 constraints. Problems are: Problem set: 24 solved, 325 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 549/549 variables, and 368 constraints, problems are : Problem set: 24 solved, 325 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 199/199 constraints, ReadFeed: 166/166 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 325 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 325 unsolved
At refinement iteration 1 (OVERLAPS) 17/191 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 325 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 325 unsolved
At refinement iteration 3 (OVERLAPS) 8/199 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 325 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 325 unsolved
At refinement iteration 5 (OVERLAPS) 350/549 variables, 199/202 constraints. Problems are: Problem set: 24 solved, 325 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 166/368 constraints. Problems are: Problem set: 24 solved, 325 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 325/693 constraints. Problems are: Problem set: 24 solved, 325 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 549/549 variables, and 693 constraints, problems are : Problem set: 24 solved, 325 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 199/199 constraints, ReadFeed: 166/166 constraints, PredecessorRefiner: 325/349 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60315ms problems are : Problem set: 24 solved, 325 unsolved
Search for dead transitions found 24 dead transitions in 60317ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 199/347 places, 326/1436 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 175 transition count 314
Applied a total of 36 rules in 3 ms. Remains 175 /199 variables (removed 24) and now considering 314/326 (removed 12) transitions.
// Phase 1: matrix 314 rows 175 cols
[2025-06-04 22:39:11] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:39:11] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-04 22:39:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:39:11] [INFO ] State equation strengthened by 162 read => feed constraints.
[2025-06-04 22:39:14] [INFO ] Implicit Places using invariants and state equation in 2762 ms returned []
Implicit Place search using SMT with State Equation took 2859 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 175/347 places, 314/1436 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64716 ms. Remains : 175/347 places, 314/1436 transitions.
Stuttering acceptance computed with spot in 370 ms :[(AND p0 p1), (AND (NOT p3) p1 p0 p2), (AND p1 p0), (AND p1 (NOT p3) p0 p2), (AND p1 p0), (AND p1 (NOT p3) p0 p2), p1, (AND p2 p1 (NOT p3))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 423 ms.
Product exploration explored 100000 steps with 50000 reset in 424 ms.
Computed a total of 19 stabilizing places and 96 stable transitions
Graph (complete) has 680 edges and 175 vertex of which 174 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 19 stabilizing places and 96 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p3 (NOT p0)), (X (NOT p2)), (X p3), (X (NOT (AND p1 (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p0)))), (X (X p3)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 17 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-02 finished in 65985 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&X(p1)&&((F(!p1) U p2) U p3)))))'
Support contains 6 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1436/1436 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 320 transition count 609
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 320 transition count 609
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 320 transition count 606
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 104 place count 273 transition count 559
Iterating global reduction 1 with 47 rules applied. Total rules applied 151 place count 273 transition count 559
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 198 place count 273 transition count 512
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 278 place count 193 transition count 432
Iterating global reduction 2 with 80 rules applied. Total rules applied 358 place count 193 transition count 432
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 2 with 112 rules applied. Total rules applied 470 place count 193 transition count 320
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 472 place count 191 transition count 294
Iterating global reduction 3 with 2 rules applied. Total rules applied 474 place count 191 transition count 294
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 475 place count 190 transition count 293
Iterating global reduction 3 with 1 rules applied. Total rules applied 476 place count 190 transition count 293
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 480 place count 186 transition count 289
Iterating global reduction 3 with 4 rules applied. Total rules applied 484 place count 186 transition count 289
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 500 place count 186 transition count 273
Applied a total of 500 rules in 26 ms. Remains 186 /347 variables (removed 161) and now considering 273/1436 (removed 1163) transitions.
// Phase 1: matrix 273 rows 186 cols
[2025-06-04 22:39:15] [INFO ] Computed 3 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:39:16] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-04 22:39:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:39:16] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-04 22:39:17] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 1559 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2025-06-04 22:39:17] [INFO ] Invariant cache hit.
[2025-06-04 22:39:17] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 4 (OVERLAPS) 273/459 variables, 186/189 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 98/287 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/287 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/459 variables, 0/287 constraints. Problems are: Problem set: 24 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 287 constraints, problems are : Problem set: 24 solved, 248 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 17/178 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 8/186 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 273/459 variables, 186/189 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 98/287 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 248/535 constraints. Problems are: Problem set: 24 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:40:09] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:40:10] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 9 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/459 variables, and 537 constraints, problems are : Problem set: 36 solved, 236 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 248/272 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 36 solved, 236 unsolved
Search for dead transitions found 36 dead transitions in 60201ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 186/347 places, 237/1436 transitions.
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 154 transition count 225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 150 transition count 221
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 150 transition count 221
Applied a total of 52 rules in 6 ms. Remains 150 /186 variables (removed 36) and now considering 221/237 (removed 16) transitions.
// Phase 1: matrix 221 rows 150 cols
[2025-06-04 22:40:17] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:40:17] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-04 22:40:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:40:17] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-06-04 22:40:18] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/347 places, 221/1436 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62558 ms. Remains : 150/347 places, 221/1436 transitions.
Stuttering acceptance computed with spot in 613 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p3) (NOT p1)), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) p1) (AND p1 (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1), (AND p1 (NOT p3))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-03 finished in 63206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 5 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1436/1436 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 319 transition count 528
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 319 transition count 528
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 319 transition count 524
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 84 place count 295 transition count 500
Iterating global reduction 1 with 24 rules applied. Total rules applied 108 place count 295 transition count 500
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 110 place count 295 transition count 498
Discarding 110 places :
Symmetric choice reduction at 2 with 110 rule applications. Total rules 220 place count 185 transition count 388
Iterating global reduction 2 with 110 rules applied. Total rules applied 330 place count 185 transition count 388
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 430 place count 185 transition count 288
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 431 place count 184 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 432 place count 184 transition count 273
Applied a total of 432 rules in 66 ms. Remains 184 /347 variables (removed 163) and now considering 273/1436 (removed 1163) transitions.
// Phase 1: matrix 273 rows 184 cols
[2025-06-04 22:40:19] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:40:19] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-04 22:40:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:40:19] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-04 22:40:20] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 1781 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:40:20] [INFO ] Redundant transitions in 17 ms returned []
Running 272 sub problems to find dead transitions.
[2025-06-04 22:40:20] [INFO ] Invariant cache hit.
[2025-06-04 22:40:20] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/184 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 5 (OVERLAPS) 273/457 variables, 184/187 constraints. Problems are: Problem set: 24 solved, 248 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 100/287 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 0/287 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 0/457 variables, 0/287 constraints. Problems are: Problem set: 24 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 287 constraints, problems are : Problem set: 24 solved, 248 unsolved in 24434 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 184/184 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 24/184 variables, 2/3 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 273/457 variables, 184/187 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 100/287 constraints. Problems are: Problem set: 24 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 248/535 constraints. Problems are: Problem set: 24 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:41:03] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 4 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:41:04] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 4 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:41:04] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 5 ms to minimize.
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:41:11] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 5 ms to minimize.
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:41:13] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:41:13] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 6/541 constraints. Problems are: Problem set: 46 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/457 variables, and 541 constraints, problems are : Problem set: 46 solved, 226 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 184/184 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 248/272 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54650ms problems are : Problem set: 46 solved, 226 unsolved
Search for dead transitions found 46 dead transitions in 54650ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 184/347 places, 227/1436 transitions.
Graph (complete) has 556 edges and 184 vertex of which 142 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.2 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 142 transition count 209
Applied a total of 19 rules in 16 ms. Remains 142 /184 variables (removed 42) and now considering 209/227 (removed 18) transitions.
// Phase 1: matrix 209 rows 142 cols
[2025-06-04 22:41:15] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:41:15] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-04 22:41:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:41:15] [INFO ] State equation strengthened by 92 read => feed constraints.
[2025-06-04 22:41:16] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 142/347 places, 209/1436 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57238 ms. Remains : 142/347 places, 209/1436 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-05 finished in 57386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1436/1436 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 318 transition count 567
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 318 transition count 567
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 318 transition count 563
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 110 place count 270 transition count 515
Iterating global reduction 1 with 48 rules applied. Total rules applied 158 place count 270 transition count 515
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 197 place count 270 transition count 476
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 281 place count 186 transition count 392
Iterating global reduction 2 with 84 rules applied. Total rules applied 365 place count 186 transition count 392
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 461 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 463 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 465 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 466 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 467 place count 183 transition count 269
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 471 place count 179 transition count 265
Iterating global reduction 3 with 4 rules applied. Total rules applied 475 place count 179 transition count 265
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 487 place count 179 transition count 253
Applied a total of 487 rules in 52 ms. Remains 179 /347 variables (removed 168) and now considering 253/1436 (removed 1183) transitions.
// Phase 1: matrix 253 rows 179 cols
[2025-06-04 22:41:16] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:41:16] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-04 22:41:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:41:16] [INFO ] State equation strengthened by 84 read => feed constraints.
[2025-06-04 22:41:18] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 1547 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:41:18] [INFO ] Redundant transitions in 6 ms returned []
Running 252 sub problems to find dead transitions.
[2025-06-04 22:41:18] [INFO ] Invariant cache hit.
[2025-06-04 22:41:18] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 5 (OVERLAPS) 253/432 variables, 179/182 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 84/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 266 constraints, problems are : Problem set: 24 solved, 228 unsolved in 24044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 228 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/1 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 24/179 variables, 2/3 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 253/432 variables, 179/182 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 84/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 228/494 constraints. Problems are: Problem set: 24 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:41:58] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 10 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:42:00] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 4 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:42:00] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 5 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:42:05] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 4 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:42:06] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 5 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:42:07] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:42:07] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 7/501 constraints. Problems are: Problem set: 46 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 501 constraints, problems are : Problem set: 46 solved, 206 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 228/252 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54240ms problems are : Problem set: 46 solved, 206 unsolved
Search for dead transitions found 46 dead transitions in 54241ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 179/347 places, 207/1436 transitions.
Graph (complete) has 526 edges and 179 vertex of which 137 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 137 transition count 189
Applied a total of 19 rules in 8 ms. Remains 137 /179 variables (removed 42) and now considering 189/207 (removed 18) transitions.
// Phase 1: matrix 189 rows 137 cols
[2025-06-04 22:42:12] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:42:12] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-04 22:42:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:42:12] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-04 22:42:13] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 137/347 places, 189/1436 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56652 ms. Remains : 137/347 places, 189/1436 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-06 finished in 56754 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 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1436/1436 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 318 transition count 567
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 318 transition count 567
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 318 transition count 563
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 110 place count 270 transition count 515
Iterating global reduction 1 with 48 rules applied. Total rules applied 158 place count 270 transition count 515
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 197 place count 270 transition count 476
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 281 place count 186 transition count 392
Iterating global reduction 2 with 84 rules applied. Total rules applied 365 place count 186 transition count 392
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 461 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 463 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 465 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 466 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 467 place count 183 transition count 269
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 471 place count 179 transition count 265
Iterating global reduction 3 with 4 rules applied. Total rules applied 475 place count 179 transition count 265
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 487 place count 179 transition count 253
Applied a total of 487 rules in 37 ms. Remains 179 /347 variables (removed 168) and now considering 253/1436 (removed 1183) transitions.
// Phase 1: matrix 253 rows 179 cols
[2025-06-04 22:42:13] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:42:13] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-04 22:42:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:42:13] [INFO ] State equation strengthened by 84 read => feed constraints.
[2025-06-04 22:42:14] [INFO ] Implicit Places using invariants and state equation in 1409 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:42:14] [INFO ] Redundant transitions in 5 ms returned []
Running 252 sub problems to find dead transitions.
[2025-06-04 22:42:14] [INFO ] Invariant cache hit.
[2025-06-04 22:42:14] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/179 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 5 (OVERLAPS) 253/432 variables, 179/182 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 84/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 266 constraints, problems are : Problem set: 24 solved, 228 unsolved in 24167 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 228 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/1 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 24/179 variables, 2/3 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 253/432 variables, 179/182 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 84/266 constraints. Problems are: Problem set: 24 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 228/494 constraints. Problems are: Problem set: 24 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:42:54] [INFO ] Deduced a trap composed of 89 places in 74 ms of which 9 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:42:57] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 3 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:42:57] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 6 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:43:02] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 4 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:43:02] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 5 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:43:03] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:43:04] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 7/501 constraints. Problems are: Problem set: 46 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 501 constraints, problems are : Problem set: 46 solved, 206 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 179/179 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 228/252 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54338ms problems are : Problem set: 46 solved, 206 unsolved
Search for dead transitions found 46 dead transitions in 54339ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 179/347 places, 207/1436 transitions.
Graph (complete) has 526 edges and 179 vertex of which 137 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 137 transition count 189
Applied a total of 19 rules in 6 ms. Remains 137 /179 variables (removed 42) and now considering 189/207 (removed 18) transitions.
// Phase 1: matrix 189 rows 137 cols
[2025-06-04 22:43:09] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:43:09] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-04 22:43:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:43:09] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-04 22:43:09] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 137/347 places, 189/1436 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56706 ms. Remains : 137/347 places, 189/1436 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-07 finished in 56788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p1)&&p0) U (G(!p2) U X(X((p3 U p4))))))'
Support contains 7 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1436/1436 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 322 transition count 691
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 322 transition count 691
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 322 transition count 687
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 98 place count 278 transition count 643
Iterating global reduction 1 with 44 rules applied. Total rules applied 142 place count 278 transition count 643
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 203 place count 278 transition count 582
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 275 place count 206 transition count 510
Iterating global reduction 2 with 72 rules applied. Total rules applied 347 place count 206 transition count 510
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 463 place count 206 transition count 394
Applied a total of 463 rules in 28 ms. Remains 206 /347 variables (removed 141) and now considering 394/1436 (removed 1042) transitions.
// Phase 1: matrix 394 rows 206 cols
[2025-06-04 22:43:10] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:43:10] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-04 22:43:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:43:10] [INFO ] State equation strengthened by 203 read => feed constraints.
[2025-06-04 22:43:13] [INFO ] Implicit Places using invariants and state equation in 3208 ms returned []
Implicit Place search using SMT with State Equation took 3333 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2025-06-04 22:43:13] [INFO ] Invariant cache hit.
[2025-06-04 22:43:13] [INFO ] State equation strengthened by 203 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/206 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 4 (OVERLAPS) 394/600 variables, 206/209 constraints. Problems are: Problem set: 24 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 203/412 constraints. Problems are: Problem set: 24 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 0/412 constraints. Problems are: Problem set: 24 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/600 variables, and 412 constraints, problems are : Problem set: 24 solved, 369 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 369 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 17/198 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 8/206 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 394/600 variables, 206/209 constraints. Problems are: Problem set: 24 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 203/412 constraints. Problems are: Problem set: 24 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 369/781 constraints. Problems are: Problem set: 24 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 781 constraints, problems are : Problem set: 24 solved, 369 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 203/203 constraints, PredecessorRefiner: 369/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60457ms problems are : Problem set: 24 solved, 369 unsolved
Search for dead transitions found 24 dead transitions in 60459ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 206/347 places, 370/1436 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 182 transition count 358
Applied a total of 36 rules in 3 ms. Remains 182 /206 variables (removed 24) and now considering 358/370 (removed 12) transitions.
// Phase 1: matrix 358 rows 182 cols
[2025-06-04 22:44:13] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:44:14] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-04 22:44:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:44:14] [INFO ] State equation strengthened by 199 read => feed constraints.
[2025-06-04 22:44:15] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 182/347 places, 358/1436 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65571 ms. Remains : 182/347 places, 358/1436 transitions.
Stuttering acceptance computed with spot in 842 ms :[(NOT p4), (NOT p4), (NOT p4), (AND (NOT p1) p2 (NOT p4)), (NOT p4), (AND (NOT p1) (NOT p4)), (NOT p4), true, (AND p2 (NOT p4)), (NOT p4), (NOT p4), (AND (NOT p1) p2 (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) p2 (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), p2, (NOT p1), (AND p2 (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-08
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-08 finished in 66448 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(((p0 U p1) U (!p0 U G(p2))))))'
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1436/1436 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 320 transition count 649
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 320 transition count 649
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 320 transition count 645
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 104 place count 274 transition count 599
Iterating global reduction 1 with 46 rules applied. Total rules applied 150 place count 274 transition count 599
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 205 place count 274 transition count 544
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 281 place count 198 transition count 468
Iterating global reduction 2 with 76 rules applied. Total rules applied 357 place count 198 transition count 468
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 2 with 120 rules applied. Total rules applied 477 place count 198 transition count 348
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 478 place count 197 transition count 335
Iterating global reduction 3 with 1 rules applied. Total rules applied 479 place count 197 transition count 335
Applied a total of 479 rules in 41 ms. Remains 197 /347 variables (removed 150) and now considering 335/1436 (removed 1101) transitions.
// Phase 1: matrix 335 rows 197 cols
[2025-06-04 22:44:16] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:44:16] [INFO ] Implicit Places using invariants in 261 ms returned []
[2025-06-04 22:44:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:44:16] [INFO ] State equation strengthened by 151 read => feed constraints.
[2025-06-04 22:44:20] [INFO ] Implicit Places using invariants and state equation in 3239 ms returned []
Implicit Place search using SMT with State Equation took 3502 ms to find 0 implicit places.
Running 334 sub problems to find dead transitions.
[2025-06-04 22:44:20] [INFO ] Invariant cache hit.
[2025-06-04 22:44:20] [INFO ] State equation strengthened by 151 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
At refinement iteration 4 (OVERLAPS) 335/532 variables, 197/200 constraints. Problems are: Problem set: 24 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 151/351 constraints. Problems are: Problem set: 24 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 351 constraints, problems are : Problem set: 24 solved, 310 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 197/197 constraints, ReadFeed: 151/151 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 310 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 17/189 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 8/197 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 335/532 variables, 197/200 constraints. Problems are: Problem set: 24 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 151/351 constraints. Problems are: Problem set: 24 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 310/661 constraints. Problems are: Problem set: 24 solved, 310 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:45:14] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:45:14] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 10 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:45:18] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 4 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:45:19] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:45:19] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 666 constraints, problems are : Problem set: 32 solved, 302 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 197/197 constraints, ReadFeed: 151/151 constraints, PredecessorRefiner: 310/334 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60298ms problems are : Problem set: 32 solved, 302 unsolved
Search for dead transitions found 32 dead transitions in 60300ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 197/347 places, 303/1436 transitions.
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 169 transition count 291
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 166 transition count 288
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 166 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 162 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 162 transition count 284
Applied a total of 54 rules in 6 ms. Remains 162 /197 variables (removed 35) and now considering 284/303 (removed 19) transitions.
// Phase 1: matrix 284 rows 162 cols
[2025-06-04 22:45:20] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:45:20] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-04 22:45:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:45:20] [INFO ] State equation strengthened by 144 read => feed constraints.
[2025-06-04 22:45:21] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1358 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/347 places, 284/1436 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65211 ms. Remains : 162/347 places, 284/1436 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-09
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-09 finished in 65569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(p0)))&&F(p1)))))'
Support contains 3 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 1436/1436 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 319 transition count 608
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 319 transition count 608
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 319 transition count 604
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 107 place count 272 transition count 557
Iterating global reduction 1 with 47 rules applied. Total rules applied 154 place count 272 transition count 557
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 201 place count 272 transition count 510
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 281 place count 192 transition count 430
Iterating global reduction 2 with 80 rules applied. Total rules applied 361 place count 192 transition count 430
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 2 with 112 rules applied. Total rules applied 473 place count 192 transition count 318
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 475 place count 190 transition count 292
Iterating global reduction 3 with 2 rules applied. Total rules applied 477 place count 190 transition count 292
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 478 place count 189 transition count 291
Iterating global reduction 3 with 1 rules applied. Total rules applied 479 place count 189 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 480 place count 189 transition count 290
Applied a total of 480 rules in 24 ms. Remains 189 /347 variables (removed 158) and now considering 290/1436 (removed 1146) transitions.
// Phase 1: matrix 290 rows 189 cols
[2025-06-04 22:45:22] [INFO ] Computed 3 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:45:22] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-04 22:45:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:45:22] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-04 22:45:23] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2025-06-04 22:45:23] [INFO ] Invariant cache hit.
[2025-06-04 22:45:23] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
At refinement iteration 4 (OVERLAPS) 290/479 variables, 189/192 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 112/304 constraints. Problems are: Problem set: 24 solved, 265 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/304 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 0/479 variables, 0/304 constraints. Problems are: Problem set: 24 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 304 constraints, problems are : Problem set: 24 solved, 265 unsolved in 18042 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 17/181 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 8/189 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 290/479 variables, 189/192 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 112/304 constraints. Problems are: Problem set: 24 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 265/569 constraints. Problems are: Problem set: 24 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:45:58] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 4 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:45:58] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 4 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:46:06] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 5 ms to minimize.
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:46:06] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 6 ms to minimize.
Problem TDEAD237 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:46:07] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:46:07] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 6/575 constraints. Problems are: Problem set: 46 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/479 variables, and 575 constraints, problems are : Problem set: 46 solved, 243 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 265/289 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48344ms problems are : Problem set: 46 solved, 243 unsolved
Search for dead transitions found 46 dead transitions in 48348ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/347 places, 244/1436 transitions.
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 147 transition count 226
Applied a total of 60 rules in 1 ms. Remains 147 /189 variables (removed 42) and now considering 226/244 (removed 18) transitions.
// Phase 1: matrix 226 rows 147 cols
[2025-06-04 22:46:11] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:46:11] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-04 22:46:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:46:11] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-04 22:46:12] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/347 places, 226/1436 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50659 ms. Remains : 147/347 places, 226/1436 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-11 finished in 50898 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)) U (p1||F(p2))))'
Support contains 5 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1436/1436 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 320 transition count 569
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 320 transition count 569
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 320 transition count 566
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 104 place count 273 transition count 519
Iterating global reduction 1 with 47 rules applied. Total rules applied 151 place count 273 transition count 519
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 189 place count 273 transition count 481
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 273 place count 189 transition count 397
Iterating global reduction 2 with 84 rules applied. Total rules applied 357 place count 189 transition count 397
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 449 place count 189 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 450 place count 188 transition count 292
Iterating global reduction 3 with 1 rules applied. Total rules applied 451 place count 188 transition count 292
Applied a total of 451 rules in 55 ms. Remains 188 /347 variables (removed 159) and now considering 292/1436 (removed 1144) transitions.
// Phase 1: matrix 292 rows 188 cols
[2025-06-04 22:46:13] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:46:13] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-04 22:46:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:46:13] [INFO ] State equation strengthened by 115 read => feed constraints.
[2025-06-04 22:46:14] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned []
Implicit Place search using SMT with State Equation took 1553 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:46:14] [INFO ] Redundant transitions in 6 ms returned []
Running 291 sub problems to find dead transitions.
[2025-06-04 22:46:14] [INFO ] Invariant cache hit.
[2025-06-04 22:46:14] [INFO ] State equation strengthened by 115 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
At refinement iteration 4 (OVERLAPS) 292/480 variables, 188/191 constraints. Problems are: Problem set: 24 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 115/306 constraints. Problems are: Problem set: 24 solved, 267 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/306 constraints. Problems are: Problem set: 24 solved, 267 unsolved
At refinement iteration 7 (OVERLAPS) 0/480 variables, 0/306 constraints. Problems are: Problem set: 24 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 306 constraints, problems are : Problem set: 24 solved, 267 unsolved in 24450 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 267 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 17/180 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 8/188 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 292/480 variables, 188/191 constraints. Problems are: Problem set: 24 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 115/306 constraints. Problems are: Problem set: 24 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 267/573 constraints. Problems are: Problem set: 24 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:46:55] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:46:57] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 10 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:46:57] [INFO ] Deduced a trap composed of 87 places in 73 ms of which 5 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:46:58] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 6 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:47:03] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 6 ms to minimize.
Problem TDEAD239 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:47:04] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:47:04] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 7/580 constraints. Problems are: Problem set: 46 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 580 constraints, problems are : Problem set: 46 solved, 245 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 267/291 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54700ms problems are : Problem set: 46 solved, 245 unsolved
Search for dead transitions found 46 dead transitions in 54700ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 188/347 places, 246/1436 transitions.
Graph (complete) has 582 edges and 188 vertex of which 146 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 146 transition count 228
Applied a total of 19 rules in 7 ms. Remains 146 /188 variables (removed 42) and now considering 228/246 (removed 18) transitions.
// Phase 1: matrix 228 rows 146 cols
[2025-06-04 22:47:09] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:47:09] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-04 22:47:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:47:09] [INFO ] State equation strengthened by 107 read => feed constraints.
[2025-06-04 22:47:09] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 146/347 places, 228/1436 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56877 ms. Remains : 146/347 places, 228/1436 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-12
Stuttering criterion allowed to conclude after 92 steps with 18 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-12 finished in 56967 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)||G(p1))))'
Support contains 3 out of 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1436/1436 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 319 transition count 608
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 319 transition count 608
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 319 transition count 604
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 107 place count 272 transition count 557
Iterating global reduction 1 with 47 rules applied. Total rules applied 154 place count 272 transition count 557
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 201 place count 272 transition count 510
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 281 place count 192 transition count 430
Iterating global reduction 2 with 80 rules applied. Total rules applied 361 place count 192 transition count 430
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 2 with 108 rules applied. Total rules applied 469 place count 192 transition count 322
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 470 place count 191 transition count 309
Iterating global reduction 3 with 1 rules applied. Total rules applied 471 place count 191 transition count 309
Applied a total of 471 rules in 25 ms. Remains 191 /347 variables (removed 156) and now considering 309/1436 (removed 1127) transitions.
// Phase 1: matrix 309 rows 191 cols
[2025-06-04 22:47:09] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:47:10] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-04 22:47:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:47:10] [INFO ] State equation strengthened by 130 read => feed constraints.
[2025-06-04 22:47:11] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 1714 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:47:11] [INFO ] Redundant transitions in 2 ms returned []
Running 308 sub problems to find dead transitions.
[2025-06-04 22:47:11] [INFO ] Invariant cache hit.
[2025-06-04 22:47:11] [INFO ] State equation strengthened by 130 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
At refinement iteration 4 (OVERLAPS) 309/500 variables, 191/194 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 130/324 constraints. Problems are: Problem set: 24 solved, 284 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/324 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/500 variables, 0/324 constraints. Problems are: Problem set: 24 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 324 constraints, problems are : Problem set: 24 solved, 284 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 191/191 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 284 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 17/183 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 8/191 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 309/500 variables, 191/194 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 130/324 constraints. Problems are: Problem set: 24 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/500 variables, 284/608 constraints. Problems are: Problem set: 24 solved, 284 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:48:05] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 9 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:48:07] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 4 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:48:08] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 5 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 500/500 variables, and 611 constraints, problems are : Problem set: 36 solved, 272 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 191/191 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 284/308 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60330ms problems are : Problem set: 36 solved, 272 unsolved
Search for dead transitions found 36 dead transitions in 60331ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 191/347 places, 273/1436 transitions.
Graph (complete) has 634 edges and 191 vertex of which 159 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 159 transition count 261
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 155 transition count 257
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 155 transition count 257
Applied a total of 21 rules in 9 ms. Remains 155 /191 variables (removed 36) and now considering 257/273 (removed 16) transitions.
// Phase 1: matrix 257 rows 155 cols
[2025-06-04 22:48:12] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:48:12] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-04 22:48:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:48:12] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-04 22:48:12] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 155/347 places, 257/1436 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62932 ms. Remains : 155/347 places, 257/1436 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-14
Product exploration explored 100000 steps with 18061 reset in 350 ms.
Product exploration explored 100000 steps with 18032 reset in 383 ms.
Computed a total of 12 stabilizing places and 61 stable transitions
Graph (complete) has 578 edges and 155 vertex of which 154 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 61 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 128 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (7085 resets) in 478 ms. (83 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (1236 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
[2025-06-04 22:48:13] [INFO ] Invariant cache hit.
[2025-06-04 22:48:13] [INFO ] State equation strengthened by 122 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 408/412 variables, and 181 constraints, problems are : Problem set: 1 solved, 0 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 151/155 constraints, ReadFeed: 30/122 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 337 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Support contains 2 out of 155 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 257/257 transitions.
Applied a total of 0 rules in 10 ms. Remains 155 /155 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2025-06-04 22:48:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:48:14] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-04 22:48:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:48:14] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-04 22:48:15] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:48:15] [INFO ] Redundant transitions in 2 ms returned []
Running 256 sub problems to find dead transitions.
[2025-06-04 22:48:15] [INFO ] Invariant cache hit.
[2025-06-04 22:48:15] [INFO ] State equation strengthened by 122 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
At refinement iteration 3 (OVERLAPS) 257/412 variables, 155/156 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 122/278 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/278 constraints. Problems are: Problem set: 4 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/412 variables, 0/278 constraints. Problems are: Problem set: 4 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 278 constraints, problems are : Problem set: 4 solved, 252 unsolved in 19706 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 257/408 variables, 151/152 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 122/274 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 41/315 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/315 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 4/412 variables, 4/319 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 211/530 constraints. Problems are: Problem set: 4 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/412 variables, and 530 constraints, problems are : Problem set: 4 solved, 252 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 252/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49905ms problems are : Problem set: 4 solved, 252 unsolved
Search for dead transitions found 4 dead transitions in 49907ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 155/155 places, 253/257 transitions.
Graph (complete) has 574 edges and 155 vertex of which 151 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 151 transition count 249
Applied a total of 5 rules in 6 ms. Remains 151 /155 variables (removed 4) and now considering 249/253 (removed 4) transitions.
// Phase 1: matrix 249 rows 151 cols
[2025-06-04 22:49:05] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:49:05] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-04 22:49:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:49:05] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-04 22:49:05] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 151/155 places, 249/257 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 51415 ms. Remains : 151/155 places, 249/257 transitions.
Computed a total of 12 stabilizing places and 61 stable transitions
Graph (complete) has 562 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 12 stabilizing places and 61 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
RANDOM walk for 5422 steps (996 resets) in 22 ms. (235 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Product exploration explored 100000 steps with 18010 reset in 320 ms.
Product exploration explored 100000 steps with 17919 reset in 251 ms.
Built C files in :
/tmp/ltsmin10404088631567225353
[2025-06-04 22:49:06] [INFO ] Computing symmetric may disable matrix : 249 transitions.
[2025-06-04 22:49:06] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 22:49:06] [INFO ] Computing symmetric may enable matrix : 249 transitions.
[2025-06-04 22:49:06] [INFO ] Computation of Complete enable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 22:49:07] [INFO ] Computing Do-Not-Accords matrix : 249 transitions.
[2025-06-04 22:49:07] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 22:49:07] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10404088631567225353
Running compilation step : cd /tmp/ltsmin10404088631567225353;'/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 716 ms.
Running link step : cd /tmp/ltsmin10404088631567225353;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin10404088631567225353;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13529017428266643704.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 249/249 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 150 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 149 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 149 transition count 235
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 8 place count 145 transition count 231
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 145 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 145 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 144 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 144 transition count 214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 143 transition count 213
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 143 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 143 transition count 212
Applied a total of 21 rules in 16 ms. Remains 143 /151 variables (removed 8) and now considering 212/249 (removed 37) transitions.
// Phase 1: matrix 212 rows 143 cols
[2025-06-04 22:49:22] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:49:22] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-04 22:49:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:49:22] [INFO ] State equation strengthened by 91 read => feed constraints.
[2025-06-04 22:49:22] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:49:22] [INFO ] Redundant transitions in 2 ms returned []
Running 211 sub problems to find dead transitions.
[2025-06-04 22:49:22] [INFO ] Invariant cache hit.
[2025-06-04 22:49:22] [INFO ] State equation strengthened by 91 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/355 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 91/236 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/355 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 236 constraints, problems are : Problem set: 0 solved, 211 unsolved in 14769 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/355 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 91/236 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 211/447 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:49:50] [INFO ] Deduced a trap along path composed of 9 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 448 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44908ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 44909ms
Starting structural reductions in SI_LTL mode, iteration 1 : 143/151 places, 212/249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45550 ms. Remains : 143/151 places, 212/249 transitions.
Built C files in :
/tmp/ltsmin9457758992047060267
[2025-06-04 22:50:07] [INFO ] Computing symmetric may disable matrix : 212 transitions.
[2025-06-04 22:50:07] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 22:50:07] [INFO ] Computing symmetric may enable matrix : 212 transitions.
[2025-06-04 22:50:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 22:50:07] [INFO ] Computing Do-Not-Accords matrix : 212 transitions.
[2025-06-04 22:50:07] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 22:50:07] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9457758992047060267
Running compilation step : cd /tmp/ltsmin9457758992047060267;'/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 423 ms.
Running link step : cd /tmp/ltsmin9457758992047060267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9457758992047060267;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1806489990230706700.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 22:50:22] [INFO ] Flatten gal took : 17 ms
[2025-06-04 22:50:22] [INFO ] Flatten gal took : 8 ms
[2025-06-04 22:50:22] [INFO ] Time to serialize gal into /tmp/LTL12622978139790601319.gal : 19 ms
[2025-06-04 22:50:22] [INFO ] Time to serialize properties into /tmp/LTL2565839080816716101.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12622978139790601319.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13451214798208171934.hoa' '-atoms' '/tmp/LTL2565839080816716101.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2565839080816716101.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13451214798208171934.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t42, t43, t44, t45, t46, t223, t226, t229, t232, t249, t255, t263, t269, t474, t475, t477...786
Computing Next relation with stutter on 1.87787e+11 deadlock states
Detected timeout of ITS tools.
[2025-06-04 22:50:37] [INFO ] Flatten gal took : 9 ms
[2025-06-04 22:50:37] [INFO ] Flatten gal took : 8 ms
[2025-06-04 22:50:37] [INFO ] Time to serialize gal into /tmp/LTL8266786886926614792.gal : 2 ms
[2025-06-04 22:50:37] [INFO ] Time to serialize properties into /tmp/LTL14754175026811827696.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8266786886926614792.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14754175026811827696.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((s1>=1)&&(l3919>=1))"))||(G("((s1<1)||(l3932<1))")))))
Formula 0 simplified : G(F!"((s1>=1)&&(l3919>=1))" & F!"((s1<1)||(l3932<1))")
Detected timeout of ITS tools.
[2025-06-04 22:50:53] [INFO ] Flatten gal took : 12 ms
[2025-06-04 22:50:53] [INFO ] Applying decomposition
[2025-06-04 22:50:53] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7744975992824598790.txt' '-o' '/tmp/graph7744975992824598790.bin' '-w' '/tmp/graph7744975992824598790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7744975992824598790.bin' '-l' '-1' '-v' '-w' '/tmp/graph7744975992824598790.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:50:53] [INFO ] Decomposing Gal with order
[2025-06-04 22:50:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:50:53] [INFO ] Removed a total of 320 redundant transitions.
[2025-06-04 22:50:53] [INFO ] Flatten gal took : 80 ms
[2025-06-04 22:50:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 184 labels/synchronizations in 15 ms.
[2025-06-04 22:50:53] [INFO ] Time to serialize gal into /tmp/LTL10000073840017399977.gal : 14 ms
[2025-06-04 22:50:53] [INFO ] Time to serialize properties into /tmp/LTL14686197422343811880.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10000073840017399977.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14686197422343811880.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("((i4.u1.s1>=1)&&(i1.u5.l3919>=1))"))||(G("((i4.u1.s1<1)||(i1.u6.l3932<1))")))))
Formula 0 simplified : G(F!"((i4.u1.s1>=1)&&(i1.u5.l3919>=1))" & F!"((i4.u1.s1<1)||(i1.u6.l3932<1))")
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-14 finished in 238520 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 347 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 347/347 places, 1436/1436 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 318 transition count 567
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 318 transition count 567
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 318 transition count 563
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 110 place count 270 transition count 515
Iterating global reduction 1 with 48 rules applied. Total rules applied 158 place count 270 transition count 515
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 197 place count 270 transition count 476
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 281 place count 186 transition count 392
Iterating global reduction 2 with 84 rules applied. Total rules applied 365 place count 186 transition count 392
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 461 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 463 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 465 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 466 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 467 place count 183 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 468 place count 183 transition count 268
Applied a total of 468 rules in 33 ms. Remains 183 /347 variables (removed 164) and now considering 268/1436 (removed 1168) transitions.
// Phase 1: matrix 268 rows 183 cols
[2025-06-04 22:51:08] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:51:08] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-04 22:51:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:51:08] [INFO ] State equation strengthened by 95 read => feed constraints.
[2025-06-04 22:51:10] [INFO ] Implicit Places using invariants and state equation in 1536 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 22:51:10] [INFO ] Redundant transitions in 2 ms returned []
Running 267 sub problems to find dead transitions.
[2025-06-04 22:51:10] [INFO ] Invariant cache hit.
[2025-06-04 22:51:10] [INFO ] State equation strengthened by 95 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 4 (OVERLAPS) 268/451 variables, 183/186 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 95/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 7 (OVERLAPS) 0/451 variables, 0/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 281 constraints, problems are : Problem set: 24 solved, 243 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 243 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 17/175 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 3 (OVERLAPS) 8/183 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 5 (OVERLAPS) 268/451 variables, 183/186 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 95/281 constraints. Problems are: Problem set: 24 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 243/524 constraints. Problems are: Problem set: 24 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:51:45] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:51:45] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 4 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:51:46] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 5 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:51:52] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 5 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:51:53] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:51:53] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 6/530 constraints. Problems are: Problem set: 46 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 530 constraints, problems are : Problem set: 46 solved, 221 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 243/267 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50300ms problems are : Problem set: 46 solved, 221 unsolved
Search for dead transitions found 46 dead transitions in 50300ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 183/347 places, 222/1436 transitions.
Graph (complete) has 549 edges and 183 vertex of which 141 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 141 transition count 204
Applied a total of 19 rules in 6 ms. Remains 141 /183 variables (removed 42) and now considering 204/222 (removed 18) transitions.
// Phase 1: matrix 204 rows 141 cols
[2025-06-04 22:52:00] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:52:00] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-04 22:52:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:52:00] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-04 22:52:01] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 141/347 places, 204/1436 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52936 ms. Remains : 141/347 places, 204/1436 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m020-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m020-LTLFireability-15 finished in 53000 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)||G(p1))))'
[2025-06-04 22:52:01] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2194342990154219469
[2025-06-04 22:52:01] [INFO ] Applying decomposition
[2025-06-04 22:52:01] [INFO ] Computing symmetric may disable matrix : 1436 transitions.
[2025-06-04 22:52:01] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 22:52:01] [INFO ] Flatten gal took : 41 ms
[2025-06-04 22:52:01] [INFO ] Computing symmetric may enable matrix : 1436 transitions.
[2025-06-04 22:52:01] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4947209993340180219.txt' '-o' '/tmp/graph4947209993340180219.bin' '-w' '/tmp/graph4947209993340180219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4947209993340180219.bin' '-l' '-1' '-v' '-w' '/tmp/graph4947209993340180219.weights' '-q' '0' '-e' '0.001'
[2025-06-04 22:52:01] [INFO ] Decomposing Gal with order
[2025-06-04 22:52:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 22:52:02] [INFO ] Removed a total of 1247 redundant transitions.
[2025-06-04 22:52:02] [INFO ] Flatten gal took : 256 ms
[2025-06-04 22:52:02] [INFO ] Computing Do-Not-Accords matrix : 1436 transitions.
[2025-06-04 22:52:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 933 labels/synchronizations in 47 ms.
[2025-06-04 22:52:02] [INFO ] Time to serialize gal into /tmp/LTLFireability3054585700557934047.gal : 7 ms
[2025-06-04 22:52:02] [INFO ] Time to serialize properties into /tmp/LTLFireability16691564541034133625.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3054585700557934047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16691564541034133625.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
[2025-06-04 22:52:02] [INFO ] Computation of Completed DNA matrix. took 88 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 22:52:02] [INFO ] Built C files in 651ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2194342990154219469
Running compilation step : cd /tmp/ltsmin2194342990154219469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((F((G("((u0.s1>=1)&&(u19.l3919>=1))"))||(G("((u0.s1<1)||(u0.l3932<1))")))))
Formula 0 simplified : G(F!"((u0.s1>=1)&&(u19.l3919>=1))" & F!"((u0.s1<1)||(u0.l3932<1))")
Compilation finished in 6330 ms.
Running link step : cd /tmp/ltsmin2194342990154219469;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin2194342990154219469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-04 23:17:31] [INFO ] Flatten gal took : 526 ms
[2025-06-04 23:17:31] [INFO ] Time to serialize gal into /tmp/LTLFireability1583450594933760624.gal : 120 ms
[2025-06-04 23:17:31] [INFO ] Time to serialize properties into /tmp/LTLFireability7073144590175839428.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1583450594933760624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7073144590175839428.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

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