Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r334-tall-171679079500060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is RingSingleMessageInMbox-PT-d1m005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079500060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 13 00:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 13 00:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 00:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 00:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716794287213

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-d1m005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-27 07:18:08] [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]
[2024-05-27 07:18:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 07:18:08] [INFO ] Load time of PNML (sax parser for PT used): 437 ms
[2024-05-27 07:18:08] [INFO ] Transformed 6690 places.
[2024-05-27 07:18:08] [INFO ] Transformed 11934 transitions.
[2024-05-27 07:18:08] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 594 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 4305 places in 35 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 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 1083 places :
Symmetric choice reduction at 1 with 1083 rule applications. Total rules 1202 place count 1285 transition count 7347
Iterating global reduction 1 with 1083 rules applied. Total rules applied 2285 place count 1285 transition count 7347
Ensure Unique test removed 294 transitions
Reduce isomorphic transitions removed 294 transitions.
Iterating post reduction 1 with 294 rules applied. Total rules applied 2579 place count 1285 transition count 7053
Discarding 854 places :
Symmetric choice reduction at 2 with 854 rule applications. Total rules 3433 place count 431 transition count 6199
Iterating global reduction 2 with 854 rules applied. Total rules applied 4287 place count 431 transition count 6199
Ensure Unique test removed 4537 transitions
Reduce isomorphic transitions removed 4537 transitions.
Iterating post reduction 2 with 4537 rules applied. Total rules applied 8824 place count 431 transition count 1662
Discarding 82 places :
Symmetric choice reduction at 3 with 82 rule applications. Total rules 8906 place count 349 transition count 1580
Iterating global reduction 3 with 82 rules applied. Total rules applied 8988 place count 349 transition count 1580
Ensure Unique test removed 260 transitions
Reduce isomorphic transitions removed 260 transitions.
Iterating post reduction 3 with 260 rules applied. Total rules applied 9248 place count 349 transition count 1320
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 9256 place count 341 transition count 1312
Iterating global reduction 4 with 8 rules applied. Total rules applied 9264 place count 341 transition count 1312
Applied a total of 9264 rules in 478 ms. Remains 341 /2385 variables (removed 2044) and now considering 1312/11934 (removed 10622) transitions.
// Phase 1: matrix 1312 rows 341 cols
[2024-05-27 07:18:09] [INFO ] Computed 3 invariants in 37 ms
[2024-05-27 07:18:10] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-27 07:18:10] [INFO ] Invariant cache hit.
[2024-05-27 07:18:10] [INFO ] State equation strengthened by 1002 read => feed constraints.
[2024-05-27 07:18:12] [INFO ] Implicit Places using invariants and state equation in 2051 ms returned []
Implicit Place search using SMT with State Equation took 2479 ms to find 0 implicit places.
Running 1311 sub problems to find dead transitions.
[2024-05-27 07:18:12] [INFO ] Invariant cache hit.
[2024-05-27 07:18:12] [INFO ] State equation strengthened by 1002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (OVERLAPS) 1/341 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1653/1653 variables, and 344 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 341/341 constraints, ReadFeed: 0/1002 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (OVERLAPS) 1/341 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
At refinement iteration 4 (OVERLAPS) 1312/1653 variables, 341/344 constraints. Problems are: Problem set: 24 solved, 1287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1653 variables, 1002/1346 constraints. Problems are: Problem set: 24 solved, 1287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1653/1653 variables, and 2633 constraints, problems are : Problem set: 24 solved, 1287 unsolved in 31249 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 341/341 constraints, ReadFeed: 1002/1002 constraints, PredecessorRefiner: 1287/1311 constraints, Known Traps: 0/0 constraints]
After SMT, in 67402ms problems are : Problem set: 24 solved, 1287 unsolved
Search for dead transitions found 24 dead transitions in 67430ms
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 : 341/2385 places, 1288/11934 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 317 transition count 1276
Applied a total of 36 rules in 9 ms. Remains 317 /341 variables (removed 24) and now considering 1276/1288 (removed 12) transitions.
// Phase 1: matrix 1276 rows 317 cols
[2024-05-27 07:19:19] [INFO ] Computed 2 invariants in 6 ms
[2024-05-27 07:19:19] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-27 07:19:19] [INFO ] Invariant cache hit.
[2024-05-27 07:19:20] [INFO ] State equation strengthened by 998 read => feed constraints.
[2024-05-27 07:19:21] [INFO ] Implicit Places using invariants and state equation in 1724 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 317/2385 places, 1276/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72324 ms. Remains : 317/2385 places, 1276/11934 transitions.
Support contains 31 out of 317 places after structural reductions.
[2024-05-27 07:19:21] [INFO ] Flatten gal took : 109 ms
[2024-05-27 07:19:21] [INFO ] Flatten gal took : 71 ms
[2024-05-27 07:19:21] [INFO ] Input system was already deterministic with 1276 transitions.
Support contains 28 out of 317 places (down from 31) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (6882 resets) in 3011 ms. (13 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40003 steps (678 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
[2024-05-27 07:19:22] [INFO ] Invariant cache hit.
[2024-05-27 07:19:22] [INFO ] State equation strengthened by 998 read => feed constraints.
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) 70/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 394/471 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 116/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 1593/1593 variables, and 435 constraints, problems are : Problem set: 1 solved, 0 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 317/317 constraints, ReadFeed: 116/998 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 303ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 84 stabilizing places and 578 stable transitions
Graph (complete) has 1911 edges and 317 vertex of which 316 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((G(F(p2))||p1)))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 1276/1276 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 293 transition count 580
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 293 transition count 580
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 293 transition count 578
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 110 place count 233 transition count 518
Iterating global reduction 1 with 60 rules applied. Total rules applied 170 place count 233 transition count 518
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 248 place count 233 transition count 440
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 312 place count 169 transition count 376
Iterating global reduction 2 with 64 rules applied. Total rules applied 376 place count 169 transition count 376
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 468 place count 169 transition count 284
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 469 place count 168 transition count 271
Iterating global reduction 3 with 1 rules applied. Total rules applied 470 place count 168 transition count 271
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 471 place count 167 transition count 270
Iterating global reduction 3 with 1 rules applied. Total rules applied 472 place count 167 transition count 270
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 476 place count 163 transition count 266
Iterating global reduction 3 with 4 rules applied. Total rules applied 480 place count 163 transition count 266
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 500 place count 163 transition count 246
Applied a total of 500 rules in 23 ms. Remains 163 /317 variables (removed 154) and now considering 246/1276 (removed 1030) transitions.
// Phase 1: matrix 246 rows 163 cols
[2024-05-27 07:19:23] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 07:19:23] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 07:19:23] [INFO ] Invariant cache hit.
[2024-05-27 07:19:23] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-27 07:19:23] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2024-05-27 07:19:23] [INFO ] Invariant cache hit.
[2024-05-27 07:19:23] [INFO ] State equation strengthened by 103 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/409 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 103/268 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-27 07:19:29] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 12 ms to minimize.
[2024-05-27 07:19:29] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-27 07:19:33] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 2 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/409 variables, 1/271 constraints. Problems are: Problem set: 10 solved, 235 unsolved
[2024-05-27 07:19:36] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 2 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 1/272 constraints. Problems are: Problem set: 20 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/272 constraints. Problems are: Problem set: 20 solved, 225 unsolved
At refinement iteration 11 (OVERLAPS) 0/409 variables, 0/272 constraints. Problems are: Problem set: 20 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 272 constraints, problems are : Problem set: 20 solved, 225 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 20 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 2/2 constraints. Problems are: Problem set: 20 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/2 constraints. Problems are: Problem set: 20 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 1/3 constraints. Problems are: Problem set: 20 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/3 constraints. Problems are: Problem set: 20 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 8/155 variables, 1/4 constraints. Problems are: Problem set: 20 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 20 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 246/401 variables, 155/159 constraints. Problems are: Problem set: 20 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 103/262 constraints. Problems are: Problem set: 20 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 41/303 constraints. Problems are: Problem set: 20 solved, 225 unsolved
[2024-05-27 07:19:49] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:19:50] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:19:50] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:19:50] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
[2024-05-27 07:19:50] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 5/308 constraints. Problems are: Problem set: 20 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/308 constraints. Problems are: Problem set: 20 solved, 225 unsolved
At refinement iteration 11 (OVERLAPS) 8/409 variables, 8/316 constraints. Problems are: Problem set: 20 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 184/500 constraints. Problems are: Problem set: 20 solved, 225 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/409 variables, 2/502 constraints. Problems are: Problem set: 20 solved, 225 unsolved
[2024-05-27 07:20:03] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-05-27 07:20:03] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 3 ms to minimize.
[2024-05-27 07:20:05] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
Problem TDEAD205 is UNSAT
Problem TDEAD209 is UNSAT
[2024-05-27 07:20:05] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:20:06] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-05-27 07:20:06] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/409 variables, 6/508 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 0/508 constraints. Problems are: Problem set: 22 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/409 variables, and 508 constraints, problems are : Problem set: 22 solved, 223 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 225/245 constraints, Known Traps: 15/15 constraints]
After SMT, in 50455ms problems are : Problem set: 22 solved, 223 unsolved
Search for dead transitions found 22 dead transitions in 50458ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 163/317 places, 224/1276 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 145 transition count 218
Applied a total of 24 rules in 3 ms. Remains 145 /163 variables (removed 18) and now considering 218/224 (removed 6) transitions.
// Phase 1: matrix 218 rows 145 cols
[2024-05-27 07:20:14] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:20:14] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-27 07:20:14] [INFO ] Invariant cache hit.
[2024-05-27 07:20:14] [INFO ] State equation strengthened by 99 read => feed constraints.
[2024-05-27 07:20:14] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 145/317 places, 218/1276 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51310 ms. Remains : 145/317 places, 218/1276 transitions.
Stuttering acceptance computed with spot in 386 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 305 ms.
Product exploration explored 100000 steps with 33333 reset in 249 ms.
Computed a total of 20 stabilizing places and 80 stable transitions
Graph (complete) has 516 edges and 145 vertex of which 144 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 20 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 27 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-00 finished in 52343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 1276/1276 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 291 transition count 498
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 291 transition count 498
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 291 transition count 495
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 116 place count 230 transition count 434
Iterating global reduction 1 with 61 rules applied. Total rules applied 177 place count 230 transition count 434
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 230 place count 230 transition count 381
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 302 place count 158 transition count 309
Iterating global reduction 2 with 72 rules applied. Total rules applied 374 place count 158 transition count 309
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 442 place count 158 transition count 241
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 444 place count 156 transition count 215
Iterating global reduction 3 with 2 rules applied. Total rules applied 446 place count 156 transition count 215
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 447 place count 155 transition count 214
Iterating global reduction 3 with 1 rules applied. Total rules applied 448 place count 155 transition count 214
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 452 place count 151 transition count 210
Iterating global reduction 3 with 4 rules applied. Total rules applied 456 place count 151 transition count 210
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 464 place count 151 transition count 202
Applied a total of 464 rules in 60 ms. Remains 151 /317 variables (removed 166) and now considering 202/1276 (removed 1074) transitions.
// Phase 1: matrix 202 rows 151 cols
[2024-05-27 07:20:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:20:15] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-27 07:20:15] [INFO ] Invariant cache hit.
[2024-05-27 07:20:16] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 07:20:16] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-05-27 07:20:16] [INFO ] Redundant transitions in 8 ms returned []
Running 201 sub problems to find dead transitions.
[2024-05-27 07:20:16] [INFO ] Invariant cache hit.
[2024-05-27 07:20:16] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/151 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/353 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 68/221 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/353 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 221 constraints, problems are : Problem set: 0 solved, 201 unsolved in 6118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/151 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/353 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 68/221 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 201/422 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-27 07:20:26] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:20:26] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-27 07:20:26] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:20:26] [INFO ] Deduced a trap composed of 68 places in 41 ms of which 1 ms to minimize.
[2024-05-27 07:20:27] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:20:27] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-27 07:20:27] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
[2024-05-27 07:20:28] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
[2024-05-27 07:20:28] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
[2024-05-27 07:20:28] [INFO ] Deduced a trap composed of 73 places in 42 ms of which 1 ms to minimize.
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
[2024-05-27 07:20:29] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2024-05-27 07:20:29] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
[2024-05-27 07:20:29] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 1 ms to minimize.
[2024-05-27 07:20:29] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 14/436 constraints. Problems are: Problem set: 22 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/436 constraints. Problems are: Problem set: 22 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/353 variables, 0/436 constraints. Problems are: Problem set: 22 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 436 constraints, problems are : Problem set: 22 solved, 179 unsolved in 18567 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 14/14 constraints]
After SMT, in 24967ms problems are : Problem set: 22 solved, 179 unsolved
Search for dead transitions found 22 dead transitions in 24970ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 151/317 places, 180/1276 transitions.
Graph (complete) has 472 edges and 151 vertex of which 133 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 133 transition count 174
Applied a total of 7 rules in 18 ms. Remains 133 /151 variables (removed 18) and now considering 174/180 (removed 6) transitions.
// Phase 1: matrix 174 rows 133 cols
[2024-05-27 07:20:41] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:20:41] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-27 07:20:41] [INFO ] Invariant cache hit.
[2024-05-27 07:20:41] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-27 07:20:41] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 133/317 places, 174/1276 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25762 ms. Remains : 133/317 places, 174/1276 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-01
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-01 finished in 25816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 1276/1276 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 291 transition count 538
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 291 transition count 538
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 291 transition count 535
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 116 place count 230 transition count 474
Iterating global reduction 1 with 61 rules applied. Total rules applied 177 place count 230 transition count 474
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 243 place count 230 transition count 408
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 311 place count 162 transition count 340
Iterating global reduction 2 with 68 rules applied. Total rules applied 379 place count 162 transition count 340
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 455 place count 162 transition count 264
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 457 place count 160 transition count 238
Iterating global reduction 3 with 2 rules applied. Total rules applied 459 place count 160 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 460 place count 159 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 461 place count 159 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 462 place count 159 transition count 236
Applied a total of 462 rules in 17 ms. Remains 159 /317 variables (removed 158) and now considering 236/1276 (removed 1040) transitions.
// Phase 1: matrix 236 rows 159 cols
[2024-05-27 07:20:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:20:41] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 07:20:41] [INFO ] Invariant cache hit.
[2024-05-27 07:20:41] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-27 07:20:42] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-05-27 07:20:42] [INFO ] Invariant cache hit.
[2024-05-27 07:20:42] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 236/395 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 95/256 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-27 07:20:45] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-27 07:20:45] [INFO ] Deduced a trap composed of 67 places in 46 ms of which 0 ms to minimize.
[2024-05-27 07:20:45] [INFO ] Deduced a trap composed of 60 places in 38 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-05-27 07:20:46] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 4/260 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/260 constraints. Problems are: Problem set: 20 solved, 215 unsolved
[2024-05-27 07:20:50] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 2 ms to minimize.
[2024-05-27 07:20:50] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 1 ms to minimize.
[2024-05-27 07:20:51] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/395 variables, 3/263 constraints. Problems are: Problem set: 20 solved, 215 unsolved
[2024-05-27 07:20:52] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 1/264 constraints. Problems are: Problem set: 20 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/264 constraints. Problems are: Problem set: 20 solved, 215 unsolved
[2024-05-27 07:20:56] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
Problem TDEAD199 is UNSAT
At refinement iteration 11 (OVERLAPS) 0/395 variables, 1/265 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 0/265 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 13 (OVERLAPS) 0/395 variables, 0/265 constraints. Problems are: Problem set: 21 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 265 constraints, problems are : Problem set: 21 solved, 214 unsolved in 20373 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 21 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 2/2 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 1/3 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/3 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 8/150 variables, 1/4 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/4 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 236/386 variables, 150/154 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 95/249 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 40/289 constraints. Problems are: Problem set: 21 solved, 214 unsolved
[2024-05-27 07:21:08] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-27 07:21:08] [INFO ] Deduced a trap composed of 66 places in 40 ms of which 1 ms to minimize.
[2024-05-27 07:21:08] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:21:08] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 4/293 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/293 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 11 (OVERLAPS) 9/395 variables, 9/302 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 174/476 constraints. Problems are: Problem set: 21 solved, 214 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 7/483 constraints. Problems are: Problem set: 21 solved, 214 unsolved
[2024-05-27 07:21:25] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
Problem TDEAD195 is UNSAT
[2024-05-27 07:21:25] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2024-05-27 07:21:25] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 3/486 constraints. Problems are: Problem set: 22 solved, 213 unsolved
[2024-05-27 07:21:32] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/395 variables, 1/487 constraints. Problems are: Problem set: 22 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 487 constraints, problems are : Problem set: 22 solved, 213 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 214/235 constraints, Known Traps: 17/17 constraints]
After SMT, in 50708ms problems are : Problem set: 22 solved, 213 unsolved
Search for dead transitions found 22 dead transitions in 50712ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 159/317 places, 214/1276 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 141 transition count 208
Applied a total of 24 rules in 2 ms. Remains 141 /159 variables (removed 18) and now considering 208/214 (removed 6) transitions.
// Phase 1: matrix 208 rows 141 cols
[2024-05-27 07:21:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:21:32] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-27 07:21:32] [INFO ] Invariant cache hit.
[2024-05-27 07:21:32] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-27 07:21:33] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 141/317 places, 208/1276 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51461 ms. Remains : 141/317 places, 208/1276 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-02
Entered a terminal (fully accepting) state of product in 465 steps with 83 reset in 3 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-02 finished in 51621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 1276/1276 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 292 transition count 539
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 292 transition count 539
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 292 transition count 536
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 94 place count 251 transition count 495
Iterating global reduction 1 with 41 rules applied. Total rules applied 135 place count 251 transition count 495
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 170 place count 251 transition count 460
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 255 place count 166 transition count 375
Iterating global reduction 2 with 85 rules applied. Total rules applied 340 place count 166 transition count 375
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 440 place count 166 transition count 275
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 442 place count 164 transition count 245
Iterating global reduction 3 with 2 rules applied. Total rules applied 444 place count 164 transition count 245
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 445 place count 163 transition count 244
Iterating global reduction 3 with 1 rules applied. Total rules applied 446 place count 163 transition count 244
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 451 place count 158 transition count 239
Iterating global reduction 3 with 5 rules applied. Total rules applied 456 place count 158 transition count 239
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 471 place count 158 transition count 224
Applied a total of 471 rules in 42 ms. Remains 158 /317 variables (removed 159) and now considering 224/1276 (removed 1052) transitions.
// Phase 1: matrix 224 rows 158 cols
[2024-05-27 07:21:33] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:21:33] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-27 07:21:33] [INFO ] Invariant cache hit.
[2024-05-27 07:21:33] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-27 07:21:33] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-27 07:21:33] [INFO ] Redundant transitions in 11 ms returned []
Running 223 sub problems to find dead transitions.
[2024-05-27 07:21:33] [INFO ] Invariant cache hit.
[2024-05-27 07:21:33] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 224/382 variables, 158/160 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 85/245 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-05-27 07:21:37] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:21:37] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 0 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
[2024-05-27 07:21:37] [INFO ] Deduced a trap composed of 68 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:21:37] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:21:37] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 5/250 constraints. Problems are: Problem set: 20 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/250 constraints. Problems are: Problem set: 20 solved, 203 unsolved
[2024-05-27 07:21:41] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/382 variables, 1/251 constraints. Problems are: Problem set: 20 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/251 constraints. Problems are: Problem set: 20 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/382 variables, 0/251 constraints. Problems are: Problem set: 20 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 251 constraints, problems are : Problem set: 20 solved, 203 unsolved in 13404 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 20 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 20 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 20 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 1/2 constraints. Problems are: Problem set: 20 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 20 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 8/150 variables, 1/3 constraints. Problems are: Problem set: 20 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/3 constraints. Problems are: Problem set: 20 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 224/374 variables, 150/153 constraints. Problems are: Problem set: 20 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 85/238 constraints. Problems are: Problem set: 20 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 41/279 constraints. Problems are: Problem set: 20 solved, 203 unsolved
[2024-05-27 07:21:50] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:21:52] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 0 ms to minimize.
[2024-05-27 07:21:52] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
[2024-05-27 07:21:52] [INFO ] Deduced a trap composed of 60 places in 37 ms of which 1 ms to minimize.
[2024-05-27 07:21:52] [INFO ] Deduced a trap composed of 67 places in 38 ms of which 3 ms to minimize.
[2024-05-27 07:21:52] [INFO ] Deduced a trap composed of 60 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 6/285 constraints. Problems are: Problem set: 20 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/285 constraints. Problems are: Problem set: 20 solved, 203 unsolved
At refinement iteration 11 (OVERLAPS) 8/382 variables, 8/293 constraints. Problems are: Problem set: 20 solved, 203 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 162/455 constraints. Problems are: Problem set: 20 solved, 203 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 5/460 constraints. Problems are: Problem set: 20 solved, 203 unsolved
[2024-05-27 07:22:06] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
Problem TDEAD183 is UNSAT
[2024-05-27 07:22:06] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
Problem TDEAD187 is UNSAT
[2024-05-27 07:22:06] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:22:06] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:22:06] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-05-27 07:22:07] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 6/466 constraints. Problems are: Problem set: 22 solved, 201 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/382 variables, 0/466 constraints. Problems are: Problem set: 22 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/382 variables, and 466 constraints, problems are : Problem set: 22 solved, 201 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 158/158 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 203/223 constraints, Known Traps: 18/18 constraints]
After SMT, in 43707ms problems are : Problem set: 22 solved, 201 unsolved
Search for dead transitions found 22 dead transitions in 43709ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 158/317 places, 202/1276 transitions.
Graph (complete) has 507 edges and 158 vertex of which 140 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 140 transition count 196
Applied a total of 7 rules in 9 ms. Remains 140 /158 variables (removed 18) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 140 cols
[2024-05-27 07:22:17] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:22:17] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-27 07:22:17] [INFO ] Invariant cache hit.
[2024-05-27 07:22:17] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-27 07:22:17] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 140/317 places, 196/1276 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44475 ms. Remains : 140/317 places, 196/1276 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-03
Product exploration explored 100000 steps with 18352 reset in 239 ms.
Product exploration explored 100000 steps with 18511 reset in 205 ms.
Computed a total of 13 stabilizing places and 55 stable transitions
Graph (complete) has 487 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 55 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2416 steps (440 resets) in 27 ms. (86 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 217 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 196/196 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-27 07:22:18] [INFO ] Invariant cache hit.
[2024-05-27 07:22:18] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 07:22:18] [INFO ] Invariant cache hit.
[2024-05-27 07:22:18] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-27 07:22:19] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-05-27 07:22:19] [INFO ] Redundant transitions in 2 ms returned []
Running 195 sub problems to find dead transitions.
[2024-05-27 07:22:19] [INFO ] Invariant cache hit.
[2024-05-27 07:22:19] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/336 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 81/223 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-27 07:22:24] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/336 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 224 constraints, problems are : Problem set: 0 solved, 195 unsolved in 9928 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/336 variables, 140/143 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 81/224 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 195/419 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-27 07:22:34] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:22:34] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:22:34] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-05-27 07:22:35] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 423 constraints, problems are : Problem set: 0 solved, 195 unsolved in 16420 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 5/5 constraints]
After SMT, in 26619ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 26623ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26945 ms. Remains : 140/140 places, 196/196 transitions.
Computed a total of 13 stabilizing places and 55 stable transitions
Graph (complete) has 487 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 55 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 5310 steps (1016 resets) in 41 ms. (126 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 177 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 18414 reset in 152 ms.
Product exploration explored 100000 steps with 18211 reset in 158 ms.
Built C files in :
/tmp/ltsmin5348670926181465338
[2024-05-27 07:22:46] [INFO ] Computing symmetric may disable matrix : 196 transitions.
[2024-05-27 07:22:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:22:46] [INFO ] Computing symmetric may enable matrix : 196 transitions.
[2024-05-27 07:22:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:22:46] [INFO ] Computing Do-Not-Accords matrix : 196 transitions.
[2024-05-27 07:22:46] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:22:46] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5348670926181465338
Running compilation step : cd /tmp/ltsmin5348670926181465338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 572 ms.
Running link step : cd /tmp/ltsmin5348670926181465338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin5348670926181465338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13168101568262080131.hoa' '--buchi-type=spotba'
LTSmin run took 3100 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-03 finished in 77317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (!p0&&G(p1))))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 1276/1276 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 292 transition count 579
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 292 transition count 579
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 292 transition count 576
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 113 place count 232 transition count 516
Iterating global reduction 1 with 60 rules applied. Total rules applied 173 place count 232 transition count 516
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 251 place count 232 transition count 438
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 315 place count 168 transition count 374
Iterating global reduction 2 with 64 rules applied. Total rules applied 379 place count 168 transition count 374
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 471 place count 168 transition count 282
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 472 place count 167 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 473 place count 167 transition count 269
Applied a total of 473 rules in 35 ms. Remains 167 /317 variables (removed 150) and now considering 269/1276 (removed 1007) transitions.
// Phase 1: matrix 269 rows 167 cols
[2024-05-27 07:22:50] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:22:50] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-27 07:22:50] [INFO ] Invariant cache hit.
[2024-05-27 07:22:50] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-27 07:22:51] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-05-27 07:22:51] [INFO ] Redundant transitions in 6 ms returned []
Running 268 sub problems to find dead transitions.
[2024-05-27 07:22:51] [INFO ] Invariant cache hit.
[2024-05-27 07:22:51] [INFO ] State equation strengthened by 122 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/436 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 122/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-27 07:22:56] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:22:56] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 2/293 constraints. Problems are: Problem set: 11 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/293 constraints. Problems are: Problem set: 11 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 0/436 variables, 0/293 constraints. Problems are: Problem set: 11 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 293 constraints, problems are : Problem set: 11 solved, 257 unsolved in 11640 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 11 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 1/2 constraints. Problems are: Problem set: 11 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 11 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 4/162 variables, 1/3 constraints. Problems are: Problem set: 11 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 269/431 variables, 162/165 constraints. Problems are: Problem set: 11 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 122/287 constraints. Problems are: Problem set: 11 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 44/331 constraints. Problems are: Problem set: 11 solved, 257 unsolved
[2024-05-27 07:23:07] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:23:08] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-05-27 07:23:10] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:23:10] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 1 ms to minimize.
[2024-05-27 07:23:11] [INFO ] Deduced a trap composed of 60 places in 41 ms of which 1 ms to minimize.
[2024-05-27 07:23:11] [INFO ] Deduced a trap composed of 67 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 6/337 constraints. Problems are: Problem set: 11 solved, 257 unsolved
[2024-05-27 07:23:17] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 1/338 constraints. Problems are: Problem set: 11 solved, 257 unsolved
[2024-05-27 07:23:23] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 1/339 constraints. Problems are: Problem set: 11 solved, 257 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 0/339 constraints. Problems are: Problem set: 11 solved, 257 unsolved
SMT process timed out in 42038ms, After SMT, problems are : Problem set: 11 solved, 257 unsolved
Search for dead transitions found 11 dead transitions in 42043ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 167/317 places, 258/1276 transitions.
Graph (complete) has 595 edges and 167 vertex of which 158 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 158 transition count 255
Applied a total of 4 rules in 14 ms. Remains 158 /167 variables (removed 9) and now considering 255/258 (removed 3) transitions.
// Phase 1: matrix 255 rows 158 cols
[2024-05-27 07:23:33] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 07:23:33] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-27 07:23:33] [INFO ] Invariant cache hit.
[2024-05-27 07:23:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 07:23:33] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/317 places, 255/1276 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42953 ms. Remains : 158/317 places, 255/1276 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) p0), true, (NOT p1), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-05 finished in 43125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0)) U p1))))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 1276/1276 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 292 transition count 587
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 292 transition count 587
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 57 place count 292 transition count 580
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 117 place count 232 transition count 520
Iterating global reduction 1 with 60 rules applied. Total rules applied 177 place count 232 transition count 520
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 259 place count 232 transition count 438
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 323 place count 168 transition count 374
Iterating global reduction 2 with 64 rules applied. Total rules applied 387 place count 168 transition count 374
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 479 place count 168 transition count 282
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 480 place count 167 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 481 place count 167 transition count 269
Applied a total of 481 rules in 19 ms. Remains 167 /317 variables (removed 150) and now considering 269/1276 (removed 1007) transitions.
// Phase 1: matrix 269 rows 167 cols
[2024-05-27 07:23:33] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:23:33] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-27 07:23:33] [INFO ] Invariant cache hit.
[2024-05-27 07:23:33] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-27 07:23:34] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-27 07:23:34] [INFO ] Invariant cache hit.
[2024-05-27 07:23:34] [INFO ] State equation strengthened by 122 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/436 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 122/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 291 constraints, problems are : Problem set: 0 solved, 268 unsolved in 10544 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/436 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 122/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 268/559 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-27 07:23:52] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-27 07:23:52] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2024-05-27 07:23:52] [INFO ] Deduced a trap composed of 68 places in 38 ms of which 1 ms to minimize.
[2024-05-27 07:23:52] [INFO ] Deduced a trap composed of 68 places in 43 ms of which 1 ms to minimize.
[2024-05-27 07:23:52] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
[2024-05-27 07:23:55] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
[2024-05-27 07:23:55] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
[2024-05-27 07:23:55] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
Problem TDEAD232 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
[2024-05-27 07:23:56] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-05-27 07:23:56] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 10/569 constraints. Problems are: Problem set: 22 solved, 246 unsolved
[2024-05-27 07:24:03] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 1/570 constraints. Problems are: Problem set: 22 solved, 246 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/570 constraints. Problems are: Problem set: 22 solved, 246 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 570 constraints, problems are : Problem set: 22 solved, 246 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 11/11 constraints]
After SMT, in 40943ms problems are : Problem set: 22 solved, 246 unsolved
Search for dead transitions found 22 dead transitions in 40947ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 167/317 places, 247/1276 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 149 transition count 241
Applied a total of 24 rules in 2 ms. Remains 149 /167 variables (removed 18) and now considering 241/247 (removed 6) transitions.
// Phase 1: matrix 241 rows 149 cols
[2024-05-27 07:24:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:24:15] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-27 07:24:15] [INFO ] Invariant cache hit.
[2024-05-27 07:24:15] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-05-27 07:24:15] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/317 places, 241/1276 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41814 ms. Remains : 149/317 places, 241/1276 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-06
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-06 finished in 42029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 1276/1276 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 293 transition count 584
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 293 transition count 584
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 293 transition count 579
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 112 place count 234 transition count 520
Iterating global reduction 1 with 59 rules applied. Total rules applied 171 place count 234 transition count 520
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 250 place count 234 transition count 441
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 314 place count 170 transition count 377
Iterating global reduction 2 with 64 rules applied. Total rules applied 378 place count 170 transition count 377
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 466 place count 170 transition count 289
Applied a total of 466 rules in 21 ms. Remains 170 /317 variables (removed 147) and now considering 289/1276 (removed 987) transitions.
// Phase 1: matrix 289 rows 170 cols
[2024-05-27 07:24:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:24:15] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 07:24:15] [INFO ] Invariant cache hit.
[2024-05-27 07:24:15] [INFO ] State equation strengthened by 140 read => feed constraints.
[2024-05-27 07:24:16] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-27 07:24:16] [INFO ] Invariant cache hit.
[2024-05-27 07:24:16] [INFO ] State equation strengthened by 140 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/459 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 140/312 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-27 07:24:20] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:24:22] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-27 07:24:22] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-27 07:24:22] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-27 07:24:29] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/459 variables, 1/317 constraints. Problems are: Problem set: 10 solved, 278 unsolved
[2024-05-27 07:24:31] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 1/318 constraints. Problems are: Problem set: 20 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/318 constraints. Problems are: Problem set: 20 solved, 268 unsolved
At refinement iteration 11 (OVERLAPS) 0/459 variables, 0/318 constraints. Problems are: Problem set: 20 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 318 constraints, problems are : Problem set: 20 solved, 268 unsolved in 24044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 20 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 2/2 constraints. Problems are: Problem set: 20 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/2 constraints. Problems are: Problem set: 20 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 1/3 constraints. Problems are: Problem set: 20 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 20 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 8/162 variables, 1/4 constraints. Problems are: Problem set: 20 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/5 constraints. Problems are: Problem set: 20 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/5 constraints. Problems are: Problem set: 20 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 289/451 variables, 162/167 constraints. Problems are: Problem set: 20 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 140/307 constraints. Problems are: Problem set: 20 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 41/348 constraints. Problems are: Problem set: 20 solved, 268 unsolved
[2024-05-27 07:24:48] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:24:48] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 1 ms to minimize.
[2024-05-27 07:24:49] [INFO ] Deduced a trap composed of 60 places in 38 ms of which 0 ms to minimize.
[2024-05-27 07:24:49] [INFO ] Deduced a trap composed of 60 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 4/352 constraints. Problems are: Problem set: 20 solved, 268 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/352 constraints. Problems are: Problem set: 20 solved, 268 unsolved
At refinement iteration 12 (OVERLAPS) 8/459 variables, 8/360 constraints. Problems are: Problem set: 20 solved, 268 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 227/587 constraints. Problems are: Problem set: 20 solved, 268 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 3/590 constraints. Problems are: Problem set: 20 solved, 268 unsolved
[2024-05-27 07:25:09] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/459 variables, and 591 constraints, problems are : Problem set: 20 solved, 268 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 268/288 constraints, Known Traps: 11/11 constraints]
After SMT, in 54485ms problems are : Problem set: 20 solved, 268 unsolved
Search for dead transitions found 20 dead transitions in 54488ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 170/317 places, 269/1276 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 154 transition count 265
Applied a total of 20 rules in 2 ms. Remains 154 /170 variables (removed 16) and now considering 265/269 (removed 4) transitions.
// Phase 1: matrix 265 rows 154 cols
[2024-05-27 07:25:10] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:25:10] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-27 07:25:10] [INFO ] Invariant cache hit.
[2024-05-27 07:25:10] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-05-27 07:25:11] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 154/317 places, 265/1276 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55379 ms. Remains : 154/317 places, 265/1276 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 266 ms.
Product exploration explored 100000 steps with 50000 reset in 283 ms.
Computed a total of 15 stabilizing places and 77 stable transitions
Graph (complete) has 582 edges and 154 vertex of which 153 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 15 stabilizing places and 77 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-08 finished in 56028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 1276/1276 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 292 transition count 539
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 292 transition count 539
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 292 transition count 537
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 113 place count 231 transition count 476
Iterating global reduction 1 with 61 rules applied. Total rules applied 174 place count 231 transition count 476
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 240 place count 231 transition count 410
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 308 place count 163 transition count 342
Iterating global reduction 2 with 68 rules applied. Total rules applied 376 place count 163 transition count 342
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 456 place count 163 transition count 262
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 458 place count 161 transition count 236
Iterating global reduction 3 with 2 rules applied. Total rules applied 460 place count 161 transition count 236
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 461 place count 160 transition count 235
Iterating global reduction 3 with 1 rules applied. Total rules applied 462 place count 160 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 463 place count 160 transition count 234
Applied a total of 463 rules in 37 ms. Remains 160 /317 variables (removed 157) and now considering 234/1276 (removed 1042) transitions.
// Phase 1: matrix 234 rows 160 cols
[2024-05-27 07:25:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:25:11] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-27 07:25:11] [INFO ] Invariant cache hit.
[2024-05-27 07:25:11] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-27 07:25:12] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-27 07:25:12] [INFO ] Redundant transitions in 2 ms returned []
Running 233 sub problems to find dead transitions.
[2024-05-27 07:25:12] [INFO ] Invariant cache hit.
[2024-05-27 07:25:12] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/394 variables, 160/162 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 92/254 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 254 constraints, problems are : Problem set: 0 solved, 233 unsolved in 8365 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 234/394 variables, 160/162 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 92/254 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 233/487 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-27 07:25:25] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:25:25] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-27 07:25:26] [INFO ] Deduced a trap composed of 67 places in 41 ms of which 1 ms to minimize.
[2024-05-27 07:25:26] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-27 07:25:26] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
[2024-05-27 07:25:28] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:25:28] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
Problem TDEAD197 is UNSAT
[2024-05-27 07:25:29] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
[2024-05-27 07:25:29] [INFO ] Deduced a trap composed of 65 places in 39 ms of which 1 ms to minimize.
[2024-05-27 07:25:29] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:25:29] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 1 ms to minimize.
[2024-05-27 07:25:29] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 12/499 constraints. Problems are: Problem set: 22 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/499 constraints. Problems are: Problem set: 22 solved, 211 unsolved
[2024-05-27 07:25:38] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/394 variables, 1/500 constraints. Problems are: Problem set: 22 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/500 constraints. Problems are: Problem set: 22 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 500 constraints, problems are : Problem set: 22 solved, 211 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 160/160 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 13/13 constraints]
After SMT, in 38686ms problems are : Problem set: 22 solved, 211 unsolved
Search for dead transitions found 22 dead transitions in 38690ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 160/317 places, 212/1276 transitions.
Graph (complete) has 521 edges and 160 vertex of which 142 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 142 transition count 206
Applied a total of 7 rules in 11 ms. Remains 142 /160 variables (removed 18) and now considering 206/212 (removed 6) transitions.
// Phase 1: matrix 206 rows 142 cols
[2024-05-27 07:25:50] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:25:51] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-27 07:25:51] [INFO ] Invariant cache hit.
[2024-05-27 07:25:51] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-27 07:25:51] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 142/317 places, 206/1276 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39518 ms. Remains : 142/317 places, 206/1276 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-09 finished in 39624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1||X((G(p0) U p2))))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 1276/1276 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 293 transition count 540
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 293 transition count 540
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 293 transition count 537
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 91 place count 253 transition count 497
Iterating global reduction 1 with 40 rules applied. Total rules applied 131 place count 253 transition count 497
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 165 place count 253 transition count 463
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 250 place count 168 transition count 378
Iterating global reduction 2 with 85 rules applied. Total rules applied 335 place count 168 transition count 378
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 435 place count 168 transition count 278
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 437 place count 166 transition count 248
Iterating global reduction 3 with 2 rules applied. Total rules applied 439 place count 166 transition count 248
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 440 place count 165 transition count 247
Iterating global reduction 3 with 1 rules applied. Total rules applied 441 place count 165 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 442 place count 165 transition count 246
Applied a total of 442 rules in 15 ms. Remains 165 /317 variables (removed 152) and now considering 246/1276 (removed 1030) transitions.
// Phase 1: matrix 246 rows 165 cols
[2024-05-27 07:25:51] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:25:51] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 07:25:51] [INFO ] Invariant cache hit.
[2024-05-27 07:25:51] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-27 07:25:51] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2024-05-27 07:25:51] [INFO ] Invariant cache hit.
[2024-05-27 07:25:51] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/411 variables, 165/167 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 100/267 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-27 07:25:56] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2024-05-27 07:25:56] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
[2024-05-27 07:25:56] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD93 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 3/270 constraints. Problems are: Problem set: 17 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/270 constraints. Problems are: Problem set: 17 solved, 228 unsolved
[2024-05-27 07:26:01] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/411 variables, 1/271 constraints. Problems are: Problem set: 22 solved, 223 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/271 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/411 variables, 0/271 constraints. Problems are: Problem set: 22 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 271 constraints, problems are : Problem set: 22 solved, 223 unsolved in 16408 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 22 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 1/1 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/1 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 8/155 variables, 1/2 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 246/401 variables, 155/157 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 100/257 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 39/296 constraints. Problems are: Problem set: 22 solved, 223 unsolved
[2024-05-27 07:26:14] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
[2024-05-27 07:26:14] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 0 ms to minimize.
[2024-05-27 07:26:14] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:26:14] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 0 ms to minimize.
[2024-05-27 07:26:14] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 5/301 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/301 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 10/411 variables, 10/311 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 184/495 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 4/499 constraints. Problems are: Problem set: 22 solved, 223 unsolved
[2024-05-27 07:26:27] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:26:27] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 2/501 constraints. Problems are: Problem set: 22 solved, 223 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/411 variables, 0/501 constraints. Problems are: Problem set: 22 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 501 constraints, problems are : Problem set: 22 solved, 223 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 165/165 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 223/245 constraints, Known Traps: 11/11 constraints]
After SMT, in 46767ms problems are : Problem set: 22 solved, 223 unsolved
Search for dead transitions found 22 dead transitions in 46769ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 165/317 places, 224/1276 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 147 transition count 218
Applied a total of 24 rules in 2 ms. Remains 147 /165 variables (removed 18) and now considering 218/224 (removed 6) transitions.
// Phase 1: matrix 218 rows 147 cols
[2024-05-27 07:26:38] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:26:38] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 07:26:38] [INFO ] Invariant cache hit.
[2024-05-27 07:26:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-27 07:26:38] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/317 places, 218/1276 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47567 ms. Remains : 147/317 places, 218/1276 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-10
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-10 finished in 47780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 1276/1276 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 291 transition count 542
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 291 transition count 542
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 291 transition count 537
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 118 place count 230 transition count 476
Iterating global reduction 1 with 61 rules applied. Total rules applied 179 place count 230 transition count 476
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 247 place count 230 transition count 408
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 315 place count 162 transition count 340
Iterating global reduction 2 with 68 rules applied. Total rules applied 383 place count 162 transition count 340
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 463 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 465 place count 160 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 467 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 468 place count 159 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 469 place count 159 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 470 place count 159 transition count 232
Applied a total of 470 rules in 36 ms. Remains 159 /317 variables (removed 158) and now considering 232/1276 (removed 1044) transitions.
// Phase 1: matrix 232 rows 159 cols
[2024-05-27 07:26:39] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:26:39] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-27 07:26:39] [INFO ] Invariant cache hit.
[2024-05-27 07:26:39] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-27 07:26:39] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2024-05-27 07:26:39] [INFO ] Redundant transitions in 2 ms returned []
Running 231 sub problems to find dead transitions.
[2024-05-27 07:26:39] [INFO ] Invariant cache hit.
[2024-05-27 07:26:39] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/391 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 91/252 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-27 07:26:43] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
[2024-05-27 07:26:44] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD206 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 2/254 constraints. Problems are: Problem set: 13 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/254 constraints. Problems are: Problem set: 13 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/391 variables, 0/254 constraints. Problems are: Problem set: 13 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 254 constraints, problems are : Problem set: 13 solved, 218 unsolved in 9631 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 13 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 1/1 constraints. Problems are: Problem set: 13 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 13 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 4/152 variables, 1/2 constraints. Problems are: Problem set: 13 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 13 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 232/384 variables, 152/154 constraints. Problems are: Problem set: 13 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 91/245 constraints. Problems are: Problem set: 13 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 42/287 constraints. Problems are: Problem set: 13 solved, 218 unsolved
[2024-05-27 07:26:53] [INFO ] Deduced a trap composed of 56 places in 34 ms of which 1 ms to minimize.
[2024-05-27 07:26:54] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:26:54] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:26:55] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 0 ms to minimize.
[2024-05-27 07:26:55] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 5/292 constraints. Problems are: Problem set: 13 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 0/292 constraints. Problems are: Problem set: 13 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 7/391 variables, 7/299 constraints. Problems are: Problem set: 13 solved, 218 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 176/475 constraints. Problems are: Problem set: 13 solved, 218 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 2/477 constraints. Problems are: Problem set: 13 solved, 218 unsolved
[2024-05-27 07:27:07] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:27:07] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-05-27 07:27:07] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:27:07] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 0 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
[2024-05-27 07:27:09] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:27:09] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/391 variables, 6/483 constraints. Problems are: Problem set: 22 solved, 209 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/391 variables, 0/483 constraints. Problems are: Problem set: 22 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/391 variables, and 483 constraints, problems are : Problem set: 22 solved, 209 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 218/231 constraints, Known Traps: 13/13 constraints]
After SMT, in 40015ms problems are : Problem set: 22 solved, 209 unsolved
Search for dead transitions found 22 dead transitions in 40019ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 159/317 places, 210/1276 transitions.
Graph (complete) has 517 edges and 159 vertex of which 141 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 141 transition count 204
Applied a total of 7 rules in 5 ms. Remains 141 /159 variables (removed 18) and now considering 204/210 (removed 6) transitions.
// Phase 1: matrix 204 rows 141 cols
[2024-05-27 07:27:19] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:27:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-27 07:27:19] [INFO ] Invariant cache hit.
[2024-05-27 07:27:19] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-27 07:27:19] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 141/317 places, 204/1276 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40803 ms. Remains : 141/317 places, 204/1276 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-11
Product exploration explored 100000 steps with 20448 reset in 162 ms.
Product exploration explored 100000 steps with 20480 reset in 169 ms.
Computed a total of 4 stabilizing places and 24 stable transitions
Graph (complete) has 497 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 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 24 ms :[p0]
RANDOM walk for 6403 steps (1319 resets) in 34 ms. (182 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[p0]
Stuttering acceptance computed with spot in 37 ms :[p0]
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 204/204 transitions.
Applied a total of 0 rules in 7 ms. Remains 141 /141 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-27 07:27:20] [INFO ] Invariant cache hit.
[2024-05-27 07:27:20] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-27 07:27:20] [INFO ] Invariant cache hit.
[2024-05-27 07:27:20] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-27 07:27:20] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-27 07:27:20] [INFO ] Redundant transitions in 1 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-27 07:27:20] [INFO ] Invariant cache hit.
[2024-05-27 07:27:20] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/345 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 87/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/345 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 230 constraints, problems are : Problem set: 0 solved, 203 unsolved in 6532 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/345 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 87/230 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 203/433 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-27 07:27:31] [INFO ] Deduced a trap composed of 52 places in 35 ms of which 1 ms to minimize.
[2024-05-27 07:27:33] [INFO ] Deduced a trap composed of 51 places in 38 ms of which 1 ms to minimize.
[2024-05-27 07:27:33] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 1 ms to minimize.
[2024-05-27 07:27:33] [INFO ] Deduced a trap composed of 51 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/345 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 437 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18089 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 4/4 constraints]
After SMT, in 24876ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 24879ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25169 ms. Remains : 141/141 places, 204/204 transitions.
Computed a total of 4 stabilizing places and 24 stable transitions
Graph (complete) has 497 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 4 stabilizing places and 24 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 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 31 ms :[p0]
RANDOM walk for 1941 steps (371 resets) in 9 ms. (194 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 90 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 29 ms :[p0]
Stuttering acceptance computed with spot in 32 ms :[p0]
Stuttering acceptance computed with spot in 26 ms :[p0]
Product exploration explored 100000 steps with 20509 reset in 163 ms.
Product exploration explored 100000 steps with 20542 reset in 177 ms.
Built C files in :
/tmp/ltsmin10525767120231003146
[2024-05-27 07:27:46] [INFO ] Computing symmetric may disable matrix : 204 transitions.
[2024-05-27 07:27:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:27:46] [INFO ] Computing symmetric may enable matrix : 204 transitions.
[2024-05-27 07:27:46] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:27:46] [INFO ] Computing Do-Not-Accords matrix : 204 transitions.
[2024-05-27 07:27:46] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:27:46] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10525767120231003146
Running compilation step : cd /tmp/ltsmin10525767120231003146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 530 ms.
Running link step : cd /tmp/ltsmin10525767120231003146;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10525767120231003146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5067210903325681635.hoa' '--buchi-type=spotba'
LTSmin run took 5623 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-11 finished in 73514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F((!p1||X(p2))) U p3)&&p0)))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 1276/1276 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 292 transition count 583
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 292 transition count 583
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 292 transition count 578
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 115 place count 232 transition count 518
Iterating global reduction 1 with 60 rules applied. Total rules applied 175 place count 232 transition count 518
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 255 place count 232 transition count 438
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 319 place count 168 transition count 374
Iterating global reduction 2 with 64 rules applied. Total rules applied 383 place count 168 transition count 374
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 471 place count 168 transition count 286
Applied a total of 471 rules in 21 ms. Remains 168 /317 variables (removed 149) and now considering 286/1276 (removed 990) transitions.
// Phase 1: matrix 286 rows 168 cols
[2024-05-27 07:27:52] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:27:52] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-27 07:27:52] [INFO ] Invariant cache hit.
[2024-05-27 07:27:52] [INFO ] State equation strengthened by 139 read => feed constraints.
[2024-05-27 07:27:53] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2024-05-27 07:27:53] [INFO ] Redundant transitions in 3 ms returned []
Running 285 sub problems to find dead transitions.
[2024-05-27 07:27:53] [INFO ] Invariant cache hit.
[2024-05-27 07:27:53] [INFO ] State equation strengthened by 139 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 286/454 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 139/309 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-27 07:28:02] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
Problem TDEAD249 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 7 (OVERLAPS) 0/454 variables, 1/310 constraints. Problems are: Problem set: 2 solved, 283 unsolved
[2024-05-27 07:28:04] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:28:04] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:28:05] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-27 07:28:05] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
Problem TDEAD255 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 4/314 constraints. Problems are: Problem set: 11 solved, 274 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/314 constraints. Problems are: Problem set: 11 solved, 274 unsolved
[2024-05-27 07:28:11] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 10 (OVERLAPS) 0/454 variables, 1/315 constraints. Problems are: Problem set: 21 solved, 264 unsolved
[2024-05-27 07:28:13] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 1/316 constraints. Problems are: Problem set: 21 solved, 264 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/316 constraints. Problems are: Problem set: 21 solved, 264 unsolved
At refinement iteration 13 (OVERLAPS) 0/454 variables, 0/316 constraints. Problems are: Problem set: 21 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 316 constraints, problems are : Problem set: 21 solved, 264 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 21 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 2/2 constraints. Problems are: Problem set: 21 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 21 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 1/151 variables, 1/3 constraints. Problems are: Problem set: 21 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/3 constraints. Problems are: Problem set: 21 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 8/159 variables, 1/4 constraints. Problems are: Problem set: 21 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/4 constraints. Problems are: Problem set: 21 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 286/445 variables, 159/163 constraints. Problems are: Problem set: 21 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 139/302 constraints. Problems are: Problem set: 21 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 40/342 constraints. Problems are: Problem set: 21 solved, 264 unsolved
[2024-05-27 07:28:28] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2024-05-27 07:28:30] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:28:30] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:28:30] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:28:30] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 5/347 constraints. Problems are: Problem set: 21 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/347 constraints. Problems are: Problem set: 21 solved, 264 unsolved
At refinement iteration 11 (OVERLAPS) 9/454 variables, 9/356 constraints. Problems are: Problem set: 21 solved, 264 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 224/580 constraints. Problems are: Problem set: 21 solved, 264 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 5/585 constraints. Problems are: Problem set: 21 solved, 264 unsolved
[2024-05-27 07:28:53] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
Problem TDEAD245 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 586 constraints, problems are : Problem set: 22 solved, 263 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 264/285 constraints, Known Traps: 13/13 constraints]
After SMT, in 60435ms problems are : Problem set: 22 solved, 263 unsolved
Search for dead transitions found 22 dead transitions in 60440ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 168/317 places, 264/1276 transitions.
Graph (complete) has 585 edges and 168 vertex of which 150 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 150 transition count 258
Applied a total of 7 rules in 10 ms. Remains 150 /168 variables (removed 18) and now considering 258/264 (removed 6) transitions.
// Phase 1: matrix 258 rows 150 cols
[2024-05-27 07:28:53] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:28:53] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-27 07:28:53] [INFO ] Invariant cache hit.
[2024-05-27 07:28:53] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-27 07:28:53] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 150/317 places, 258/1276 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61310 ms. Remains : 150/317 places, 258/1276 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) (NOT p3)))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-12 finished in 61478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 1276/1276 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 290 transition count 497
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 290 transition count 497
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 290 transition count 494
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 119 place count 228 transition count 432
Iterating global reduction 1 with 62 rules applied. Total rules applied 181 place count 228 transition count 432
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 235 place count 228 transition count 378
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 307 place count 156 transition count 306
Iterating global reduction 2 with 72 rules applied. Total rules applied 379 place count 156 transition count 306
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 447 place count 156 transition count 238
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 449 place count 154 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 451 place count 154 transition count 212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 452 place count 153 transition count 211
Iterating global reduction 3 with 1 rules applied. Total rules applied 453 place count 153 transition count 211
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 457 place count 149 transition count 207
Iterating global reduction 3 with 4 rules applied. Total rules applied 461 place count 149 transition count 207
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 469 place count 149 transition count 199
Applied a total of 469 rules in 20 ms. Remains 149 /317 variables (removed 168) and now considering 199/1276 (removed 1077) transitions.
// Phase 1: matrix 199 rows 149 cols
[2024-05-27 07:28:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:28:54] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-27 07:28:54] [INFO ] Invariant cache hit.
[2024-05-27 07:28:54] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 07:28:54] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-27 07:28:54] [INFO ] Invariant cache hit.
[2024-05-27 07:28:54] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/149 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/348 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 67/218 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-27 07:28:57] [INFO ] Deduced a trap composed of 68 places in 46 ms of which 1 ms to minimize.
[2024-05-27 07:28:57] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 2/220 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/220 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 0/348 variables, 0/220 constraints. Problems are: Problem set: 10 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 220 constraints, problems are : Problem set: 10 solved, 188 unsolved in 8086 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 10 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 2/3 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 4/145 variables, 1/4 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 199/344 variables, 145/149 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 67/216 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 45/261 constraints. Problems are: Problem set: 10 solved, 188 unsolved
[2024-05-27 07:29:05] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-05-27 07:29:06] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:29:06] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
[2024-05-27 07:29:06] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2024-05-27 07:29:07] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 0 ms to minimize.
[2024-05-27 07:29:07] [INFO ] Deduced a trap composed of 60 places in 41 ms of which 0 ms to minimize.
[2024-05-27 07:29:07] [INFO ] Deduced a trap composed of 60 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 7/268 constraints. Problems are: Problem set: 10 solved, 188 unsolved
[2024-05-27 07:29:09] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 1/269 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 0/269 constraints. Problems are: Problem set: 10 solved, 188 unsolved
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
At refinement iteration 12 (OVERLAPS) 4/348 variables, 4/273 constraints. Problems are: Problem set: 12 solved, 186 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 143/416 constraints. Problems are: Problem set: 12 solved, 186 unsolved
[2024-05-27 07:29:18] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
[2024-05-27 07:29:18] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-05-27 07:29:18] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 1 ms to minimize.
[2024-05-27 07:29:18] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 0 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
[2024-05-27 07:29:20] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:29:20] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 6/422 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/348 variables, 0/422 constraints. Problems are: Problem set: 22 solved, 176 unsolved
At refinement iteration 16 (OVERLAPS) 0/348 variables, 0/422 constraints. Problems are: Problem set: 22 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 422 constraints, problems are : Problem set: 22 solved, 176 unsolved in 29737 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 149/149 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 188/198 constraints, Known Traps: 16/16 constraints]
After SMT, in 38052ms problems are : Problem set: 22 solved, 176 unsolved
Search for dead transitions found 22 dead transitions in 38054ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 149/317 places, 177/1276 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 131 transition count 171
Applied a total of 24 rules in 3 ms. Remains 131 /149 variables (removed 18) and now considering 171/177 (removed 6) transitions.
// Phase 1: matrix 171 rows 131 cols
[2024-05-27 07:29:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:29:32] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-27 07:29:32] [INFO ] Invariant cache hit.
[2024-05-27 07:29:32] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-27 07:29:32] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 131/317 places, 171/1276 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38692 ms. Remains : 131/317 places, 171/1276 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-14
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-14 finished in 38775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G(!p1)))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 1276/1276 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 293 transition count 628
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 293 transition count 628
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 55 place count 293 transition count 621
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 114 place count 234 transition count 562
Iterating global reduction 1 with 59 rules applied. Total rules applied 173 place count 234 transition count 562
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 267 place count 234 transition count 468
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 327 place count 174 transition count 408
Iterating global reduction 2 with 60 rules applied. Total rules applied 387 place count 174 transition count 408
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 483 place count 174 transition count 312
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 484 place count 173 transition count 299
Iterating global reduction 3 with 1 rules applied. Total rules applied 485 place count 173 transition count 299
Applied a total of 485 rules in 29 ms. Remains 173 /317 variables (removed 144) and now considering 299/1276 (removed 977) transitions.
// Phase 1: matrix 299 rows 173 cols
[2024-05-27 07:29:32] [INFO ] Computed 2 invariants in 4 ms
[2024-05-27 07:29:33] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-27 07:29:33] [INFO ] Invariant cache hit.
[2024-05-27 07:29:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-27 07:29:33] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-05-27 07:29:33] [INFO ] Redundant transitions in 2 ms returned []
Running 298 sub problems to find dead transitions.
[2024-05-27 07:29:33] [INFO ] Invariant cache hit.
[2024-05-27 07:29:33] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 299/472 variables, 173/175 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 147/322 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-05-27 07:29:38] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:29:38] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-27 07:29:39] [INFO ] Deduced a trap composed of 69 places in 40 ms of which 1 ms to minimize.
[2024-05-27 07:29:39] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 1 ms to minimize.
[2024-05-27 07:29:40] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 5/327 constraints. Problems are: Problem set: 10 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 0/327 constraints. Problems are: Problem set: 10 solved, 288 unsolved
[2024-05-27 07:29:45] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2024-05-27 07:29:45] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/472 variables, 2/329 constraints. Problems are: Problem set: 20 solved, 278 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/329 constraints. Problems are: Problem set: 20 solved, 278 unsolved
At refinement iteration 10 (OVERLAPS) 0/472 variables, 0/329 constraints. Problems are: Problem set: 20 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 329 constraints, problems are : Problem set: 20 solved, 278 unsolved in 21531 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 20 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 20 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 20 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 1/2 constraints. Problems are: Problem set: 20 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 20 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 8/165 variables, 1/3 constraints. Problems are: Problem set: 20 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/3 constraints. Problems are: Problem set: 20 solved, 278 unsolved
At refinement iteration 6 (OVERLAPS) 299/464 variables, 165/168 constraints. Problems are: Problem set: 20 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 147/315 constraints. Problems are: Problem set: 20 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 41/356 constraints. Problems are: Problem set: 20 solved, 278 unsolved
[2024-05-27 07:30:03] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:30:04] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
[2024-05-27 07:30:04] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:30:04] [INFO ] Deduced a trap composed of 60 places in 38 ms of which 1 ms to minimize.
[2024-05-27 07:30:04] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 5/361 constraints. Problems are: Problem set: 20 solved, 278 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 0/361 constraints. Problems are: Problem set: 20 solved, 278 unsolved
At refinement iteration 11 (OVERLAPS) 8/472 variables, 8/369 constraints. Problems are: Problem set: 20 solved, 278 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 237/606 constraints. Problems are: Problem set: 20 solved, 278 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 6/612 constraints. Problems are: Problem set: 20 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/472 variables, and 612 constraints, problems are : Problem set: 20 solved, 278 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 278/298 constraints, Known Traps: 12/12 constraints]
After SMT, in 51994ms problems are : Problem set: 20 solved, 278 unsolved
Search for dead transitions found 20 dead transitions in 51997ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 173/317 places, 279/1276 transitions.
Graph (complete) has 615 edges and 173 vertex of which 157 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 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 157 transition count 275
Applied a total of 5 rules in 8 ms. Remains 157 /173 variables (removed 16) and now considering 275/279 (removed 4) transitions.
// Phase 1: matrix 275 rows 157 cols
[2024-05-27 07:30:25] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:30:25] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 07:30:25] [INFO ] Invariant cache hit.
[2024-05-27 07:30:25] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-27 07:30:25] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 157/317 places, 275/1276 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52918 ms. Remains : 157/317 places, 275/1276 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m005-LTLFireability-15
Product exploration explored 100000 steps with 18007 reset in 210 ms.
Product exploration explored 100000 steps with 18149 reset in 223 ms.
Computed a total of 12 stabilizing places and 70 stable transitions
Graph (complete) has 599 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) p1), p1]
RANDOM walk for 40000 steps (7232 resets) in 113 ms. (350 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1248 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
[2024-05-27 07:30:26] [INFO ] Invariant cache hit.
[2024-05-27 07:30:26] [INFO ] State equation strengthened by 143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 199/267 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 67/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 432/432 variables, and 226 constraints, problems are : Problem set: 1 solved, 0 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 67/143 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 213 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p1]
Stuttering acceptance computed with spot in 29 ms :[p1]
Support contains 2 out of 157 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 : 157/157 places, 275/275 transitions.
Applied a total of 0 rules in 12 ms. Remains 157 /157 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2024-05-27 07:30:27] [INFO ] Invariant cache hit.
[2024-05-27 07:30:27] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-27 07:30:27] [INFO ] Invariant cache hit.
[2024-05-27 07:30:27] [INFO ] State equation strengthened by 143 read => feed constraints.
[2024-05-27 07:30:27] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-05-27 07:30:27] [INFO ] Redundant transitions in 2 ms returned []
Running 274 sub problems to find dead transitions.
[2024-05-27 07:30:27] [INFO ] Invariant cache hit.
[2024-05-27 07:30:27] [INFO ] State equation strengthened by 143 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/432 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 143/302 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-27 07:30:33] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-27 07:30:33] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 304 constraints, problems are : Problem set: 0 solved, 274 unsolved in 13083 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 275/432 variables, 157/161 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 143/304 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 274/578 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-27 07:30:47] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-27 07:30:50] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 0 ms to minimize.
[2024-05-27 07:30:50] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 1 ms to minimize.
[2024-05-27 07:30:50] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 0 ms to minimize.
[2024-05-27 07:30:50] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 5/583 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 10 (OVERLAPS) 0/432 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 583 constraints, problems are : Problem set: 0 solved, 274 unsolved in 29697 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 143/143 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 7/7 constraints]
After SMT, in 43183ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 43189ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43655 ms. Remains : 157/157 places, 275/275 transitions.
Computed a total of 12 stabilizing places and 70 stable transitions
Graph (complete) has 599 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 70 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p1]
RANDOM walk for 3235 steps (582 resets) in 13 ms. (231 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 87 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 :[p1]
Stuttering acceptance computed with spot in 38 ms :[p1]
Stuttering acceptance computed with spot in 35 ms :[p1]
Product exploration explored 100000 steps with 18025 reset in 200 ms.
Product exploration explored 100000 steps with 18205 reset in 207 ms.
Built C files in :
/tmp/ltsmin15310893633772619486
[2024-05-27 07:31:11] [INFO ] Computing symmetric may disable matrix : 275 transitions.
[2024-05-27 07:31:11] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:31:11] [INFO ] Computing symmetric may enable matrix : 275 transitions.
[2024-05-27 07:31:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:31:11] [INFO ] Computing Do-Not-Accords matrix : 275 transitions.
[2024-05-27 07:31:11] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 07:31:11] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15310893633772619486
Running compilation step : cd /tmp/ltsmin15310893633772619486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 715 ms.
Running link step : cd /tmp/ltsmin15310893633772619486;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15310893633772619486;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1106422787794938935.hoa' '--buchi-type=spotba'
LTSmin run took 6840 ms.
FORMULA RingSingleMessageInMbox-PT-d1m005-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RingSingleMessageInMbox-PT-d1m005-LTLFireability-15 finished in 106207 ms.
All properties solved by simple procedures.
Total runtime 790859 ms.

BK_STOP 1716795079183

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-d1m005"
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-5568"
echo " Executing tool itstools"
echo " Input is RingSingleMessageInMbox-PT-d1m005, 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 r334-tall-171679079500060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m005.tgz
mv RingSingleMessageInMbox-PT-d1m005 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;