About the Execution of ITS-Tools for RingSingleMessageInMbox-PT-d1m160
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFFFFFFT?FFFF?F | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889264200452.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is RingSingleMessageInMbox-PT-d1m160, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889264200452
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.8M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749087457976
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-d1m160
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 01:37:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 01:37:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 01:37:39] [INFO ] Load time of PNML (sax parser for PT used): 453 ms
[2025-06-05 01:37:39] [INFO ] Transformed 6690 places.
[2025-06-05 01:37:39] [INFO ] Transformed 11934 transitions.
[2025-06-05 01:37:39] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 615 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 4305 places in 28 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 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 1091 places :
Symmetric choice reduction at 1 with 1091 rule applications. Total rules 1210 place count 1277 transition count 5701
Iterating global reduction 1 with 1091 rules applied. Total rules applied 2301 place count 1277 transition count 5701
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 216 transitions.
Iterating post reduction 1 with 216 rules applied. Total rules applied 2517 place count 1277 transition count 5485
Discarding 927 places :
Symmetric choice reduction at 2 with 927 rule applications. Total rules 3444 place count 350 transition count 4558
Iterating global reduction 2 with 927 rules applied. Total rules applied 4371 place count 350 transition count 4558
Ensure Unique test removed 3568 transitions
Reduce isomorphic transitions removed 3568 transitions.
Iterating post reduction 2 with 3568 rules applied. Total rules applied 7939 place count 350 transition count 990
Discarding 82 places :
Symmetric choice reduction at 3 with 82 rule applications. Total rules 8021 place count 268 transition count 908
Iterating global reduction 3 with 82 rules applied. Total rules applied 8103 place count 268 transition count 908
Ensure Unique test removed 166 transitions
Reduce isomorphic transitions removed 166 transitions.
Iterating post reduction 3 with 166 rules applied. Total rules applied 8269 place count 268 transition count 742
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 8277 place count 260 transition count 734
Iterating global reduction 4 with 8 rules applied. Total rules applied 8285 place count 260 transition count 734
Applied a total of 8285 rules in 554 ms. Remains 260 /2385 variables (removed 2125) and now considering 734/11934 (removed 11200) transitions.
// Phase 1: matrix 734 rows 260 cols
[2025-06-05 01:37:40] [INFO ] Computed 3 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:37:40] [INFO ] Implicit Places using invariants in 382 ms returned []
[2025-06-05 01:37:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:37:41] [INFO ] State equation strengthened by 497 read => feed constraints.
[2025-06-05 01:37:43] [INFO ] Implicit Places using invariants and state equation in 2076 ms returned []
Implicit Place search using SMT with State Equation took 2486 ms to find 0 implicit places.
Running 733 sub problems to find dead transitions.
[2025-06-05 01:37:43] [INFO ] Invariant cache hit.
[2025-06-05 01:37:43] [INFO ] State equation strengthened by 497 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 733 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 733 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 733 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 733 unsolved
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
At refinement iteration 4 (OVERLAPS) 734/994 variables, 260/263 constraints. Problems are: Problem set: 24 solved, 709 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/994 variables, 497/760 constraints. Problems are: Problem set: 24 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 994/994 variables, and 760 constraints, problems are : Problem set: 24 solved, 709 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 260/260 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 733/733 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 709 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 709 unsolved
At refinement iteration 1 (OVERLAPS) 17/252 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 709 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 709 unsolved
At refinement iteration 3 (OVERLAPS) 8/260 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 709 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 709 unsolved
At refinement iteration 5 (OVERLAPS) 734/994 variables, 260/263 constraints. Problems are: Problem set: 24 solved, 709 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/994 variables, 497/760 constraints. Problems are: Problem set: 24 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 994/994 variables, and 1469 constraints, problems are : Problem set: 24 solved, 709 unsolved in 30330 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 260/260 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 709/733 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61591ms problems are : Problem set: 24 solved, 709 unsolved
Search for dead transitions found 24 dead transitions in 61608ms
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 : 260/2385 places, 710/11934 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 237 transition count 699
Applied a total of 34 rules in 7 ms. Remains 237 /260 variables (removed 23) and now considering 699/710 (removed 11) transitions.
// Phase 1: matrix 699 rows 237 cols
[2025-06-05 01:38:44] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:38:44] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-05 01:38:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:38:44] [INFO ] State equation strengthened by 493 read => feed constraints.
[2025-06-05 01:38:46] [INFO ] Implicit Places using invariants and state equation in 2072 ms returned []
Implicit Place search using SMT with State Equation took 2192 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 237/2385 places, 699/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66875 ms. Remains : 237/2385 places, 699/11934 transitions.
Support contains 25 out of 237 places after structural reductions.
[2025-06-05 01:38:47] [INFO ] Flatten gal took : 70 ms
[2025-06-05 01:38:47] [INFO ] Flatten gal took : 39 ms
[2025-06-05 01:38:47] [INFO ] Input system was already deterministic with 699 transitions.
Support contains 24 out of 237 places (down from 25) after GAL structural reductions.
RANDOM walk for 40000 steps (6966 resets) in 1945 ms. (20 steps per ms) remains 2/20 properties
BEST_FIRST walk for 40003 steps (1496 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1451 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
[2025-06-05 01:38:47] [INFO ] Invariant cache hit.
[2025-06-05 01:38:47] [INFO ] State equation strengthened by 493 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 229/247 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 57/304 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 35/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/308 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 625/933 variables, 171/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 479/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/933 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 15 (OVERLAPS) 3/936 variables, 3/732 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:38:48] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 13 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 1/733 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/936 variables, 0/733 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/936 variables, 0/733 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 936/936 variables, and 733 constraints, problems are : Problem set: 1 solved, 1 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, ReadFeed: 493/493 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 218/227 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 7/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/289 variables, 1/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 30/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/293 variables, 1/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 1/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 639/932 variables, 188/243 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/932 variables, 486/729 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/932 variables, 1/730 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:38:49] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/932 variables, 1/731 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/932 variables, 0/731 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/936 variables, 4/735 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/936 variables, 0/735 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/936 variables, 0/735 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 936/936 variables, and 735 constraints, problems are : Problem set: 1 solved, 1 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, ReadFeed: 493/493 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1381ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 731 steps, including 24 resets, run visited all 1 properties in 10 ms. (steps per millisecond=73 )
Parikh walk visited 1 properties in 15 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 41 stabilizing places and 247 stable transitions
Graph (complete) has 1179 edges and 237 vertex of which 235 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(X(p1))))))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 699/699 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 236 transition count 698
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 221 transition count 380
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 221 transition count 380
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 47 place count 206 transition count 365
Iterating global reduction 1 with 15 rules applied. Total rules applied 62 place count 206 transition count 365
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 206 transition count 360
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 111 place count 162 transition count 316
Iterating global reduction 2 with 44 rules applied. Total rules applied 155 place count 162 transition count 316
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 211 place count 162 transition count 260
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 212 place count 161 transition count 247
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 161 transition count 247
Applied a total of 213 rules in 12 ms. Remains 161 /237 variables (removed 76) and now considering 247/699 (removed 452) transitions.
// Phase 1: matrix 247 rows 161 cols
[2025-06-05 01:38:49] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:38:49] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-05 01:38:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:38:49] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-06-05 01:38:50] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2025-06-05 01:38:50] [INFO ] Invariant cache hit.
[2025-06-05 01:38:50] [INFO ] State equation strengthened by 105 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 247/408 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 105/268 constraints. Problems are: Problem set: 0 solved, 246 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (OVERLAPS) 0/408 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 268 constraints, problems are : Problem set: 0 solved, 246 unsolved in 15799 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 247/408 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 105/268 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 246/514 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:39:22] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:39:22] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 3 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:39:22] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 4 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:39:27] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 4 ms to minimize.
Problem TDEAD210 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:39:28] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:39:28] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 6/520 constraints. Problems are: Problem set: 22 solved, 224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/408 variables, and 520 constraints, problems are : Problem set: 22 solved, 224 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46025ms problems are : Problem set: 22 solved, 224 unsolved
Search for dead transitions found 22 dead transitions in 46028ms
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 : 161/237 places, 225/699 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 143 transition count 219
Applied a total of 24 rules in 2 ms. Remains 143 /161 variables (removed 18) and now considering 219/225 (removed 6) transitions.
// Phase 1: matrix 219 rows 143 cols
[2025-06-05 01:39:36] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:39:36] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-05 01:39:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:39:36] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-05 01:39:37] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 143/237 places, 219/699 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47868 ms. Remains : 143/237 places, 219/699 transitions.
Stuttering acceptance computed with spot in 302 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-01
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-01 finished in 48223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U G(p1))))'
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 699/699 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 236 transition count 698
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 222 transition count 385
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 222 transition count 385
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 44 place count 208 transition count 371
Iterating global reduction 1 with 14 rules applied. Total rules applied 58 place count 208 transition count 371
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 62 place count 208 transition count 367
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 106 place count 164 transition count 323
Iterating global reduction 2 with 44 rules applied. Total rules applied 150 place count 164 transition count 323
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 206 place count 164 transition count 267
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 207 place count 163 transition count 254
Iterating global reduction 3 with 1 rules applied. Total rules applied 208 place count 163 transition count 254
Applied a total of 208 rules in 17 ms. Remains 163 /237 variables (removed 74) and now considering 254/699 (removed 445) transitions.
// Phase 1: matrix 254 rows 163 cols
[2025-06-05 01:39:37] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:39:37] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-05 01:39:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:39:37] [INFO ] State equation strengthened by 110 read => feed constraints.
[2025-06-05 01:39:38] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-06-05 01:39:38] [INFO ] Invariant cache hit.
[2025-06-05 01:39:38] [INFO ] State equation strengthened by 110 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 254/417 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 110/275 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:39:46] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 3 ms to minimize.
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 1/276 constraints. Problems are: Problem set: 10 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/276 constraints. Problems are: Problem set: 10 solved, 243 unsolved
At refinement iteration 8 (OVERLAPS) 0/417 variables, 0/276 constraints. Problems are: Problem set: 10 solved, 243 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 276 constraints, problems are : Problem set: 10 solved, 243 unsolved in 24667 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 243 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 243 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 10 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 10 solved, 243 unsolved
At refinement iteration 4 (OVERLAPS) 4/159 variables, 1/3 constraints. Problems are: Problem set: 10 solved, 243 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 10 solved, 243 unsolved
At refinement iteration 6 (OVERLAPS) 254/413 variables, 159/162 constraints. Problems are: Problem set: 10 solved, 243 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 110/272 constraints. Problems are: Problem set: 10 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 45/317 constraints. Problems are: Problem set: 10 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:40:13] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 1/318 constraints. Problems are: Problem set: 10 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:40:19] [INFO ] Deduced a trap along path composed of 9 places in 34 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 1/319 constraints. Problems are: Problem set: 10 solved, 243 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:40:30] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:40:30] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:40:31] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 3/322 constraints. Problems are: Problem set: 10 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/417 variables, and 322 constraints, problems are : Problem set: 10 solved, 243 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/163 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 45/253 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 54897ms problems are : Problem set: 10 solved, 243 unsolved
Search for dead transitions found 10 dead transitions in 54899ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 163/237 places, 244/699 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 155 transition count 242
Applied a total of 10 rules in 3 ms. Remains 155 /163 variables (removed 8) and now considering 242/244 (removed 2) transitions.
// Phase 1: matrix 242 rows 155 cols
[2025-06-05 01:40:33] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:40:33] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-05 01:40:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:40:33] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-05 01:40:34] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/237 places, 242/699 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57050 ms. Remains : 155/237 places, 242/699 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-03 finished in 57371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((!p1&&F(p2)))))'
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 699/699 transitions.
Graph (complete) has 1179 edges and 237 vertex of which 236 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 236 transition count 698
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 223 transition count 444
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 223 transition count 444
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 41 place count 210 transition count 431
Iterating global reduction 1 with 13 rules applied. Total rules applied 54 place count 210 transition count 431
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 61 place count 210 transition count 424
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 97 place count 174 transition count 388
Iterating global reduction 2 with 36 rules applied. Total rules applied 133 place count 174 transition count 388
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 205 place count 174 transition count 316
Applied a total of 205 rules in 60 ms. Remains 174 /237 variables (removed 63) and now considering 316/699 (removed 383) transitions.
// Phase 1: matrix 316 rows 174 cols
[2025-06-05 01:40:35] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:40:35] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-05 01:40:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:40:35] [INFO ] State equation strengthened by 164 read => feed constraints.
[2025-06-05 01:40:37] [INFO ] Implicit Places using invariants and state equation in 2023 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:40:37] [INFO ] Redundant transitions in 21 ms returned []
Running 315 sub problems to find dead transitions.
[2025-06-05 01:40:37] [INFO ] Invariant cache hit.
[2025-06-05 01:40:37] [INFO ] State equation strengthened by 164 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/490 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 164/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 0/490 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 340 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/174 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/490 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 164/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 315/655 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:41:31] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 2 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:41:32] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 3 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:41:33] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 4 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 658 constraints, problems are : Problem set: 12 solved, 303 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/174 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60280ms problems are : Problem set: 12 solved, 303 unsolved
Search for dead transitions found 12 dead transitions in 60281ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 174/237 places, 304/699 transitions.
Graph (complete) has 656 edges and 174 vertex of which 166 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 162 transition count 300
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 162 transition count 300
Applied a total of 9 rules in 17 ms. Remains 162 /174 variables (removed 12) and now considering 300/304 (removed 4) transitions.
// Phase 1: matrix 300 rows 162 cols
[2025-06-05 01:41:37] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:41:37] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-05 01:41:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:41:37] [INFO ] State equation strengthened by 160 read => feed constraints.
[2025-06-05 01:41:38] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 162/237 places, 300/699 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63297 ms. Remains : 162/237 places, 300/699 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) p1), true, (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-04 finished in 63449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 699/699 transitions.
Graph (complete) has 1179 edges and 237 vertex of which 236 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 236 transition count 698
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 220 transition count 354
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 220 transition count 354
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 50 place count 204 transition count 338
Iterating global reduction 1 with 16 rules applied. Total rules applied 66 place count 204 transition count 338
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 70 place count 204 transition count 334
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 118 place count 156 transition count 286
Iterating global reduction 2 with 48 rules applied. Total rules applied 166 place count 156 transition count 286
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 214 place count 156 transition count 238
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 216 place count 154 transition count 212
Iterating global reduction 3 with 2 rules applied. Total rules applied 218 place count 154 transition count 212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 219 place count 153 transition count 211
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 153 transition count 211
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 224 place count 149 transition count 207
Iterating global reduction 3 with 4 rules applied. Total rules applied 228 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 236 place count 149 transition count 199
Applied a total of 236 rules in 42 ms. Remains 149 /237 variables (removed 88) and now considering 199/699 (removed 500) transitions.
// Phase 1: matrix 199 rows 149 cols
[2025-06-05 01:41:38] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:41:38] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-05 01:41:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:41:38] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-05 01:41:39] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:41:39] [INFO ] Redundant transitions in 2 ms returned []
Running 198 sub problems to find dead transitions.
[2025-06-05 01:41:39] [INFO ] Invariant cache hit.
[2025-06-05 01:41:39] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:41:44] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 3 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, 1/219 constraints. Problems are: Problem set: 10 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/219 constraints. Problems are: Problem set: 10 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:41:50] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:41:50] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:41:50] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:41:50] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/348 variables, 4/223 constraints. Problems are: Problem set: 10 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:41:52] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 4 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
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 1/224 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 0/224 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 11 (OVERLAPS) 0/348 variables, 0/224 constraints. Problems are: Problem set: 20 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 224 constraints, problems are : Problem set: 20 solved, 178 unsolved in 21412 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: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/1 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 3 (OVERLAPS) 8/141 variables, 1/2 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/4 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 199/340 variables, 141/145 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 67/212 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 41/253 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/253 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 8/348 variables, 8/261 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 137/398 constraints. Problems are: Problem set: 20 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/348 variables, 4/402 constraints. Problems are: Problem set: 20 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:42:19] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:42:22] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 3 ms to minimize.
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 2/404 constraints. Problems are: Problem set: 22 solved, 176 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/348 variables, and 404 constraints, problems are : Problem set: 22 solved, 176 unsolved in 30016 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: 178/198 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51522ms problems are : Problem set: 22 solved, 176 unsolved
Search for dead transitions found 22 dead transitions in 51524ms
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 : 149/237 places, 177/699 transitions.
Graph (complete) has 465 edges and 149 vertex of which 131 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 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 131 transition count 171
Applied a total of 7 rules in 8 ms. Remains 131 /149 variables (removed 18) and now considering 171/177 (removed 6) transitions.
// Phase 1: matrix 171 rows 131 cols
[2025-06-05 01:42:30] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:42:30] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-05 01:42:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:42:30] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-06-05 01:42:31] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 131/237 places, 171/699 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52878 ms. Remains : 131/237 places, 171/699 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-05
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-05 finished in 52943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(X(X(X((p1||F(p0)))))))))'
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 699/699 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 236 transition count 698
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 221 transition count 380
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 221 transition count 380
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 47 place count 206 transition count 365
Iterating global reduction 1 with 15 rules applied. Total rules applied 62 place count 206 transition count 365
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 206 transition count 360
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 111 place count 162 transition count 316
Iterating global reduction 2 with 44 rules applied. Total rules applied 155 place count 162 transition count 316
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 211 place count 162 transition count 260
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 213 place count 160 transition count 234
Iterating global reduction 3 with 2 rules applied. Total rules applied 215 place count 160 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 216 place count 159 transition count 233
Iterating global reduction 3 with 1 rules applied. Total rules applied 217 place count 159 transition count 233
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 221 place count 155 transition count 229
Iterating global reduction 3 with 4 rules applied. Total rules applied 225 place count 155 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 237 place count 155 transition count 217
Applied a total of 237 rules in 21 ms. Remains 155 /237 variables (removed 82) and now considering 217/699 (removed 482) transitions.
// Phase 1: matrix 217 rows 155 cols
[2025-06-05 01:42:31] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:42:31] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-05 01:42:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:42:31] [INFO ] State equation strengthened by 80 read => feed constraints.
[2025-06-05 01:42:32] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-05 01:42:32] [INFO ] Invariant cache hit.
[2025-06-05 01:42:32] [INFO ] State equation strengthened by 80 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 237 constraints, problems are : Problem set: 0 solved, 216 unsolved in 12991 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/372 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 216/453 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:42:58] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:42:59] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 3 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:42:59] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 3 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:43:03] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 3 ms to minimize.
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:43:03] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:43:04] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 6/459 constraints. Problems are: Problem set: 22 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 459 constraints, problems are : Problem set: 22 solved, 194 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43150ms problems are : Problem set: 22 solved, 194 unsolved
Search for dead transitions found 22 dead transitions in 43152ms
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 : 155/237 places, 195/699 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 137 transition count 189
Applied a total of 24 rules in 2 ms. Remains 137 /155 variables (removed 18) and now considering 189/195 (removed 6) transitions.
// Phase 1: matrix 189 rows 137 cols
[2025-06-05 01:43:15] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:43:15] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-05 01:43:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:43:15] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-05 01:43:16] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 137/237 places, 189/699 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44637 ms. Remains : 137/237 places, 189/699 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-06 finished in 44913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X((!p0||X(X(X(X(!p0))))))&&G(!p1))||G((!p0||X(X(X(X(!p0)))))))))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 699/699 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 236 transition count 698
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 222 transition count 410
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 222 transition count 410
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 44 place count 208 transition count 396
Iterating global reduction 1 with 14 rules applied. Total rules applied 58 place count 208 transition count 396
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 208 transition count 390
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 104 place count 168 transition count 350
Iterating global reduction 2 with 40 rules applied. Total rules applied 144 place count 168 transition count 350
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 208 place count 168 transition count 286
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 209 place count 167 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 167 transition count 273
Applied a total of 210 rules in 11 ms. Remains 167 /237 variables (removed 70) and now considering 273/699 (removed 426) transitions.
// Phase 1: matrix 273 rows 167 cols
[2025-06-05 01:43:16] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:43:16] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-05 01:43:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:43:16] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-06-05 01:43:18] [INFO ] Implicit Places using invariants and state equation in 1396 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2025-06-05 01:43:18] [INFO ] Invariant cache hit.
[2025-06-05 01:43:18] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/440 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 126/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 295 constraints, problems are : Problem set: 0 solved, 272 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/440 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 126/295 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 272/567 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:44:01] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 3 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:44:01] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 3 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:44:02] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 4 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 570 constraints, problems are : Problem set: 12 solved, 260 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50234ms problems are : Problem set: 12 solved, 260 unsolved
Search for dead transitions found 12 dead transitions in 50236ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 167/237 places, 261/699 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 159 transition count 261
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 155 transition count 257
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 155 transition count 257
Applied a total of 16 rules in 6 ms. Remains 155 /167 variables (removed 12) and now considering 257/261 (removed 4) transitions.
// Phase 1: matrix 257 rows 155 cols
[2025-06-05 01:44:08] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:44:08] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-05 01:44:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:44:08] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-05 01:44:09] [INFO ] Implicit Places using invariants and state equation in 1579 ms returned []
Implicit Place search using SMT with State Equation took 1658 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/237 places, 257/699 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53392 ms. Remains : 155/237 places, 257/699 transitions.
Stuttering acceptance computed with spot in 9235 ms :[p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-09
Product exploration explored 100000 steps with 26817 reset in 350 ms.
Product exploration explored 100000 steps with 26760 reset in 325 ms.
Computed a total of 12 stabilizing places and 61 stable transitions
Graph (complete) has 578 edges and 155 vertex of which 154 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 12 stabilizing places and 61 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 30064 ms. Reduced automaton from 120 states, 404 edges and 2 AP (stutter sensitive) to 120 states, 404 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 8805 ms :[p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0]
RANDOM walk for 40000 steps (7245 resets) in 286 ms. (139 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1197 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
[2025-06-05 01:44:58] [INFO ] Invariant cache hit.
[2025-06-05 01:44:58] [INFO ] State equation strengthened by 122 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 408/412 variables, and 181 constraints, problems are : Problem set: 1 solved, 0 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 151/155 constraints, ReadFeed: 30/122 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p1), (F p0)]
Error Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--tgba' '--small' '--given-formula=(!p1&&!p0)' '--given-formula=X(!(p1&&p0))' '--given-formula=X(!(!p1&&p0))' '--given-formula=X(!p0)' '--given-formula=X(!p1)' '--given-formula=X(X(!(p1&&p0)))' '--given-formula=X(X(!(!p1&&p0)))' '--given-formula=X(X(!p0))' '--given-formula=X(X(!p1))' '--given-formula=G((!p0||!p1))' '-F' '/tmp/b4k10572052942673077078.hoa' '--given-strategy=minato' killed by timeout after 10 SECONDS
Error Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--tgba' '--small' '--given-formula=(!p1&&!p0&&X(!(p1&&p0))&&X(!(!p1&&p0))&&X(!p0)&&X(!p1)&&X(X(!(p1&&p0)))&&X(X(!(!p1&&p0)))&&X(X(!p0))&&X(X(!p1))&&G((!p0||!p1)))' '-F' '/tmp/b4k2590831144937882055.hoa' '--given-strategy=minato' killed by timeout after 10 SECONDS
Error Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--tgba' '--small' '--given-formula=(!p1&&!p0&&X(!(p1&&p0))&&X(!(!p1&&p0))&&X(!p0)&&X(!p1)&&X(X(!(p1&&p0)))&&X(X(!(!p1&&p0)))&&X(X(!p0))&&X(X(!p1))&&G((!p0||!p1)))' '-F' '/tmp/b4k5605546466274199985.hoa' '--given-strategy=minato' killed by timeout after 10 SECONDS
Error Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--tgba' '--small' '--given-formula=(!p1&&!p0&&X(!(p1&&p0))&&X(!(!p1&&p0))&&X(!p0)&&X(!p1)&&X(X(!(p1&&p0)))&&X(X(!(!p1&&p0)))&&X(X(!p0))&&X(X(!p1))&&G((!p0||!p1)))' '-F' '/tmp/b4k13811850568206908530.hoa' '--given-strategy=all' killed by timeout after 10 SECONDS
Knowledge based reduction with 10 factoid took 43163 ms. Reduced automaton from 120 states, 404 edges and 2 AP (stutter sensitive) to 120 states, 404 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 8798 ms :[p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 8791 ms :[p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0]
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 257/257 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2025-06-05 01:45:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:45:59] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-05 01:45:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:45:59] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-05 01:46:01] [INFO ] Implicit Places using invariants and state equation in 1540 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2025-06-05 01:46:01] [INFO ] Invariant cache hit.
[2025-06-05 01:46:01] [INFO ] State equation strengthened by 122 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
At refinement iteration 3 (OVERLAPS) 257/412 variables, 155/156 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 122/278 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/278 constraints. Problems are: Problem set: 4 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/412 variables, 0/278 constraints. Problems are: Problem set: 4 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 278 constraints, problems are : Problem set: 4 solved, 252 unsolved in 20579 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 257/408 variables, 151/152 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 122/274 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 41/315 constraints. Problems are: Problem set: 4 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:46:30] [INFO ] Deduced a trap along path composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 1/316 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/316 constraints. Problems are: Problem set: 4 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 4/412 variables, 4/320 constraints. Problems are: Problem set: 4 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/412 variables, and 531 constraints, problems are : Problem set: 4 solved, 252 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 252/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50887ms problems are : Problem set: 4 solved, 252 unsolved
Search for dead transitions found 4 dead transitions in 50891ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/155 places, 253/257 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 151 transition count 249
Applied a total of 8 rules in 4 ms. Remains 151 /155 variables (removed 4) and now considering 249/253 (removed 4) transitions.
// Phase 1: matrix 249 rows 151 cols
[2025-06-05 01:46:52] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:46:52] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-05 01:46:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:46:52] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-05 01:46:52] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/155 places, 249/257 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53160 ms. Remains : 151/155 places, 249/257 transitions.
Computed a total of 12 stabilizing places and 61 stable transitions
Graph (complete) has 562 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 12 stabilizing places and 61 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 30072 ms. Reduced automaton from 120 states, 404 edges and 2 AP (stutter sensitive) to 120 states, 404 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 8913 ms :[p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0]
RANDOM walk for 40000 steps (7335 resets) in 148 ms. (268 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1216 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
[2025-06-05 01:47:32] [INFO ] Invariant cache hit.
[2025-06-05 01:47:32] [INFO ] State equation strengthened by 122 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 177/244 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 50/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 400/400 variables, and 203 constraints, problems are : Problem set: 1 solved, 0 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 50/122 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p1), (F p0)]
Error Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--tgba' '--small' '--given-formula=(!p1&&!p0)' '--given-formula=X(!(p0&&!p1))' '--given-formula=X(!p0)' '--given-formula=X(!p1)' '--given-formula=X(!(p0&&p1))' '--given-formula=X(X(!(p0&&!p1)))' '--given-formula=X(X(!p0))' '--given-formula=X(X(!p1))' '--given-formula=X(X(!(p0&&p1)))' '--given-formula=G((!p0||!p1))' '-F' '/tmp/b4k13961728373170434432.hoa' '--given-strategy=minato' killed by timeout after 10 SECONDS
Error Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--tgba' '--small' '--given-formula=(!p1&&!p0&&X(!(p0&&!p1))&&X(!p0)&&X(!p1)&&X(!(p0&&p1))&&X(X(!(p0&&!p1)))&&X(X(!p0))&&X(X(!p1))&&X(X(!(p0&&p1)))&&G((!p0||!p1)))' '-F' '/tmp/b4k16051212151431372034.hoa' '--given-strategy=minato' killed by timeout after 10 SECONDS
Error Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--tgba' '--small' '--given-formula=(!p1&&!p0&&X(!(p0&&!p1))&&X(!p0)&&X(!p1)&&X(!(p0&&p1))&&X(X(!(p0&&!p1)))&&X(X(!p0))&&X(X(!p1))&&X(X(!(p0&&p1)))&&G((!p0||!p1)))' '-F' '/tmp/b4k11696831665453923517.hoa' '--given-strategy=minato' killed by timeout after 10 SECONDS
Error Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/autfilt-linux64' '--check=stutter' '--hoaf=tv' '--tgba' '--small' '--given-formula=(!p1&&!p0&&X(!(p0&&!p1))&&X(!p0)&&X(!p1)&&X(!(p0&&p1))&&X(X(!(p0&&!p1)))&&X(X(!p0))&&X(X(!p1))&&X(X(!(p0&&p1)))&&G((!p0||!p1)))' '-F' '/tmp/b4k8953024292009445950.hoa' '--given-strategy=all' killed by timeout after 10 SECONDS
Knowledge based reduction with 10 factoid took 43178 ms. Reduced automaton from 120 states, 404 edges and 2 AP (stutter sensitive) to 120 states, 404 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 8834 ms :[p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 9036 ms :[p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 8854 ms :[p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), (AND p1 p0), p0, p0, p0, p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), (AND p1 p0), p0, p0, (AND p1 p0), p0, p0, (AND p1 p0), p0, (AND p1 p0), p0, p0, (AND p1 p0), p0]
Product exploration explored 100000 steps with 26512 reset in 280 ms.
Product exploration explored 100000 steps with 26574 reset in 286 ms.
java.io.IOException: java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/autstates.py' '/tmp/curaut18334023051276930016.hoa' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:511)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:417)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:282)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Caused by: java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/autstates.py' '/tmp/curaut18334023051276930016.hoa' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:141)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:115)
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:509)
... 18 more
Built C files in :
/tmp/ltsmin14193085691613616881
[2025-06-05 01:48:52] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14193085691613616881
Running compilation step : cd /tmp/ltsmin14193085691613616881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 498 ms.
Running link step : cd /tmp/ltsmin14193085691613616881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14193085691613616881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6665597699489740199.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 249/249 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 249/249 (removed 0) transitions.
[2025-06-05 01:49:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:49:08] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-05 01:49:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:49:08] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-05 01:49:08] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2025-06-05 01:49:08] [INFO ] Invariant cache hit.
[2025-06-05 01:49:08] [INFO ] State equation strengthened by 122 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/400 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 122/275 constraints. Problems are: Problem set: 0 solved, 248 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 275 constraints, problems are : Problem set: 0 solved, 248 unsolved in 16304 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/400 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 122/275 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 248/523 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:49:47] [INFO ] Deduced a trap along path composed of 9 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/400 variables, and 524 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46492ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 46494ms
Finished structural reductions in LTL mode , in 1 iterations and 47099 ms. Remains : 151/151 places, 249/249 transitions.
Built C files in :
/tmp/ltsmin9412234297526429589
[2025-06-05 01:49:55] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9412234297526429589
Running compilation step : cd /tmp/ltsmin9412234297526429589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 370 ms.
Running link step : cd /tmp/ltsmin9412234297526429589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9412234297526429589;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4749057379388462967.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 01:50:10] [INFO ] Flatten gal took : 13 ms
[2025-06-05 01:50:10] [INFO ] Flatten gal took : 12 ms
[2025-06-05 01:50:10] [INFO ] Time to serialize gal into /tmp/LTL6238424581439005594.gal : 2 ms
[2025-06-05 01:50:10] [INFO ] Time to serialize properties into /tmp/LTL11067550991185957554.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6238424581439005594.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16182914778993405756.hoa' '-atoms' '/tmp/LTL11067550991185957554.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11067550991185957554.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16182914778993405756.hoa
Detected timeout of ITS tools.
[2025-06-05 01:50:25] [INFO ] Flatten gal took : 11 ms
[2025-06-05 01:50:25] [INFO ] Flatten gal took : 10 ms
[2025-06-05 01:50:25] [INFO ] Time to serialize gal into /tmp/LTL391131215984303245.gal : 2 ms
[2025-06-05 01:50:25] [INFO ] Time to serialize properties into /tmp/LTL13541813803861711482.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL391131215984303245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13541813803861711482.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(("((s1<1)||(l3931<1))")||(X(X(X(X("((s1<1)||(l3931<1))")))))))||((X(("((s1<1)||(l3931<1))")||(X(X(X(X("((s1<1)||(l3931<1))")))...191
Formula 0 simplified : G(F(!"((s1<1)||(l3931<1))" & XXXX!"((s1<1)||(l3931<1))") & (X(!"((s1<1)||(l3931<1))" & XXXX!"((s1<1)||(l3931<1))") | F!"((s1<1)||(l3...165
Detected timeout of ITS tools.
[2025-06-05 01:50:40] [INFO ] Flatten gal took : 13 ms
[2025-06-05 01:50:40] [INFO ] Applying decomposition
[2025-06-05 01:50:40] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8012421731299705474.txt' '-o' '/tmp/graph8012421731299705474.bin' '-w' '/tmp/graph8012421731299705474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8012421731299705474.bin' '-l' '-1' '-v' '-w' '/tmp/graph8012421731299705474.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:50:40] [INFO ] Decomposing Gal with order
[2025-06-05 01:50:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:50:40] [INFO ] Removed a total of 240 redundant transitions.
[2025-06-05 01:50:40] [INFO ] Flatten gal took : 68 ms
[2025-06-05 01:50:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 165 labels/synchronizations in 9 ms.
[2025-06-05 01:50:40] [INFO ] Time to serialize gal into /tmp/LTL15453928263686123098.gal : 3 ms
[2025-06-05 01:50:40] [INFO ] Time to serialize properties into /tmp/LTL14333949170399889251.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15453928263686123098.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14333949170399889251.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G(("((i0.u0.s1<1)||(u14.l3931<1))")||(X(X(X(X("((i0.u0.s1<1)||(u14.l3931<1))")))))))||((X(("((i0.u0.s1<1)||(u14.l3931<1))")||(X(...241
Formula 0 simplified : G(F(!"((i0.u0.s1<1)||(u14.l3931<1))" & XXXX!"((i0.u0.s1<1)||(u14.l3931<1))") & (X(!"((i0.u0.s1<1)||(u14.l3931<1))" & XXXX!"((i0.u0.s...215
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-09 finished in 459337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G(!p0)))) U (p1&&X(X(X(G(!p0))))))))'
Support contains 5 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 699/699 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 236 transition count 698
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 223 transition count 415
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 223 transition count 415
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 41 place count 210 transition count 402
Iterating global reduction 1 with 13 rules applied. Total rules applied 54 place count 210 transition count 402
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 59 place count 210 transition count 397
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 99 place count 170 transition count 357
Iterating global reduction 2 with 40 rules applied. Total rules applied 139 place count 170 transition count 357
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 203 place count 170 transition count 293
Applied a total of 203 rules in 14 ms. Remains 170 /237 variables (removed 67) and now considering 293/699 (removed 406) transitions.
// Phase 1: matrix 293 rows 170 cols
[2025-06-05 01:50:55] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:50:55] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-05 01:50:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:50:56] [INFO ] State equation strengthened by 144 read => feed constraints.
[2025-06-05 01:50:56] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2025-06-05 01:50:56] [INFO ] Invariant cache hit.
[2025-06-05 01:50:56] [INFO ] State equation strengthened by 144 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 293/463 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 144/316 constraints. Problems are: Problem set: 0 solved, 292 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 316 constraints, problems are : Problem set: 0 solved, 292 unsolved in 23829 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 293/463 variables, 170/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 144/316 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 292/608 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:36] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 3 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:38] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 3 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:38] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 4 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:47] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 4 ms to minimize.
Problem TDEAD256 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:48] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:48] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 6/614 constraints. Problems are: Problem set: 22 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 614 constraints, problems are : Problem set: 22 solved, 270 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54056ms problems are : Problem set: 22 solved, 270 unsolved
Search for dead transitions found 22 dead transitions in 54057ms
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 : 170/237 places, 271/699 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 152 transition count 265
Applied a total of 24 rules in 2 ms. Remains 152 /170 variables (removed 18) and now considering 265/271 (removed 6) transitions.
// Phase 1: matrix 265 rows 152 cols
[2025-06-05 01:51:50] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:51:50] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-05 01:51:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:51:50] [INFO ] State equation strengthened by 140 read => feed constraints.
[2025-06-05 01:51:51] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/237 places, 265/699 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55695 ms. Remains : 152/237 places, 265/699 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, p0, p0, true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-10
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m160-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-10 finished in 55911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((F(!p1)||G(!p0)))))))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 699/699 transitions.
Graph (complete) has 1179 edges and 237 vertex of which 236 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 236 transition count 698
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 220 transition count 354
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 220 transition count 354
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 50 place count 204 transition count 338
Iterating global reduction 1 with 16 rules applied. Total rules applied 66 place count 204 transition count 338
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 70 place count 204 transition count 334
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 118 place count 156 transition count 286
Iterating global reduction 2 with 48 rules applied. Total rules applied 166 place count 156 transition count 286
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 214 place count 156 transition count 238
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 217 place count 153 transition count 199
Iterating global reduction 3 with 3 rules applied. Total rules applied 220 place count 153 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 222 place count 151 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 224 place count 151 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 225 place count 151 transition count 196
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 229 place count 147 transition count 192
Iterating global reduction 4 with 4 rules applied. Total rules applied 233 place count 147 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 237 place count 147 transition count 188
Applied a total of 237 rules in 31 ms. Remains 147 /237 variables (removed 90) and now considering 188/699 (removed 511) transitions.
// Phase 1: matrix 188 rows 147 cols
[2025-06-05 01:51:51] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:51:51] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-05 01:51:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:51:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-05 01:51:52] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:51:52] [INFO ] Redundant transitions in 4 ms returned []
Running 187 sub problems to find dead transitions.
[2025-06-05 01:51:52] [INFO ] Invariant cache hit.
[2025-06-05 01:51:52] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (OVERLAPS) 188/335 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 57/206 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:56] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:56] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:57] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 3 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:58] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 3 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:58] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 4 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:51:58] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 6/212 constraints. Problems are: Problem set: 22 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/212 constraints. Problems are: Problem set: 22 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/335 variables, 0/212 constraints. Problems are: Problem set: 22 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 212 constraints, problems are : Problem set: 22 solved, 165 unsolved in 23026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 22 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 22 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 8/137 variables, 1/2 constraints. Problems are: Problem set: 22 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 22 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 188/325 variables, 137/139 constraints. Problems are: Problem set: 22 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 57/196 constraints. Problems are: Problem set: 22 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 39/235 constraints. Problems are: Problem set: 22 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/235 constraints. Problems are: Problem set: 22 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 10/335 variables, 10/245 constraints. Problems are: Problem set: 22 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 126/371 constraints. Problems are: Problem set: 22 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/335 variables, 6/377 constraints. Problems are: Problem set: 22 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 01:52:37] [INFO ] Deduced a trap along path composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/335 variables, 1/378 constraints. Problems are: Problem set: 22 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 378 constraints, problems are : Problem set: 22 solved, 165 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 165/187 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53138ms problems are : Problem set: 22 solved, 165 unsolved
Search for dead transitions found 22 dead transitions in 53140ms
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 : 147/237 places, 166/699 transitions.
Graph (complete) has 451 edges and 147 vertex of which 129 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 129 transition count 160
Applied a total of 7 rules in 5 ms. Remains 129 /147 variables (removed 18) and now considering 160/166 (removed 6) transitions.
// Phase 1: matrix 160 rows 129 cols
[2025-06-05 01:52:45] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:52:45] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-05 01:52:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:52:45] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-05 01:52:46] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 129/237 places, 160/699 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54413 ms. Remains : 129/237 places, 160/699 transitions.
Stuttering acceptance computed with spot in 175 ms :[p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m160-LTLFireability-14
Product exploration explored 100000 steps with 37342 reset in 203 ms.
Product exploration explored 100000 steps with 37199 reset in 232 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Graph (complete) has 431 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[p0, p0, (AND p0 p1), (AND p0 p1), false]
RANDOM walk for 40000 steps (8374 resets) in 133 ms. (298 steps per ms) remains 1/5 properties
BEST_FIRST walk for 17684 steps (658 resets) in 41 ms. (421 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 235 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[p0, p0, (AND p0 p1), (AND p0 p1), false]
Stuttering acceptance computed with spot in 175 ms :[p0, p0, (AND p0 p1), (AND p0 p1), false]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 160/160 transitions.
Applied a total of 0 rules in 9 ms. Remains 129 /129 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2025-06-05 01:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:52:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-05 01:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:52:47] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-05 01:52:48] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:52:48] [INFO ] Redundant transitions in 2 ms returned []
Running 159 sub problems to find dead transitions.
[2025-06-05 01:52:48] [INFO ] Invariant cache hit.
[2025-06-05 01:52:48] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 184 constraints, problems are : Problem set: 0 solved, 159 unsolved in 10128 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 159/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 343 constraints, problems are : Problem set: 0 solved, 159 unsolved in 27451 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37653ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 37654ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38149 ms. Remains : 129/129 places, 160/160 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Graph (complete) has 431 edges and 129 vertex of which 128 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 121 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[p0, p0, (AND p0 p1), (AND p0 p1), false]
RANDOM walk for 40000 steps (8413 resets) in 118 ms. (336 steps per ms) remains 1/5 properties
BEST_FIRST walk for 18079 steps (652 resets) in 24 ms. (723 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 274 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[p0, p0, (AND p0 p1), (AND p0 p1), false]
Stuttering acceptance computed with spot in 220 ms :[p0, p0, (AND p0 p1), (AND p0 p1), false]
Stuttering acceptance computed with spot in 190 ms :[p0, p0, (AND p0 p1), (AND p0 p1), false]
Product exploration explored 100000 steps with 37270 reset in 184 ms.
Product exploration explored 100000 steps with 37262 reset in 266 ms.
Built C files in :
/tmp/ltsmin14568888969196609454
[2025-06-05 01:53:27] [INFO ] Computing symmetric may disable matrix : 160 transitions.
[2025-06-05 01:53:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:53:27] [INFO ] Computing symmetric may enable matrix : 160 transitions.
[2025-06-05 01:53:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:53:27] [INFO ] Computing Do-Not-Accords matrix : 160 transitions.
[2025-06-05 01:53:27] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:53:27] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14568888969196609454
Running compilation step : cd /tmp/ltsmin14568888969196609454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 323 ms.
Running link step : cd /tmp/ltsmin14568888969196609454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14568888969196609454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17175548388507823634.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 160/160 transitions.
Applied a total of 0 rules in 14 ms. Remains 129 /129 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2025-06-05 01:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:53:42] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-05 01:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 01:53:42] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-05 01:53:43] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 01:53:43] [INFO ] Redundant transitions in 1 ms returned []
Running 159 sub problems to find dead transitions.
[2025-06-05 01:53:43] [INFO ] Invariant cache hit.
[2025-06-05 01:53:43] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 184 constraints, problems are : Problem set: 0 solved, 159 unsolved in 10034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 159/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 343 constraints, problems are : Problem set: 0 solved, 159 unsolved in 27328 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37432ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 37433ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37900 ms. Remains : 129/129 places, 160/160 transitions.
Built C files in :
/tmp/ltsmin16888712546863450591
[2025-06-05 01:54:20] [INFO ] Computing symmetric may disable matrix : 160 transitions.
[2025-06-05 01:54:20] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:54:20] [INFO ] Computing symmetric may enable matrix : 160 transitions.
[2025-06-05 01:54:20] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:54:20] [INFO ] Computing Do-Not-Accords matrix : 160 transitions.
[2025-06-05 01:54:20] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:54:20] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16888712546863450591
Running compilation step : cd /tmp/ltsmin16888712546863450591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 336 ms.
Running link step : cd /tmp/ltsmin16888712546863450591;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16888712546863450591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14554185515898075758.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 01:54:35] [INFO ] Flatten gal took : 15 ms
[2025-06-05 01:54:35] [INFO ] Flatten gal took : 8 ms
[2025-06-05 01:54:35] [INFO ] Time to serialize gal into /tmp/LTL3483293542414165751.gal : 1 ms
[2025-06-05 01:54:35] [INFO ] Time to serialize properties into /tmp/LTL11260443010997941894.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3483293542414165751.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2266628506512008930.hoa' '-atoms' '/tmp/LTL11260443010997941894.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11260443010997941894.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2266628506512008930.hoa
Detected timeout of ITS tools.
[2025-06-05 01:54:50] [INFO ] Flatten gal took : 6 ms
[2025-06-05 01:54:50] [INFO ] Flatten gal took : 7 ms
[2025-06-05 01:54:50] [INFO ] Time to serialize gal into /tmp/LTL7948300379763934564.gal : 2 ms
[2025-06-05 01:54:50] [INFO ] Time to serialize properties into /tmp/LTL17051000028128704589.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7948300379763934564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17051000028128704589.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((X((F("((s1<1)||(l3806<1))"))||(G("((s1<1)||(l160<1))"))))&&("((s1<1)||(l160<1))")))))
Formula 0 simplified : FG(!"((s1<1)||(l160<1))" | X(G!"((s1<1)||(l3806<1))" & F!"((s1<1)||(l160<1))"))
Detected timeout of ITS tools.
[2025-06-05 01:55:05] [INFO ] Flatten gal took : 10 ms
[2025-06-05 01:55:05] [INFO ] Applying decomposition
[2025-06-05 01:55:05] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8689113598148138400.txt' '-o' '/tmp/graph8689113598148138400.bin' '-w' '/tmp/graph8689113598148138400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8689113598148138400.bin' '-l' '-1' '-v' '-w' '/tmp/graph8689113598148138400.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:55:05] [INFO ] Decomposing Gal with order
[2025-06-05 01:55:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:55:05] [INFO ] Removed a total of 166 redundant transitions.
[2025-06-05 01:55:05] [INFO ] Flatten gal took : 15 ms
[2025-06-05 01:55:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 4 ms.
[2025-06-05 01:55:05] [INFO ] Time to serialize gal into /tmp/LTL9421665315555943228.gal : 3 ms
[2025-06-05 01:55:05] [INFO ] Time to serialize properties into /tmp/LTL17762140447644486911.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9421665315555943228.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17762140447644486911.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((X((F("((i0.u0.s1<1)||(i6.u13.l3806<1))"))||(G("((i0.u0.s1<1)||(i2.u6.l160<1))"))))&&("((i0.u0.s1<1)||(i2.u6.l160<1))")))))
Formula 0 simplified : FG(!"((i0.u0.s1<1)||(i2.u6.l160<1))" | X(G!"((i0.u0.s1<1)||(i6.u13.l3806<1))" & F!"((i0.u0.s1<1)||(i2.u6.l160<1))"))
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m160-LTLFireability-14 finished in 209284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X((!p0||X(X(X(X(!p0))))))&&G(!p1))||G((!p0||X(X(X(X(!p0)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((F(!p1)||G(!p0)))))))'
[2025-06-05 01:55:27] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1259787192761450188
[2025-06-05 01:55:27] [INFO ] Applying decomposition
[2025-06-05 01:55:27] [INFO ] Computing symmetric may disable matrix : 699 transitions.
[2025-06-05 01:55:27] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:55:27] [INFO ] Flatten gal took : 20 ms
[2025-06-05 01:55:27] [INFO ] Computing symmetric may enable matrix : 699 transitions.
[2025-06-05 01:55:27] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2848162492664681437.txt' '-o' '/tmp/graph2848162492664681437.bin' '-w' '/tmp/graph2848162492664681437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2848162492664681437.bin' '-l' '-1' '-v' '-w' '/tmp/graph2848162492664681437.weights' '-q' '0' '-e' '0.001'
[2025-06-05 01:55:27] [INFO ] Decomposing Gal with order
[2025-06-05 01:55:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 01:55:27] [INFO ] Computing Do-Not-Accords matrix : 699 transitions.
[2025-06-05 01:55:27] [INFO ] Removed a total of 658 redundant transitions.
[2025-06-05 01:55:27] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 01:55:27] [INFO ] Flatten gal took : 71 ms
[2025-06-05 01:55:27] [INFO ] Built C files in 189ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1259787192761450188
Running compilation step : cd /tmp/ltsmin1259787192761450188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-05 01:55:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 521 labels/synchronizations in 25 ms.
[2025-06-05 01:55:27] [INFO ] Time to serialize gal into /tmp/LTLFireability12832569794022892582.gal : 5 ms
[2025-06-05 01:55:27] [INFO ] Time to serialize properties into /tmp/LTLFireability1034119052265235286.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12832569794022892582.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1034119052265235286.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F(((X((!("((u0.s1>=1)&&(u0.l3931>=1))"))||(X(X(X(X(!("((u0.s1>=1)&&(u0.l3931>=1))"))))))))&&(G(!("((u0.s1>=1)&&(u7.l3910>=1))"))))|...246
Formula 0 simplified : G(F("((u0.s1>=1)&&(u0.l3931>=1))" & XXXX"((u0.s1>=1)&&(u0.l3931>=1))") & (X("((u0.s1>=1)&&(u0.l3931>=1))" & XXXX"((u0.s1>=1)&&(u0.l3...200
Compilation finished in 1969 ms.
Running link step : cd /tmp/ltsmin1259787192761450188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin1259787192761450188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X((!(LTLAPp0==true)||X(X(X(X(!(LTLAPp0==true)))))))&&[](!(LTLAPp1==true)))||[]((!(LTLAPp0==true)||X(X(X(X(!(LTLAPp0==true)))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.076: LTL layer: formula: <>(((X((!(LTLAPp0==true)||X(X(X(X(!(LTLAPp0==true)))))))&&[](!(LTLAPp1==true)))||[]((!(LTLAPp0==true)||X(X(X(X(!(LTLAPp0==true)))))))))
pins2lts-mc-linux64( 2/ 8), 0.076: "<>(((X((!(LTLAPp0==true)||X(X(X(X(!(LTLAPp0==true)))))))&&[](!(LTLAPp1==true)))||[]((!(LTLAPp0==true)||X(X(X(X(!(LTLAPp0==true)))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.076: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.105: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.109: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.109: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.112: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.114: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.115: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.167: There are 704 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.167: State length is 238, there are 861 groups
pins2lts-mc-linux64( 0/ 8), 0.167: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.167: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.167: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.167: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.208: [Blue] ~27 levels ~960 states ~3064 transitions
pins2lts-mc-linux64( 2/ 8), 0.239: [Blue] ~47 levels ~1920 states ~6648 transitions
pins2lts-mc-linux64( 1/ 8), 0.280: [Blue] ~56 levels ~3840 states ~7736 transitions
pins2lts-mc-linux64( 3/ 8), 0.383: [Blue] ~77 levels ~7680 states ~17888 transitions
pins2lts-mc-linux64( 3/ 8), 0.552: [Blue] ~77 levels ~15360 states ~33688 transitions
pins2lts-mc-linux64( 6/ 8), 0.741: [Blue] ~276 levels ~30720 states ~66080 transitions
pins2lts-mc-linux64( 6/ 8), 1.172: [Blue] ~618 levels ~61440 states ~148320 transitions
pins2lts-mc-linux64( 6/ 8), 2.213: [Blue] ~1422 levels ~122880 states ~300648 transitions
pins2lts-mc-linux64( 6/ 8), 4.108: [Blue] ~1832 levels ~245760 states ~551160 transitions
pins2lts-mc-linux64( 3/ 8), 7.511: [Blue] ~311 levels ~491520 states ~1004600 transitions
pins2lts-mc-linux64( 6/ 8), 14.170: [Blue] ~5253 levels ~983040 states ~2132392 transitions
pins2lts-mc-linux64( 0/ 8), 26.686: [Blue] ~798 levels ~1966080 states ~4076184 transitions
pins2lts-mc-linux64( 7/ 8), 51.574: [Blue] ~796 levels ~3932160 states ~8096256 transitions
pins2lts-mc-linux64( 7/ 8), 101.646: [Blue] ~796 levels ~7864320 states ~16217080 transitions
pins2lts-mc-linux64( 0/ 8), 202.733: [Blue] ~798 levels ~15728640 states ~33062360 transitions
pins2lts-mc-linux64( 0/ 8), 405.019: [Blue] ~798 levels ~31457280 states ~66403568 transitions
pins2lts-mc-linux64( 2/ 8), 476.117: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 476.407:
pins2lts-mc-linux64( 0/ 8), 476.407: Explored 36456164 states 87720184 transitions, fanout: 2.406
pins2lts-mc-linux64( 0/ 8), 476.407: Total exploration time 476.220 sec (475.940 sec minimum, 476.014 sec on average)
pins2lts-mc-linux64( 0/ 8), 476.407: States per second: 76553, Transitions per second: 184201
pins2lts-mc-linux64( 0/ 8), 476.407:
pins2lts-mc-linux64( 0/ 8), 476.407: State space has 45806350 states, 1 are accepting
pins2lts-mc-linux64( 0/ 8), 476.407: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 476.407: blue states: 36456164 (79.59%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 476.407: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 476.407: all-red states: 55 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 476.407:
pins2lts-mc-linux64( 0/ 8), 476.407: Total memory used for local state coloring: 22.4MB
pins2lts-mc-linux64( 0/ 8), 476.407:
pins2lts-mc-linux64( 0/ 8), 476.407: Queue width: 8B, total height: 1469560, memory: 11.21MB
pins2lts-mc-linux64( 0/ 8), 476.407: Tree memory: 605.5MB, 13.9 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 476.408: Tree fill ratio (roots/leafs): 34.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 476.408: Stored 710 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 476.408: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 476.408: Est. total memory use: 616.7MB (~1035.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1259787192761450188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X((!(LTLAPp0==true)||X(X(X(X(!(LTLAPp0==true)))))))&&[](!(LTLAPp1==true)))||[]((!(LTLAPp0==true)||X(X(X(X(!(LTLAPp0==true)))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1259787192761450188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((X((!(LTLAPp0==true)||X(X(X(X(!(LTLAPp0==true)))))))&&[](!(LTLAPp1==true)))||[]((!(LTLAPp0==true)||X(X(X(X(!(LTLAPp0==true)))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-05 02:21:26] [INFO ] Flatten gal took : 686 ms
[2025-06-05 02:21:26] [INFO ] Time to serialize gal into /tmp/LTLFireability6473117424612763030.gal : 13 ms
[2025-06-05 02:21:26] [INFO ] Time to serialize properties into /tmp/LTLFireability3669487121559949734.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6473117424612763030.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3669487121559949734.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((F(((X((!("((s1>=1)&&(l3931>=1))"))||(X(X(X(X(!("((s1>=1)&&(l3931>=1))"))))))))&&(G(!("((s1>=1)&&(l3910>=1))"))))||(G((!("((s1>=1)&&...216
Formula 0 simplified : G(F("((s1>=1)&&(l3931>=1))" & XXXX"((s1>=1)&&(l3931>=1))") & (X("((s1>=1)&&(l3931>=1))" & XXXX"((s1>=1)&&(l3931>=1))") | F"((s1>=1)&...170
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RingSingleMessageInMbox-PT-d1m160"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is RingSingleMessageInMbox-PT-d1m160, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-tall-174889264200452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m160.tgz
mv RingSingleMessageInMbox-PT-d1m160 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;