About the Execution of ITS-Tools for HirschbergSinclair-PT-35
| 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 | TFFFFTFFTF?FFTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422100108.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 HirschbergSinclair-PT-35, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422100108
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 544K 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 HirschbergSinclair-PT-35-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-35-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748782086366
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-35
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 12:48:07] [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-01 12:48:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 12:48:08] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2025-06-01 12:48:08] [INFO ] Transformed 998 places.
[2025-06-01 12:48:08] [INFO ] Transformed 922 transitions.
[2025-06-01 12:48:08] [INFO ] Parsed PT model containing 998 places and 922 transitions and 2806 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA HirschbergSinclair-PT-35-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-35-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 998/998 places, 922/922 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 963 transition count 922
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 65 place count 933 transition count 892
Iterating global reduction 1 with 30 rules applied. Total rules applied 95 place count 933 transition count 892
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 124 place count 904 transition count 863
Iterating global reduction 1 with 29 rules applied. Total rules applied 153 place count 904 transition count 863
Applied a total of 153 rules in 295 ms. Remains 904 /998 variables (removed 94) and now considering 863/922 (removed 59) transitions.
// Phase 1: matrix 863 rows 904 cols
[2025-06-01 12:48:08] [INFO ] Computed 41 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:48:09] [INFO ] Implicit Places using invariants in 680 ms returned []
[2025-06-01 12:48:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:48:16] [INFO ] Implicit Places using invariants and state equation in 7182 ms returned []
Implicit Place search using SMT with State Equation took 7904 ms to find 0 implicit places.
Running 828 sub problems to find dead transitions.
[2025-06-01 12:48:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/1767 variables, and 6 constraints, problems are : Problem set: 0 solved, 828 unsolved in 30046 ms.
Refiners :[Generalized P Invariants (flows): 6/41 constraints, State Equation: 0/904 constraints, PredecessorRefiner: 828/828 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 828 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/869 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 828 unsolved
At refinement iteration 2 (OVERLAPS) 35/904 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 828 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/1767 variables, and 41 constraints, problems are : Problem set: 0 solved, 828 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/904 constraints, PredecessorRefiner: 0/828 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60352ms problems are : Problem set: 0 solved, 828 unsolved
Search for dead transitions found 0 dead transitions in 60368ms
Starting structural reductions in LTL mode, iteration 1 : 904/998 places, 863/922 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68597 ms. Remains : 904/998 places, 863/922 transitions.
Support contains 47 out of 904 places after structural reductions.
[2025-06-01 12:49:17] [INFO ] Flatten gal took : 89 ms
[2025-06-01 12:49:17] [INFO ] Flatten gal took : 54 ms
[2025-06-01 12:49:17] [INFO ] Input system was already deterministic with 863 transitions.
RANDOM walk for 40000 steps (40 resets) in 1273 ms. (31 steps per ms) remains 2/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
[2025-06-01 12:49:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 548/555 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 278/833 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/833 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 863/1696 variables, 833/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1696 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 71/1767 variables, 71/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1767 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1767 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1767/1767 variables, and 945 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1842 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 904/904 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 548/555 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 278/833 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/833 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 863/1696 variables, 833/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1696 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 71/1767 variables, 71/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1767 variables, 2/947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1767 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1767 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1767/1767 variables, and 947 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2409 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 904/904 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4271ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 411 ms.
Support contains 3 out of 904 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 904/904 places, 863/863 transitions.
Graph (complete) has 1732 edges and 904 vertex of which 876 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 378 transitions
Trivial Post-agglo rules discarded 378 transitions
Performed 378 trivial Post agglomeration. Transition count delta: 378
Iterating post reduction 0 with 406 rules applied. Total rules applied 407 place count 876 transition count 457
Reduce places removed 378 places and 0 transitions.
Graph (complete) has 883 edges and 498 vertex of which 433 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.2 ms
Discarding 65 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 379 rules applied. Total rules applied 786 place count 433 transition count 457
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 2 with 65 rules applied. Total rules applied 851 place count 433 transition count 392
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 854 place count 430 transition count 389
Iterating global reduction 3 with 3 rules applied. Total rules applied 857 place count 430 transition count 389
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 858 place count 430 transition count 388
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 754 edges and 429 vertex of which 427 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 860 place count 427 transition count 388
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 862 place count 427 transition count 386
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 863 place count 426 transition count 385
Iterating global reduction 6 with 1 rules applied. Total rules applied 864 place count 426 transition count 385
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 871 place count 426 transition count 378
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 878 place count 419 transition count 378
Reduce places removed 34 places and 34 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 912 place count 385 transition count 344
Reduce places removed 27 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 7 with 236 rules applied. Total rules applied 1148 place count 358 transition count 135
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 8 with 209 rules applied. Total rules applied 1357 place count 149 transition count 135
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 26 Pre rules applied. Total rules applied 1357 place count 149 transition count 109
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 9 with 52 rules applied. Total rules applied 1409 place count 123 transition count 109
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 1410 place count 122 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1410 place count 122 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1412 place count 121 transition count 108
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1418 place count 118 transition count 105
Applied a total of 1418 rules in 170 ms. Remains 118 /904 variables (removed 786) and now considering 105/863 (removed 758) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 118/904 places, 105/863 transitions.
RANDOM walk for 40000 steps (368 resets) in 458 ms. (87 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (144 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 161 steps, run visited all 1 properties in 6 ms. (steps per millisecond=26 )
Probabilistic random walk after 161 steps, saw 122 distinct states, run finished after 10 ms. (steps per millisecond=16 ) properties seen :1
Computed a total of 904 stabilizing places and 863 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 904 transition count 863
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U ((X(X(p0))&&G((p1&&(p2||X(!p3)))))||X(X(G(p0))))))'
Support contains 5 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 899 transition count 858
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 899 transition count 858
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 895 transition count 854
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 895 transition count 854
Applied a total of 18 rules in 264 ms. Remains 895 /904 variables (removed 9) and now considering 854/863 (removed 9) transitions.
// Phase 1: matrix 854 rows 895 cols
[2025-06-01 12:49:23] [INFO ] Computed 41 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:49:24] [INFO ] Implicit Places using invariants in 429 ms returned []
[2025-06-01 12:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:49:34] [INFO ] Implicit Places using invariants and state equation in 9788 ms returned []
Implicit Place search using SMT with State Equation took 10220 ms to find 0 implicit places.
Running 819 sub problems to find dead transitions.
[2025-06-01 12:49:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/860 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/860 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 2 (OVERLAPS) 35/895 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 819 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 895/1749 variables, and 41 constraints, problems are : Problem set: 0 solved, 819 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/895 constraints, PredecessorRefiner: 819/819 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 819 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/860 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/860 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 2 (OVERLAPS) 35/895 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 819 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 895/1749 variables, and 41 constraints, problems are : Problem set: 0 solved, 819 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/895 constraints, PredecessorRefiner: 0/819 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 819 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Starting structural reductions in LTL mode, iteration 1 : 895/904 places, 854/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70725 ms. Remains : 895/904 places, 854/863 transitions.
Stuttering acceptance computed with spot in 624 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p1 p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) p1 p3), (AND (NOT p0) (NOT p1)), (AND p0 p1 p3), (OR (AND p0 (NOT p2) p3) (AND p0 (NOT p1)))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-01
Product exploration explored 100000 steps with 24996 reset in 613 ms.
Product exploration explored 100000 steps with 25062 reset in 467 ms.
Computed a total of 895 stabilizing places and 854 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 895 transition count 854
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1) p2 (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p1) p3 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p2) p3 (NOT p0)))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p2) p3 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 40 factoid took 173 ms. Reduced automaton from 12 states, 38 edges and 4 AP (stutter sensitive) to 19 states, 66 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 779 ms :[false, (NOT p0), (NOT p0), (AND (NOT p0) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1))), true, (AND p0 p1 p3 p2), (OR (AND p0 (NOT p2) p3) (AND p0 (NOT p1))), false, false, false, false, false, false, false, false, false, false, false]
RANDOM walk for 40000 steps (40 resets) in 789 ms. (50 steps per ms) remains 7/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
[2025-06-01 12:50:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 601/606 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 221/827 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/827 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf23 is UNSAT
At refinement iteration 5 (OVERLAPS) 854/1681 variables, 827/868 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1681 variables, 0/868 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 68/1749 variables, 68/936 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1749 variables, 0/936 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/1749 variables, 0/936 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1749/1749 variables, and 936 constraints, problems are : Problem set: 1 solved, 6 unsolved in 2459 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 895/895 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 601/606 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 221/827 variables, 36/41 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/827 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 854/1681 variables, 827/868 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1681 variables, 0/868 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 68/1749 variables, 68/936 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1749 variables, 6/942 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1749 variables, 0/942 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1749/1749 variables, and 942 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5012 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 895/895 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7501ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 895 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 895/895 places, 854/854 transitions.
Graph (complete) has 1718 edges and 895 vertex of which 863 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 373 transitions
Trivial Post-agglo rules discarded 373 transitions
Performed 373 trivial Post agglomeration. Transition count delta: 373
Iterating post reduction 0 with 405 rules applied. Total rules applied 406 place count 863 transition count 449
Reduce places removed 373 places and 0 transitions.
Graph (complete) has 875 edges and 490 vertex of which 428 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.1 ms
Discarding 62 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 374 rules applied. Total rules applied 780 place count 428 transition count 449
Drop transitions (Empty/Sink Transition effects.) removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 2 with 62 rules applied. Total rules applied 842 place count 428 transition count 387
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 843 place count 427 transition count 386
Iterating global reduction 3 with 1 rules applied. Total rules applied 844 place count 427 transition count 386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 845 place count 426 transition count 385
Iterating global reduction 3 with 1 rules applied. Total rules applied 846 place count 426 transition count 385
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 849 place count 426 transition count 382
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 852 place count 423 transition count 382
Reduce places removed 34 places and 34 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 886 place count 389 transition count 348
Reduce places removed 30 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 4 with 268 rules applied. Total rules applied 1154 place count 359 transition count 110
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 5 with 238 rules applied. Total rules applied 1392 place count 121 transition count 110
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 28 Pre rules applied. Total rules applied 1392 place count 121 transition count 82
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 1448 place count 93 transition count 82
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 1449 place count 92 transition count 82
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1449 place count 92 transition count 81
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1451 place count 91 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1455 place count 89 transition count 79
Applied a total of 1455 rules in 98 ms. Remains 89 /895 variables (removed 806) and now considering 79/854 (removed 775) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 89/895 places, 79/854 transitions.
RANDOM walk for 40000 steps (482 resets) in 176 ms. (225 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (200 resets) in 85 ms. (465 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (198 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (182 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (173 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (202 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
// Phase 1: matrix 79 rows 89 cols
[2025-06-01 12:50:45] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 55/62 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 23/85 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 78/163 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 5/168 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 99 constraints, problems are : Problem set: 0 solved, 4 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 55/62 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 23/85 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 78/163 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 5/168 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/168 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 103 constraints, problems are : Problem set: 0 solved, 4 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 480ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 79/79 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 79/79 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 89/89 places, 79/79 transitions.
RANDOM walk for 40000 steps (483 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (200 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (182 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (172 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (201 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 25543 steps, run visited all 4 properties in 88 ms. (steps per millisecond=290 )
Probabilistic random walk after 25543 steps, saw 6577 distinct states, run finished after 88 ms. (steps per millisecond=290 ) properties seen :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2 (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p1) p3 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p2) p3 (NOT p0)))), (X (NOT (AND p1 p3 (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p2) p3 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p3)))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p3))), (G (OR p0 (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR (AND p0 (NOT p1)) (AND p0 p3 (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p1) p3 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p3)))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 p3 p2))), (F p3), (F p1), (F (NOT (AND (OR p0 p1) (OR p0 (NOT p3) p2)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 (NOT p3) p2))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3)) (AND p0 p2)))), (F (NOT (OR (NOT p0) p1 (NOT p3) (NOT p2)))), (F (NOT (AND (OR p0 (NOT p1) p3) (OR p0 (NOT p1) (NOT p2))))), (F (NOT (OR p0 (NOT p1) p3 p2))), (F (NOT (OR (NOT p0) (NOT p1) p3 p2))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p3) p2))), (F (NOT (AND (OR (NOT p0) (NOT p1) p3) (OR (NOT p0) (NOT p1) (NOT p2))))), (F (NOT (AND p0 (NOT p1) (NOT p3) p2))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1 (NOT p3))))]
Property proved to be false thanks to negative knowledge :(F (NOT (AND (OR p0 p1) (OR p0 (NOT p3) p2))))
Knowledge based reduction with 41 factoid took 508 ms. Reduced automaton from 19 states, 66 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-01 finished in 83622 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(F(p2))||p1))&&p0)))'
Support contains 5 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 898 transition count 857
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 898 transition count 857
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 893 transition count 852
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 893 transition count 852
Applied a total of 22 rules in 99 ms. Remains 893 /904 variables (removed 11) and now considering 852/863 (removed 11) transitions.
// Phase 1: matrix 852 rows 893 cols
[2025-06-01 12:50:47] [INFO ] Computed 41 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:50:47] [INFO ] Implicit Places using invariants in 426 ms returned []
[2025-06-01 12:50:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:50:57] [INFO ] Implicit Places using invariants and state equation in 9533 ms returned []
Implicit Place search using SMT with State Equation took 9962 ms to find 0 implicit places.
Running 817 sub problems to find dead transitions.
[2025-06-01 12:50:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 670.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 669.0)
(s11 1.0)
(s12 668.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 665.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 663.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 662.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 655.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 653.0)
(s47 1.0)
(s48 0.0)
(s49 653.0)
(s50 0.0)
(s51 652.0)
(s52 0.0)
(s53 1.0)
(s54 647.0)
(s55 1.0)
(s56 0.0)
(s57 647.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 644.0)
(s62 0.0)
(s63 643.0)
(s64 0.0)
(s65 1.0)
(s66 639.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 674.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 673.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 673.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 672.0)
(s84 1.0)
(s85 671.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 669.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 669.0)
(s108 1.0)
(s109 667.0)
(s110 1.0)
(s111 668.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 665.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 663.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 663.0)
(s136 1.0)
(s137 662.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 658.0)
(s146 1.0)
(s147 660.0)
(s148 1.0)
(s149 657.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 655.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 650.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 646.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 642.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 817/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 817 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 0/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 817 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in LTL mode, iteration 1 : 893/904 places, 852/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70250 ms. Remains : 893/904 places, 852/863 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-02 finished in 70436 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(((X(X(p0)) U ((X(X(p0))&&G((p1||F(!p2))))||X(X(G(p0))))) U (G((X(X(p0)) U ((X(X(p0))&&G((p1||F(!p2))))||X(X(G(p0))))))||(!p3&&(X(X(p0)) U ((X(X(p0))&&G((p1||F(!p2))))||X(X(G(p0)))))))))))'
Support contains 6 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 899 transition count 858
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 899 transition count 858
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 895 transition count 854
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 895 transition count 854
Applied a total of 18 rules in 114 ms. Remains 895 /904 variables (removed 9) and now considering 854/863 (removed 9) transitions.
// Phase 1: matrix 854 rows 895 cols
[2025-06-01 12:51:57] [INFO ] Computed 41 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:51:58] [INFO ] Implicit Places using invariants in 420 ms returned []
[2025-06-01 12:51:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:52:07] [INFO ] Implicit Places using invariants and state equation in 9682 ms returned []
Implicit Place search using SMT with State Equation took 10105 ms to find 0 implicit places.
Running 819 sub problems to find dead transitions.
[2025-06-01 12:52:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/860 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/860 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 2 (OVERLAPS) 35/895 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 819 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 672.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 671.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 669.0)
(s11 1.0)
(s12 0.0)
(s13 669.0)
(s14 0.0)
(s15 669.0)
(s16 668.0)
(s17 1.0)
(s18 0.0)
(s19 668.0)
(s20 666.0)
(s21 1.0)
(s22 665.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 663.0)
(s30 0.0)
(s31 663.0)
(s32 662.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 659.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 656.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 654.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 649.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 646.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 674.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 673.0)
(s80 1.0)
(s81 671.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 671.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 665.0)
(s124 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 895/1749 variables, and 41 constraints, problems are : Problem set: 0 solved, 819 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/895 constraints, PredecessorRefiner: 819/819 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 819 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/860 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/860 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 2 (OVERLAPS) 35/895 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 819 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 895/1749 variables, and 41 constraints, problems are : Problem set: 0 solved, 819 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/895 constraints, PredecessorRefiner: 0/819 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 819 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Starting structural reductions in LTL mode, iteration 1 : 895/904 places, 854/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70396 ms. Remains : 895/904 places, 854/863 transitions.
Stuttering acceptance computed with spot in 1289 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), false, (AND (NOT p0) p2), false, (AND (NOT p0) p2), false, (AND (NOT p0) (NOT p1) p2), false, false]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-03
Product exploration explored 100000 steps with 512 reset in 504 ms.
Product exploration explored 100000 steps with 549 reset in 538 ms.
Computed a total of 895 stabilizing places and 854 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 895 transition count 854
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p3) p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X p1), (X (X (NOT p3))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p3 (NOT p1) p2)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p3 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p3 p2 p0)))), (X (X p1)), (F (G (NOT p3))), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(X (X p2))
Knowledge based reduction with 22 factoid took 183 ms. Reduced automaton from 25 states, 123 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-03 finished in 73255 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(p1)||p0))&&F(p2))))))'
Support contains 6 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 898 transition count 857
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 898 transition count 857
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 893 transition count 852
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 893 transition count 852
Applied a total of 22 rules in 111 ms. Remains 893 /904 variables (removed 11) and now considering 852/863 (removed 11) transitions.
// Phase 1: matrix 852 rows 893 cols
[2025-06-01 12:53:10] [INFO ] Computed 41 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:53:11] [INFO ] Implicit Places using invariants in 418 ms returned []
[2025-06-01 12:53:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:53:20] [INFO ] Implicit Places using invariants and state equation in 9665 ms returned []
Implicit Place search using SMT with State Equation took 10085 ms to find 0 implicit places.
Running 817 sub problems to find dead transitions.
[2025-06-01 12:53:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 817/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 817 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 0/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 817 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Starting structural reductions in LTL mode, iteration 1 : 893/904 places, 852/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70372 ms. Remains : 893/904 places, 852/863 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-04
Stuttering criterion allowed to conclude after 937 steps with 3 reset in 6 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-04 finished in 70726 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((p0&&X((p0 U (p1||G(p0))))&&(p2||X(F(p3))))))'
Support contains 5 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 898 transition count 857
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 898 transition count 857
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 893 transition count 852
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 893 transition count 852
Applied a total of 22 rules in 100 ms. Remains 893 /904 variables (removed 11) and now considering 852/863 (removed 11) transitions.
[2025-06-01 12:54:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:54:22] [INFO ] Implicit Places using invariants in 419 ms returned []
[2025-06-01 12:54:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:54:32] [INFO ] Implicit Places using invariants and state equation in 10065 ms returned []
Implicit Place search using SMT with State Equation took 10486 ms to find 0 implicit places.
Running 817 sub problems to find dead transitions.
[2025-06-01 12:54:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 817/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 817 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 0/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 817 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in LTL mode, iteration 1 : 893/904 places, 852/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70752 ms. Remains : 893/904 places, 852/863 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), true, (NOT p3), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 368 ms.
Product exploration explored 100000 steps with 33333 reset in 399 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p2 p3 p1), (X p2), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p2)), (F (G p3)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 11 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-05 finished in 71969 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(X(X((p0&&X(G(p1))))))&&(p2||X(p2)))))'
Support contains 4 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 899 transition count 858
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 899 transition count 858
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 895 transition count 854
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 895 transition count 854
Applied a total of 18 rules in 109 ms. Remains 895 /904 variables (removed 9) and now considering 854/863 (removed 9) transitions.
// Phase 1: matrix 854 rows 895 cols
[2025-06-01 12:55:33] [INFO ] Computed 41 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:55:34] [INFO ] Implicit Places using invariants in 418 ms returned []
[2025-06-01 12:55:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:55:44] [INFO ] Implicit Places using invariants and state equation in 10814 ms returned []
Implicit Place search using SMT with State Equation took 11234 ms to find 0 implicit places.
Running 819 sub problems to find dead transitions.
[2025-06-01 12:55:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/860 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/860 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 2 (OVERLAPS) 35/895 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 819 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 895/1749 variables, and 41 constraints, problems are : Problem set: 0 solved, 819 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/895 constraints, PredecessorRefiner: 819/819 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 819 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/860 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/860 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 2 (OVERLAPS) 35/895 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 819 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 675)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 673)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 671)
(s14 0)
(s15 1)
(s16 670)
(s17 1)
(s18 669)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 1)
(s26 665)
(s27 1)
(s28 0)
(s29 665)
(s30 0)
(s31 1)
(s32 664)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 660)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 656)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 653)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 649)
(s58 0)
(s59 1)
(s60 0)
(s61 646)
(s62 644)
(s63 1)
(s64 0)
(s65 644)
(s66 0)
(s67 642)
(s68 0)
(s69 675)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 674)
(s78 1)
(s79 675)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 673)
(s86 1)
(s87 1)
(s88 1)
(s89 672)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 671)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 669)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 667)
(s118 1)
(s119 668)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 665)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 664)
(s144 1)
(s145 1)
(s146 1)
(s147 662)
(s148 1)
(s149 659)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 658)
(s160 1)
(s161 656)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 655)
(s172 1)
(s173 652)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 650)
(s184 1)
(s185 648)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 timeout
1)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 895/1749 variables, and 41 constraints, problems are : Problem set: 0 solved, 819 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/895 constraints, PredecessorRefiner: 0/819 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 819 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 895/904 places, 854/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71511 ms. Remains : 895/904 places, 854/863 transitions.
Stuttering acceptance computed with spot in 576 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-07
Stuttering criterion allowed to conclude after 916 steps with 0 reset in 9 ms.
FORMULA HirschbergSinclair-PT-35-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-35-LTLFireability-07 finished in 72126 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||G(p1)))))'
Support contains 3 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Reduce places removed 34 places and 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 380 transitions
Trivial Post-agglo rules discarded 380 transitions
Performed 380 trivial Post agglomeration. Transition count delta: 380
Iterating post reduction 0 with 380 rules applied. Total rules applied 380 place count 870 transition count 449
Reduce places removed 380 places and 0 transitions.
Iterating post reduction 1 with 380 rules applied. Total rules applied 760 place count 490 transition count 449
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 766 place count 484 transition count 443
Iterating global reduction 2 with 6 rules applied. Total rules applied 772 place count 484 transition count 443
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 773 place count 484 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 774 place count 483 transition count 442
Applied a total of 774 rules in 61 ms. Remains 483 /904 variables (removed 421) and now considering 442/863 (removed 421) transitions.
// Phase 1: matrix 442 rows 483 cols
[2025-06-01 12:56:45] [INFO ] Computed 41 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:56:46] [INFO ] Implicit Places using invariants in 590 ms returned []
[2025-06-01 12:56:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:56:57] [INFO ] Implicit Places using invariants and state equation in 11168 ms returned []
Implicit Place search using SMT with State Equation took 11761 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:56:57] [INFO ] Redundant transitions in 24 ms returned []
Running 376 sub problems to find dead transitions.
[2025-06-01 12:56:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/417 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 3/420 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 379/799 variables, 420/461 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 799/925 variables, and 461 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 420/483 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/417 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 3/420 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 4 (OVERLAPS) 379/799 variables, 420/461 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 376/837 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 799/925 variables, and 837 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 420/483 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in SI_LTL mode, iteration 1 : 483/904 places, 442/863 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71904 ms. Remains : 483/904 places, 442/863 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-08
Product exploration explored 100000 steps with 209 reset in 231 ms.
Product exploration explored 100000 steps with 209 reset in 366 ms.
Computed a total of 483 stabilizing places and 442 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 483 transition count 442
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 10 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-08 finished in 72764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 869 transition count 437
Reduce places removed 391 places and 0 transitions.
Iterating post reduction 1 with 391 rules applied. Total rules applied 782 place count 478 transition count 437
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 787 place count 473 transition count 432
Iterating global reduction 2 with 5 rules applied. Total rules applied 792 place count 473 transition count 432
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 793 place count 473 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 794 place count 472 transition count 431
Applied a total of 794 rules in 42 ms. Remains 472 /904 variables (removed 432) and now considering 431/863 (removed 432) transitions.
// Phase 1: matrix 431 rows 472 cols
[2025-06-01 12:57:58] [INFO ] Computed 41 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:57:59] [INFO ] Implicit Places using invariants in 648 ms returned []
[2025-06-01 12:57:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:58:10] [INFO ] Implicit Places using invariants and state equation in 11405 ms returned []
Implicit Place search using SMT with State Equation took 12057 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:58:10] [INFO ] Redundant transitions in 4 ms returned []
Running 362 sub problems to find dead transitions.
[2025-06-01 12:58:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 2/405 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 366/771 variables, 405/446 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 771/903 variables, and 446 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 405/472 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 2/405 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 366/771 variables, 405/446 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/771 variables, 362/808 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 771/903 variables, and 808 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 405/472 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in SI_LTL mode, iteration 1 : 472/904 places, 431/863 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72167 ms. Remains : 472/904 places, 431/863 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-09
Product exploration explored 100000 steps with 2328 reset in 573 ms.
Product exploration explored 100000 steps with 2362 reset in 627 ms.
Computed a total of 472 stabilizing places and 431 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 472 transition count 431
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 289 steps (0 resets) in 6 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2025-06-01 12:59:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:59:13] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 1175 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-09 finished in 75605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||X(p1)))&&F(p2)))'
Support contains 5 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 898 transition count 857
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 898 transition count 857
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 893 transition count 852
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 893 transition count 852
Applied a total of 22 rules in 111 ms. Remains 893 /904 variables (removed 11) and now considering 852/863 (removed 11) transitions.
// Phase 1: matrix 852 rows 893 cols
[2025-06-01 12:59:14] [INFO ] Computed 41 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:59:14] [INFO ] Implicit Places using invariants in 395 ms returned []
[2025-06-01 12:59:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:59:24] [INFO ] Implicit Places using invariants and state equation in 10150 ms returned []
Implicit Place search using SMT with State Equation took 10547 ms to find 0 implicit places.
Running 817 sub problems to find dead transitions.
[2025-06-01 12:59:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 817/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 817 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 0/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 817 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 893/904 places, 852/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70838 ms. Remains : 893/904 places, 852/863 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-10
Product exploration explored 100000 steps with 199 reset in 327 ms.
Product exploration explored 100000 steps with 194 reset in 343 ms.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT p2))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 205 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p0), (NOT p0)]
RANDOM walk for 2825 steps (0 resets) in 32 ms. (85 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT p2))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F p2)]
Knowledge based reduction with 10 factoid took 286 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p0), (NOT p0)]
[2025-06-01 13:00:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 13:00:27] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 150 ms returned sat
[2025-06-01 13:00:33] [INFO ] [Real]Absence check using state equation in 5528 ms returned sat
[2025-06-01 13:00:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 13:00:33] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 171 ms returned sat
[2025-06-01 13:00:39] [INFO ] [Nat]Absence check using state equation in 6071 ms returned sat
[2025-06-01 13:00:40] [INFO ] Computed and/alt/rep : 394/400/394 causal constraints (skipped 423 transitions) in 50 ms.
[2025-06-01 13:00:42] [INFO ] Added : 93 causal constraints over 19 iterations in 2535 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-01 13:00:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 13:00:43] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 155 ms returned sat
[2025-06-01 13:00:57] [INFO ] [Real]Absence check using state equation in 14370 ms returned unknown
Could not prove EG (NOT p2)
Support contains 3 out of 893 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 893/893 places, 852/852 transitions.
Applied a total of 0 rules in 33 ms. Remains 893 /893 variables (removed 0) and now considering 852/852 (removed 0) transitions.
[2025-06-01 13:00:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:00:58] [INFO ] Implicit Places using invariants in 413 ms returned []
[2025-06-01 13:00:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:01:08] [INFO ] Implicit Places using invariants and state equation in 10236 ms returned []
Implicit Place search using SMT with State Equation took 10653 ms to find 0 implicit places.
Running 817 sub problems to find dead transitions.
[2025-06-01 13:01:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 817/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 817 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 0/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 817 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Finished structural reductions in LTL mode , in 1 iterations and 70858 ms. Remains : 893/893 places, 852/852 transitions.
Computed a total of 893 stabilizing places and 852 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 893 transition count 852
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p0), (NOT p0)]
RANDOM walk for 2875 steps (0 resets) in 39 ms. (71 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2)]
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p0), (NOT p0)]
[2025-06-01 13:02:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 13:02:10] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 152 ms returned sat
[2025-06-01 13:02:15] [INFO ] [Real]Absence check using state equation in 5527 ms returned sat
[2025-06-01 13:02:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 13:02:16] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 155 ms returned sat
[2025-06-01 13:02:22] [INFO ] [Nat]Absence check using state equation in 6132 ms returned sat
[2025-06-01 13:02:22] [INFO ] Computed and/alt/rep : 394/400/394 causal constraints (skipped 423 transitions) in 51 ms.
[2025-06-01 13:02:25] [INFO ] Added : 93 causal constraints over 19 iterations in 2480 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-01 13:02:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 13:02:25] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 154 ms returned sat
[2025-06-01 13:02:40] [INFO ] [Real]Absence check using state equation in 14380 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 198 reset in 325 ms.
Product exploration explored 100000 steps with 200 reset in 353 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p0), (NOT p0)]
Support contains 3 out of 893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 893/893 places, 852/852 transitions.
Performed 385 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 385 rules applied. Total rules applied 385 place count 893 transition count 852
Deduced a syphon composed of 385 places in 3 ms
Applied a total of 385 rules in 79 ms. Remains 893 /893 variables (removed 0) and now considering 852/852 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:02:41] [INFO ] Redundant transitions in 5 ms returned []
Running 817 sub problems to find dead transitions.
// Phase 1: matrix 852 rows 893 cols
[2025-06-01 13:02:41] [INFO ] Computed 41 invariants in 4 ms
[2025-06-01 13:02:41] [INFO ] State equation strengthened by 385 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, ReadFeed: 0/385 constraints, PredecessorRefiner: 817/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 817 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 672)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 669)
(s16 0)
(s17 1)
(s18 667)
(s19 1)
(s20 666)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 665)
(s26 0)
(s27 664)
(s28 0)
(s29 1)
(s30 0)
(s31 663)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 656)
(s41 1)
(s42 655)
(s43 1)
(s44 0)
(s45 655)
(s46 0)
(s47 654)
(s48 0)
(s49 653)
(s50 651)
(s51 1)
(s52 0)
(s53 1)
(s54 647)
(s55 1)
(s56 0)
(s57 647)
(s58 645)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 643)
(s64 0)
(s65 642)
(s66 639)
(s67 1)
(s68 0)
(s69 674)
(s70 1)
(s71 1)
(s72 1)
(s73 673)
(s74 1)
(s75 1)
(s76 1)
(s77 672)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 671)
(s88 1)
(s89 670)
(s90 1)
(s91 671)
(s92 1)
(s93 669)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 669)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 666)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 663)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 662)
(s138 1)
(s139 663)
(s140 1)
(s141 660)
(s142 1)
(s143 1)
(s144 1)
(s145 658)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 650)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 644)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, ReadFeed: 0/385 constraints, PredecessorRefiner: 0/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 817 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in SI_LTL mode, iteration 1 : 893/893 places, 852/852 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60269 ms. Remains : 893/893 places, 852/852 transitions.
Built C files in :
/tmp/ltsmin2225425457726482529
[2025-06-01 13:03:41] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2225425457726482529
Running compilation step : cd /tmp/ltsmin2225425457726482529;'/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 1542 ms.
Running link step : cd /tmp/ltsmin2225425457726482529;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin2225425457726482529;'/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/stateBased13062643936482672701.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 893/893 places, 852/852 transitions.
Applied a total of 0 rules in 33 ms. Remains 893 /893 variables (removed 0) and now considering 852/852 (removed 0) transitions.
// Phase 1: matrix 852 rows 893 cols
[2025-06-01 13:03:56] [INFO ] Computed 41 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:03:57] [INFO ] Implicit Places using invariants in 456 ms returned []
[2025-06-01 13:03:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:04:07] [INFO ] Implicit Places using invariants and state equation in 10318 ms returned []
Implicit Place search using SMT with State Equation took 10775 ms to find 0 implicit places.
Running 817 sub problems to find dead transitions.
[2025-06-01 13:04:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 817/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 817 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/858 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/858 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 817 unsolved
At refinement iteration 2 (OVERLAPS) 35/893 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 893/1745 variables, and 41 constraints, problems are : Problem set: 0 solved, 817 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/893 constraints, PredecessorRefiner: 0/817 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 817 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Finished structural reductions in LTL mode , in 1 iterations and 70976 ms. Remains : 893/893 places, 852/852 transitions.
Built C files in :
/tmp/ltsmin4671575753390837371
[2025-06-01 13:05:07] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4671575753390837371
Running compilation step : cd /tmp/ltsmin4671575753390837371;'/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 1371 ms.
Running link step : cd /tmp/ltsmin4671575753390837371;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4671575753390837371;'/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/stateBased8573198650026193514.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 13:05:22] [INFO ] Flatten gal took : 35 ms
[2025-06-01 13:05:22] [INFO ] Flatten gal took : 35 ms
[2025-06-01 13:05:22] [INFO ] Time to serialize gal into /tmp/LTL2457282460103789639.gal : 8 ms
[2025-06-01 13:05:22] [INFO ] Time to serialize properties into /tmp/LTL6545897371560987326.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/LTL2457282460103789639.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7359163976004936904.hoa' '-atoms' '/tmp/LTL6545897371560987326.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...317
Loading property file /tmp/LTL6545897371560987326.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7359163976004936904.hoa
Detected timeout of ITS tools.
[2025-06-01 13:05:38] [INFO ] Flatten gal took : 32 ms
[2025-06-01 13:05:38] [INFO ] Flatten gal took : 32 ms
[2025-06-01 13:05:38] [INFO ] Time to serialize gal into /tmp/LTL4274800837963801764.gal : 6 ms
[2025-06-01 13:05:38] [INFO ] Time to serialize properties into /tmp/LTL15499940943473195570.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/LTL4274800837963801764.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15499940943473195570.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 : !(((X((F("((rcv_right_reply_35_2_3>=1)&&(rcv_right_reply_35_5_6<1))"))||(X("((newmsg21>=1)&&(election_35_6_21_to_right_20>=1))"))))&&(...224
Formula 0 simplified : X(G!"((rcv_right_reply_35_2_3>=1)&&(rcv_right_reply_35_5_6<1))" & X!"((newmsg21>=1)&&(election_35_6_21_to_right_20>=1))") | G!"((rcv...212
Detected timeout of ITS tools.
[2025-06-01 13:05:53] [INFO ] Flatten gal took : 28 ms
[2025-06-01 13:05:53] [INFO ] Applying decomposition
[2025-06-01 13:05:53] [INFO ] Flatten gal took : 27 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/graph7175865199598214578.txt' '-o' '/tmp/graph7175865199598214578.bin' '-w' '/tmp/graph7175865199598214578.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7175865199598214578.bin' '-l' '-1' '-v' '-w' '/tmp/graph7175865199598214578.weights' '-q' '0' '-e' '0.001'
[2025-06-01 13:05:53] [INFO ] Decomposing Gal with order
[2025-06-01 13:05:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 13:05:53] [INFO ] Removed a total of 78 redundant transitions.
[2025-06-01 13:05:53] [INFO ] Flatten gal took : 109 ms
[2025-06-01 13:05:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-01 13:05:53] [INFO ] Time to serialize gal into /tmp/LTL12409489656407876398.gal : 11 ms
[2025-06-01 13:05:53] [INFO ] Time to serialize properties into /tmp/LTL13093668977898579440.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/LTL12409489656407876398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13093668977898579440.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 : !(((X((F("((i1.u2.rcv_right_reply_35_2_3>=1)&&(i10.u67.rcv_right_reply_35_5_6<1))"))||(X("((i5.i1.u40.newmsg21>=1)&&(i4.i1.u16.electio...272
Formula 0 simplified : X(G!"((i1.u2.rcv_right_reply_35_2_3>=1)&&(i10.u67.rcv_right_reply_35_5_6<1))" & X!"((i5.i1.u40.newmsg21>=1)&&(i4.i1.u16.election_35_...260
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-35-LTLFireability-10 finished in 414625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 5 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 899 transition count 858
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 899 transition count 858
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 895 transition count 854
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 895 transition count 854
Applied a total of 18 rules in 95 ms. Remains 895 /904 variables (removed 9) and now considering 854/863 (removed 9) transitions.
// Phase 1: matrix 854 rows 895 cols
[2025-06-01 13:06:08] [INFO ] Computed 41 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:06:09] [INFO ] Implicit Places using invariants in 385 ms returned []
[2025-06-01 13:06:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:06:19] [INFO ] Implicit Places using invariants and state equation in 9910 ms returned []
Implicit Place search using SMT with State Equation took 10300 ms to find 0 implicit places.
Running 819 sub problems to find dead transitions.
[2025-06-01 13:06:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/860 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/860 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 2 (OVERLAPS) 35/895 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 819 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 895/1749 variables, and 41 constraints, problems are : Problem set: 0 solved, 819 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/895 constraints, PredecessorRefiner: 819/819 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 819 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/860 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/860 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 819 unsolved
At refinement iteration 2 (OVERLAPS) 35/895 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 819 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 895/1749 variables, and 41 constraints, problems are : Problem set: 0 solved, 819 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/895 constraints, PredecessorRefiner: 0/819 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 819 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Starting structural reductions in LTL mode, iteration 1 : 895/904 places, 854/863 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70568 ms. Remains : 895/904 places, 854/863 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-14
Product exploration explored 100000 steps with 108 reset in 337 ms.
Product exploration explored 100000 steps with 108 reset in 370 ms.
Computed a total of 895 stabilizing places and 854 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 895 transition count 854
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 15 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-14 finished in 71759 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 (p1||G(p0))))))'
Support contains 2 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 863/863 transitions.
Reduce places removed 35 places and 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 869 transition count 438
Reduce places removed 390 places and 0 transitions.
Iterating post reduction 1 with 390 rules applied. Total rules applied 780 place count 479 transition count 438
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 785 place count 474 transition count 433
Iterating global reduction 2 with 5 rules applied. Total rules applied 790 place count 474 transition count 433
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 791 place count 474 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 792 place count 473 transition count 432
Applied a total of 792 rules in 40 ms. Remains 473 /904 variables (removed 431) and now considering 432/863 (removed 431) transitions.
// Phase 1: matrix 432 rows 473 cols
[2025-06-01 13:07:20] [INFO ] Computed 41 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:07:21] [INFO ] Implicit Places using invariants in 603 ms returned []
[2025-06-01 13:07:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:07:32] [INFO ] Implicit Places using invariants and state equation in 11181 ms returned []
Implicit Place search using SMT with State Equation took 11785 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:07:32] [INFO ] Redundant transitions in 2 ms returned []
Running 363 sub problems to find dead transitions.
[2025-06-01 13:07:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 2/406 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 366/772 variables, 406/447 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s48 1.0)
(s49 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 772/905 variables, and 447 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 406/473 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 2/406 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 366/772 variables, 406/447 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/772 variables, 363/810 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 772/905 variables, and 810 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 406/473 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in SI_LTL mode, iteration 1 : 473/904 places, 432/863 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71918 ms. Remains : 473/904 places, 432/863 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-35-LTLFireability-15
Product exploration explored 100000 steps with 316 reset in 307 ms.
Product exploration explored 100000 steps with 320 reset in 335 ms.
Computed a total of 473 stabilizing places and 432 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 473 transition count 432
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-35-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-35-LTLFireability-15 finished in 72834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||X(p1)))&&F(p2)))'
[2025-06-01 13:08:33] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16952779238170471351
[2025-06-01 13:08:33] [INFO ] Computing symmetric may disable matrix : 863 transitions.
[2025-06-01 13:08:33] [INFO ] Applying decomposition
[2025-06-01 13:08:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:08:33] [INFO ] Computing symmetric may enable matrix : 863 transitions.
[2025-06-01 13:08:33] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:08:33] [INFO ] Flatten gal took : 26 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/graph16940614994683474538.txt' '-o' '/tmp/graph16940614994683474538.bin' '-w' '/tmp/graph16940614994683474538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16940614994683474538.bin' '-l' '-1' '-v' '-w' '/tmp/graph16940614994683474538.weights' '-q' '0' '-e' '0.001'
[2025-06-01 13:08:33] [INFO ] Decomposing Gal with order
[2025-06-01 13:08:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 13:08:33] [INFO ] Removed a total of 102 redundant transitions.
[2025-06-01 13:08:33] [INFO ] Computing Do-Not-Accords matrix : 863 transitions.
[2025-06-01 13:08:33] [INFO ] Flatten gal took : 48 ms
[2025-06-01 13:08:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-01 13:08:33] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:08:33] [INFO ] Time to serialize gal into /tmp/LTLFireability16294172086751545968.gal : 16 ms
[2025-06-01 13:08:33] [INFO ] Time to serialize properties into /tmp/LTLFireability744421396895991308.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/LTLFireability16294172086751545968.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability744421396895991308.ltl' '-c' '-stutter-deadlock'
[2025-06-01 13:08:33] [INFO ] Built C files in 205ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16952779238170471351
Running compilation step : cd /tmp/ltsmin16952779238170471351;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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 : !(((X((F("((i1.i0.u1.rcv_right_reply_35_2_3>=1)&&(i1.i1.u32.rcv_right_reply_35_5_6<1))"))||(X("((i5.u17.newmsg21>=1)&&(i4.i1.u87.elect...276
Formula 0 simplified : X(G!"((i1.i0.u1.rcv_right_reply_35_2_3>=1)&&(i1.i1.u32.rcv_right_reply_35_5_6<1))" & X!"((i5.u17.newmsg21>=1)&&(i4.i1.u87.election_3...264
Compilation finished in 2406 ms.
Running link step : cd /tmp/ltsmin16952779238170471351;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin16952779238170471351;'/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((LTLAPp1==true))))&&<>((LTLAPp2==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t5, t10, t13, t17, t20, t23, t27, t29, t32, t34, t46, t862, i0.u30.t38, i0.u30.t4...1338
Computing Next relation with stutter on 6.17015e+25 deadlock states
Detected timeout of ITS tools.
[2025-06-01 13:35:21] [INFO ] Flatten gal took : 60 ms
[2025-06-01 13:35:21] [INFO ] Time to serialize gal into /tmp/LTLFireability9243486569281023033.gal : 11 ms
[2025-06-01 13:35:21] [INFO ] Time to serialize properties into /tmp/LTLFireability3207564575662429638.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/LTLFireability9243486569281023033.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3207564575662429638.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !(((X((F("((rcv_right_reply_35_2_3>=1)&&(rcv_right_reply_35_5_6<1))"))||(X("((newmsg21>=1)&&(election_35_6_21_to_right_20>=1))"))))&&(...224
Formula 0 simplified : X(G!"((rcv_right_reply_35_2_3>=1)&&(rcv_right_reply_35_5_6<1))" & X!"((newmsg21>=1)&&(election_35_6_21_to_right_20>=1))") | G!"((rcv...212
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="HirschbergSinclair-PT-35"
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 HirschbergSinclair-PT-35, 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 r114-tall-174876422100108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-35.tgz
mv HirschbergSinclair-PT-35 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 ;