MCC'2025- Execution of r114-tall-174876422100124

About the Execution of ITS-Tools for HirschbergSinclair-PT-45

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	FFFFTTF?FTTFT?F?	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 14K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K 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 616K 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-45-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-45-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748785698386

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-45
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 13:48:19] [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 13:48:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:48:20] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2025-06-01 13:48:20] [INFO ] Transformed 1138 places.
[2025-06-01 13:48:20] [INFO ] Transformed 1042 transitions.
[2025-06-01 13:48:20] [INFO ] Parsed PT model containing 1138 places and 1042 transitions and 3176 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-45-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1042/1042 transitions.
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 1093 transition count 1042
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 85 place count 1053 transition count 1002
Iterating global reduction 1 with 40 rules applied. Total rules applied 125 place count 1053 transition count 1002
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 161 place count 1017 transition count 966
Iterating global reduction 1 with 36 rules applied. Total rules applied 197 place count 1017 transition count 966
Applied a total of 197 rules in 353 ms. Remains 1017 /1138 variables (removed 121) and now considering 966/1042 (removed 76) transitions.
// Phase 1: matrix 966 rows 1017 cols
[2025-06-01 13:48:20] [INFO ] Computed 51 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:48:21] [INFO ] Implicit Places using invariants in 800 ms returned []
[2025-06-01 13:48:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:48:29] [INFO ] Implicit Places using invariants and state equation in 7825 ms returned []
Implicit Place search using SMT with State Equation took 8668 ms to find 0 implicit places.
Running 921 sub problems to find dead transitions.
[2025-06-01 13:48:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 921 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 972/1983 variables, and 6 constraints, problems are : Problem set: 0 solved, 921 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1017 constraints, PredecessorRefiner: 921/921 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 921 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 921 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/972 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 921 unsolved
At refinement iteration 2 (OVERLAPS) 45/1017 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 921 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1017/1983 variables, and 51 constraints, problems are : Problem set: 0 solved, 921 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1017 constraints, PredecessorRefiner: 0/921 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60414ms problems are : Problem set: 0 solved, 921 unsolved
Search for dead transitions found 0 dead transitions in 60432ms
Starting structural reductions in LTL mode, iteration 1 : 1017/1138 places, 966/1042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69482 ms. Remains : 1017/1138 places, 966/1042 transitions.
Support contains 55 out of 1017 places after structural reductions.
[2025-06-01 13:49:30] [INFO ] Flatten gal took : 99 ms
[2025-06-01 13:49:30] [INFO ] Flatten gal took : 62 ms
[2025-06-01 13:49:30] [INFO ] Input system was already deterministic with 966 transitions.
Support contains 50 out of 1017 places (down from 55) after GAL structural reductions.
RANDOM walk for 3607 steps (0 resets) in 380 ms. (9 steps per ms) remains 0/34 properties
FORMULA HirschbergSinclair-PT-45-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HirschbergSinclair-PT-45-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1017 stabilizing places and 966 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1017 transition count 966
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&&X(p1))) U (p2&&X((p0&&X(p1)))))))'
Support contains 6 out of 1017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1017/1017 places, 966/966 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1010 transition count 959
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1010 transition count 959
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 1005 transition count 954
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 1005 transition count 954
Applied a total of 24 rules in 167 ms. Remains 1005 /1017 variables (removed 12) and now considering 954/966 (removed 12) transitions.
// Phase 1: matrix 954 rows 1005 cols
[2025-06-01 13:49:31] [INFO ] Computed 51 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:49:31] [INFO ] Implicit Places using invariants in 516 ms returned []
[2025-06-01 13:49:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:49:42] [INFO ] Implicit Places using invariants and state equation in 10730 ms returned []
Implicit Place search using SMT with State Equation took 11250 ms to find 0 implicit places.
Running 909 sub problems to find dead transitions.
[2025-06-01 13:49:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/1959 variables, and 6 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/960 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 45/1005 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1005/1959 variables, and 51 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60265ms problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 60269ms
Starting structural reductions in LTL mode, iteration 1 : 1005/1017 places, 954/966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71693 ms. Remains : 1005/1017 places, 954/966 transitions.
Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-00 finished in 72161 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&&F(p1))))'
Support contains 3 out of 1017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1017/1017 places, 966/966 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1008 transition count 957
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1008 transition count 957
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 1003 transition count 952
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 1003 transition count 952
Applied a total of 28 rules in 140 ms. Remains 1003 /1017 variables (removed 14) and now considering 952/966 (removed 14) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2025-06-01 13:50:43] [INFO ] Computed 51 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:50:43] [INFO ] Implicit Places using invariants in 542 ms returned []
[2025-06-01 13:50:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:50:55] [INFO ] Implicit Places using invariants and state equation in 11803 ms returned []
Implicit Place search using SMT with State Equation took 12353 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2025-06-01 13:50:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Starting structural reductions in LTL mode, iteration 1 : 1003/1017 places, 952/966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72709 ms. Remains : 1003/1017 places, 952/966 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-01 finished in 72897 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(p0) U X(p1)) U (!p1&&(p2 U G(p1)))))'
Support contains 6 out of 1017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1017/1017 places, 966/966 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1009 transition count 958
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1009 transition count 958
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 1004 transition count 953
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 1004 transition count 953
Applied a total of 26 rules in 137 ms. Remains 1004 /1017 variables (removed 13) and now considering 953/966 (removed 13) transitions.
// Phase 1: matrix 953 rows 1004 cols
[2025-06-01 13:51:56] [INFO ] Computed 51 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:51:56] [INFO ] Implicit Places using invariants in 549 ms returned []
[2025-06-01 13:51:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:52:07] [INFO ] Implicit Places using invariants and state equation in 10712 ms returned []
Implicit Place search using SMT with State Equation took 11273 ms to find 0 implicit places.
Running 908 sub problems to find dead transitions.
[2025-06-01 13: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/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 1.0)
(s13 1.0)
(s15 1.0)
(s17 1.0)
(s19 1.0)
(s21 1.0)
(s23 1.0)
(s25 1.0)
(s27 1.0)
(s29 1.0)
(s31 1.0)
(s33 1.0)
(s35 1.0)
(s37 1.0)
(s39 1.0)
(s41 1.0)
(s43 1.0)
(s45 1.0)
(s47 1.0)
(s49 1.0)
(s51 1.0)
(s53 1.0)
(s55 1.0)
(s57 1.0)
(s59 1.0)
(s61 1.0)
(s63 1.0)
(s65 1.0)
(s67 1.0)
(s69 1.0)
(s71 1.0)
(s73 1.0)
(s75 1.0)
(s77 1.0)
(s79 1.0)
(s81 1.0)
(s83 1.0)
(s85 1.0)
(s87 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 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 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 959/1957 variables, and 6 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 908/908 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 908 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/959 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 2 (OVERLAPS) 45/1004 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 908 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 1004/1957 variables, and 51 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/908 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 908 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Starting structural reductions in LTL mode, iteration 1 : 1004/1017 places, 953/966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71637 ms. Remains : 1004/1017 places, 953/966 transitions.
Stuttering acceptance computed with spot in 586 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p1), (NOT p1), false, false]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-02 finished in 72273 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(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(!p2&&X(X(!p2))&&(p0 U (p1||G(p0)))))))))))'
Support contains 5 out of 1017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1017/1017 places, 966/966 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1009 transition count 958
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1009 transition count 958
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 1005 transition count 954
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 1005 transition count 954
Applied a total of 24 rules in 125 ms. Remains 1005 /1017 variables (removed 12) and now considering 954/966 (removed 12) transitions.
// Phase 1: matrix 954 rows 1005 cols
[2025-06-01 13:53:08] [INFO ] Computed 51 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:53:09] [INFO ] Implicit Places using invariants in 552 ms returned []
[2025-06-01 13:53:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:53:19] [INFO ] Implicit Places using invariants and state equation in 10373 ms returned []
Implicit Place search using SMT with State Equation took 10937 ms to find 0 implicit places.
Running 909 sub problems to find dead transitions.
[2025-06-01 13:53: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/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/1959 variables, and 6 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/960 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 45/1005 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1005/1959 variables, and 51 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 60220ms
Starting structural reductions in LTL mode, iteration 1 : 1005/1017 places, 954/966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71286 ms. Remains : 1005/1017 places, 954/966 transitions.
Stuttering acceptance computed with spot in 431 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-04
Product exploration explored 100000 steps with 16666 reset in 623 ms.
Product exploration explored 100000 steps with 16666 reset in 540 ms.
Computed a total of 1005 stabilizing places and 954 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1005 transition count 954
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 p2) p1), (F (G p0)), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLFireability-04 finished in 73250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1017 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1017/1017 places, 966/966 transitions.
Reduce places removed 45 places and 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 428 transitions
Trivial Post-agglo rules discarded 428 transitions
Performed 428 trivial Post agglomeration. Transition count delta: 428
Iterating post reduction 0 with 428 rules applied. Total rules applied 428 place count 972 transition count 493
Reduce places removed 428 places and 0 transitions.
Iterating post reduction 1 with 428 rules applied. Total rules applied 856 place count 544 transition count 493
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 865 place count 535 transition count 484
Iterating global reduction 2 with 9 rules applied. Total rules applied 874 place count 535 transition count 484
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 878 place count 535 transition count 480
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 882 place count 531 transition count 480
Applied a total of 882 rules in 89 ms. Remains 531 /1017 variables (removed 486) and now considering 480/966 (removed 486) transitions.
// Phase 1: matrix 480 rows 531 cols
[2025-06-01 13:54:21] [INFO ] Computed 51 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:54:22] [INFO ] Implicit Places using invariants in 839 ms returned []
[2025-06-01 13:54:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:54:37] [INFO ] Implicit Places using invariants and state equation in 14536 ms returned []
Implicit Place search using SMT with State Equation took 15393 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:54:37] [INFO ] Redundant transitions in 93 ms returned []
Running 391 sub problems to find dead transitions.
[2025-06-01 13:54:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 837/1011 variables, and 495 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 2/444 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 393/837 variables, 444/495 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 391/886 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 837/1011 variables, and 886 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 444/531 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in SI_LTL mode, iteration 1 : 531/1017 places, 480/966 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75697 ms. Remains : 531/1017 places, 480/966 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-05
Product exploration explored 100000 steps with 190 reset in 425 ms.
Product exploration explored 100000 steps with 190 reset in 393 ms.
Computed a total of 531 stabilizing places and 480 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 531 transition count 480
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLFireability-05 finished in 76787 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(p0)||(X(F(p1))&&F(p2))))'
Support contains 4 out of 1017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1017/1017 places, 966/966 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1008 transition count 957
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1008 transition count 957
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 1003 transition count 952
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 1003 transition count 952
Applied a total of 28 rules in 130 ms. Remains 1003 /1017 variables (removed 14) and now considering 952/966 (removed 14) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2025-06-01 13:55:38] [INFO ] Computed 51 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:55:39] [INFO ] Implicit Places using invariants in 530 ms returned []
[2025-06-01 13:55:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:55:51] [INFO ] Implicit Places using invariants and state equation in 11998 ms returned []
Implicit Place search using SMT with State Equation took 12532 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2025-06-01 13:55:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 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 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 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 Int declared 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60193ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Starting structural reductions in LTL mode, iteration 1 : 1003/1017 places, 952/966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72867 ms. Remains : 1003/1017 places, 952/966 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-07
Product exploration explored 100000 steps with 156 reset in 428 ms.
Product exploration explored 100000 steps with 156 reset in 471 ms.
Computed a total of 1003 stabilizing places and 952 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1003 transition count 952
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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (G p0)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 153 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (36 resets) in 543 ms. (73 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
[2025-06-01 13:56:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 601/604 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 312/916 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/916 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 1868/1955 variables, and 967 constraints, problems are : Problem set: 1 solved, 0 unsolved in 738 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 916/1003 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 748ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (G p0)), (F (G p2)), (F (G (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 19 factoid took 331 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 291 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Support contains 3 out of 1003 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Reduce places removed 44 places and 44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 415 transitions
Trivial Post-agglo rules discarded 415 transitions
Performed 415 trivial Post agglomeration. Transition count delta: 415
Iterating post reduction 0 with 415 rules applied. Total rules applied 415 place count 959 transition count 493
Reduce places removed 415 places and 0 transitions.
Iterating post reduction 1 with 415 rules applied. Total rules applied 830 place count 544 transition count 493
Applied a total of 830 rules in 44 ms. Remains 544 /1003 variables (removed 459) and now considering 493/952 (removed 459) transitions.
// Phase 1: matrix 493 rows 544 cols
[2025-06-01 13:56:55] [INFO ] Computed 51 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:56:55] [INFO ] Implicit Places using invariants in 837 ms returned []
[2025-06-01 13:56:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:57:08] [INFO ] Implicit Places using invariants and state equation in 13019 ms returned []
Implicit Place search using SMT with State Equation took 13857 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:57:08] [INFO ] Redundant transitions in 13 ms returned []
Running 407 sub problems to find dead transitions.
[2025-06-01 13:57: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/458 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 3/461 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (OVERLAPS) 410/871 variables, 461/512 constraints. Problems are: Problem set: 0 solved, 407 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 871/1037 variables, and 512 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 461/544 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 3/461 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (OVERLAPS) 410/871 variables, 461/512 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/871 variables, 407/919 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/1037 variables, and 919 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 461/544 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in SI_LTL mode, iteration 1 : 544/1003 places, 493/952 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74026 ms. Remains : 544/1003 places, 493/952 transitions.
Computed a total of 544 stabilizing places and 493 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 544 transition count 493
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 (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 209 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 40000 steps (68 resets) in 370 ms. (107 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
[2025-06-01 13:58:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 329/332 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 125/457 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 865/1037 variables, and 508 constraints, problems are : Problem set: 1 solved, 0 unsolved in 453 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 457/544 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 469ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (G (NOT p1))), (F (G p0)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 16 factoid took 288 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 326 reset in 406 ms.
Product exploration explored 100000 steps with 325 reset in 430 ms.
Built C files in :
/tmp/ltsmin12464589765812918055
[2025-06-01 13:58:12] [INFO ] Computing symmetric may disable matrix : 493 transitions.
[2025-06-01 13:58:12] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:58:12] [INFO ] Computing symmetric may enable matrix : 493 transitions.
[2025-06-01 13:58:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:58:12] [INFO ] Computing Do-Not-Accords matrix : 493 transitions.
[2025-06-01 13:58:12] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:58:12] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12464589765812918055
Running compilation step : cd /tmp/ltsmin12464589765812918055;'/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 1224 ms.
Running link step : cd /tmp/ltsmin12464589765812918055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin12464589765812918055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased69556357729082581.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 493/493 transitions.
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 0 with 1 rules applied. Total rules applied 1 place count 544 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 543 transition count 492
Applied a total of 2 rules in 35 ms. Remains 543 /544 variables (removed 1) and now considering 492/493 (removed 1) transitions.
// Phase 1: matrix 492 rows 543 cols
[2025-06-01 13:58:27] [INFO ] Computed 51 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:58:28] [INFO ] Implicit Places using invariants in 893 ms returned []
[2025-06-01 13:58:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 13:58:41] [INFO ] Implicit Places using invariants and state equation in 13074 ms returned []
Implicit Place search using SMT with State Equation took 13976 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 13:58:41] [INFO ] Redundant transitions in 4 ms returned []
Running 406 sub problems to find dead transitions.
[2025-06-01 13:58:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 3/460 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 409/869 variables, 460/511 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/1035 variables, and 511 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 460/543 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 3/460 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 409/869 variables, 460/511 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/869 variables, 406/917 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/1035 variables, and 917 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 460/543 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Starting structural reductions in SI_LTL mode, iteration 1 : 543/544 places, 492/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74097 ms. Remains : 543/544 places, 492/493 transitions.
Built C files in :
/tmp/ltsmin6120296318640139495
[2025-06-01 13:59:41] [INFO ] Computing symmetric may disable matrix : 492 transitions.
[2025-06-01 13:59:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:59:41] [INFO ] Computing symmetric may enable matrix : 492 transitions.
[2025-06-01 13:59:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:59:41] [INFO ] Computing Do-Not-Accords matrix : 492 transitions.
[2025-06-01 13:59:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 13:59:41] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6120296318640139495
Running compilation step : cd /tmp/ltsmin6120296318640139495;'/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 1101 ms.
Running link step : cd /tmp/ltsmin6120296318640139495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6120296318640139495;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18407841737145214799.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 13:59:56] [INFO ] Flatten gal took : 19 ms
[2025-06-01 13:59:56] [INFO ] Flatten gal took : 20 ms
[2025-06-01 13:59:56] [INFO ] Time to serialize gal into /tmp/LTL2598179430299263640.gal : 4 ms
[2025-06-01 13:59:56] [INFO ] Time to serialize properties into /tmp/LTL66485590234644127.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2598179430299263640.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1210862268781258562.hoa' '-atoms' '/tmp/LTL66485590234644127.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...315
Loading property file /tmp/LTL66485590234644127.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1210862268781258562.hoa
Reverse transition relation is NOT exact ! Due to transitions t14, t47.t48, t51.t52, t55.t56, t59.t60, t65.t66, t69.t70, t73.t74, t77.t78, t81.t82, t85.t86...649
Computing Next relation with stutter on 3.06954e+32 deadlock states
Detected timeout of ITS tools.
[2025-06-01 14:00:11] [INFO ] Flatten gal took : 24 ms
[2025-06-01 14:00:11] [INFO ] Flatten gal took : 18 ms
[2025-06-01 14:00:11] [INFO ] Time to serialize gal into /tmp/LTL9695376957578637455.gal : 4 ms
[2025-06-01 14:00:11] [INFO ] Time to serialize properties into /tmp/LTL11303185418031484069.ltl : 3 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/LTL9695376957578637455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11303185418031484069.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("((newmsg15<1)||(reply_45_5_to_right_14<1))"))||((X(F("(rcv_right_election_45_5_20_25>=1)")))&&(F("(rcv_right_election_45_6_4_41...164
Formula 0 simplified : F!"((newmsg15<1)||(reply_45_5_to_right_14<1))" & (XG!"(rcv_right_election_45_5_20_25>=1)" | G!"(rcv_right_election_45_6_4_41<1)")
Reverse transition relation is NOT exact ! Due to transitions t14, t47.t48, t51.t52, t55.t56, t59.t60, t65.t66, t69.t70, t73.t74, t77.t78, t81.t82, t85.t86...649
Computing Next relation with stutter on 3.06954e+32 deadlock states
Detected timeout of ITS tools.
[2025-06-01 14:00:26] [INFO ] Flatten gal took : 17 ms
[2025-06-01 14:00:26] [INFO ] Applying decomposition
[2025-06-01 14:00:26] [INFO ] Flatten gal took : 17 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/graph12796597098558138739.txt' '-o' '/tmp/graph12796597098558138739.bin' '-w' '/tmp/graph12796597098558138739.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12796597098558138739.bin' '-l' '-1' '-v' '-w' '/tmp/graph12796597098558138739.weights' '-q' '0' '-e' '0.001'
[2025-06-01 14:00:26] [INFO ] Decomposing Gal with order
[2025-06-01 14:00:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 14:00:27] [INFO ] Removed a total of 327 redundant transitions.
[2025-06-01 14:00:27] [INFO ] Flatten gal took : 116 ms
[2025-06-01 14:00:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 24 ms.
[2025-06-01 14:00:27] [INFO ] Time to serialize gal into /tmp/LTL798260204866828246.gal : 8 ms
[2025-06-01 14:00:27] [INFO ] Time to serialize properties into /tmp/LTL5517968287303473379.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/LTL798260204866828246.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5517968287303473379.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...253
Read 1 LTL properties
Checking formula 0 : !(((G("((i0.u0.newmsg15<1)||(i4.u115.reply_45_5_to_right_14<1))"))||((X(F("(i5.u109.rcv_right_election_45_5_20_25>=1)")))&&(F("(i1.u1....192
Formula 0 simplified : F!"((i0.u0.newmsg15<1)||(i4.u115.reply_45_5_to_right_14<1))" & (XG!"(i5.u109.rcv_right_election_45_5_20_25>=1)" | G!"(i1.u1.rcv_righ...180
Reverse transition relation is NOT exact ! Due to transitions t47_t48, t73_t74, t105_t106, t153_t154, t196_t197, t220_t221, t562_t563, t676_t677, i0.t122_t...798
Computing Next relation with stutter on 3.06954e+32 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-07 finished in 303837 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(G(p0)))))'
Support contains 2 out of 1017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1017/1017 places, 966/966 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1008 transition count 957
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1008 transition count 957
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 1003 transition count 952
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 1003 transition count 952
Applied a total of 28 rules in 83 ms. Remains 1003 /1017 variables (removed 14) and now considering 952/966 (removed 14) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2025-06-01 14:00:42] [INFO ] Computed 51 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:00:43] [INFO ] Implicit Places using invariants in 689 ms returned []
[2025-06-01 14:00:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:00:54] [INFO ] Implicit Places using invariants and state equation in 11140 ms returned []
Implicit Place search using SMT with State Equation took 11833 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2025-06-01 14:00:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in LTL mode, iteration 1 : 1003/1017 places, 952/966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72103 ms. Remains : 1003/1017 places, 952/966 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-08 finished in 72315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||(X(X(X(X(p1))))&&G(p2)))))'
Support contains 3 out of 1017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1017/1017 places, 966/966 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1010 transition count 959
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1010 transition count 959
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 1007 transition count 956
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 1007 transition count 956
Applied a total of 20 rules in 92 ms. Remains 1007 /1017 variables (removed 10) and now considering 956/966 (removed 10) transitions.
// Phase 1: matrix 956 rows 1007 cols
[2025-06-01 14:01:54] [INFO ] Computed 51 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:01:55] [INFO ] Implicit Places using invariants in 543 ms returned []
[2025-06-01 14:01:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:02:06] [INFO ] Implicit Places using invariants and state equation in 11721 ms returned []
Implicit Place search using SMT with State Equation took 12267 ms to find 0 implicit places.
Running 911 sub problems to find dead transitions.
[2025-06-01 14:02:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/962 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 911 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 962/1963 variables, and 6 constraints, problems are : Problem set: 0 solved, 911 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1007 constraints, PredecessorRefiner: 911/911 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 911 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/962 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 911 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/962 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 911 unsolved
At refinement iteration 2 (OVERLAPS) 45/1007 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 911 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1963 variables, and 51 constraints, problems are : Problem set: 0 solved, 911 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1007 constraints, PredecessorRefiner: 0/911 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 911 unsolved
Search for dead transitions found 0 dead transitions in 60194ms
Starting structural reductions in LTL mode, iteration 1 : 1007/1017 places, 956/966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72556 ms. Remains : 1007/1017 places, 956/966 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-10
Product exploration explored 100000 steps with 382 reset in 641 ms.
Product exploration explored 100000 steps with 357 reset in 635 ms.
Computed a total of 1007 stabilizing places and 956 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1007 transition count 956
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 p1), (X p0), (X (X p0)), (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLFireability-10 finished in 74451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(p0)||G(p1)) U (p2&&X(p3))))))'
Support contains 4 out of 1017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1017/1017 places, 966/966 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1009 transition count 958
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1009 transition count 958
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 1005 transition count 954
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 1005 transition count 954
Applied a total of 24 rules in 97 ms. Remains 1005 /1017 variables (removed 12) and now considering 954/966 (removed 12) transitions.
// Phase 1: matrix 954 rows 1005 cols
[2025-06-01 14:03:09] [INFO ] Computed 51 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:03:09] [INFO ] Implicit Places using invariants in 553 ms returned []
[2025-06-01 14:03:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:03:20] [INFO ] Implicit Places using invariants and state equation in 11146 ms returned []
Implicit Place search using SMT with State Equation took 11701 ms to find 0 implicit places.
Running 909 sub problems to find dead transitions.
[2025-06-01 14:03: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/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/1959 variables, and 6 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/960 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 45/1005 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1005/1959 variables, and 51 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60204ms problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Starting structural reductions in LTL mode, iteration 1 : 1005/1017 places, 954/966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72007 ms. Remains : 1005/1017 places, 954/966 transitions.
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p0) (NOT p1) p2 (NOT p3))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-11
Product exploration explored 100000 steps with 749 reset in 650 ms.
Product exploration explored 100000 steps with 781 reset in 695 ms.
Computed a total of 1005 stabilizing places and 954 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1005 transition count 954
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) (NOT p3)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p3))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 143 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p3), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p0) (NOT p1) p2 (NOT p3))]
RANDOM walk for 40000 steps (36 resets) in 423 ms. (94 steps per ms) remains 6/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
[2025-06-01 14:04:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 846/850 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 67/917 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/917 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 954/1871 variables, 917/968 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1871 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 88/1959 variables, 88/1056 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1959 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/1959 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1959/1959 variables, and 1056 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3160 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 1005/1005 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 846/850 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 67/917 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/917 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 954/1871 variables, 917/968 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1871 variables, 1/969 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1871 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 88/1959 variables, 88/1057 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1959 variables, 5/1062 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1959 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1959/1959 variables, and 1062 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5012 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 1005/1005 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8186ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1005 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1005/1005 places, 954/954 transitions.
Graph (complete) has 1918 edges and 1005 vertex of which 960 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.3 ms
Discarding 45 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 426 transitions
Trivial Post-agglo rules discarded 426 transitions
Performed 426 trivial Post agglomeration. Transition count delta: 426
Iterating post reduction 0 with 471 rules applied. Total rules applied 472 place count 960 transition count 483
Reduce places removed 426 places and 0 transitions.
Graph (complete) has 932 edges and 534 vertex of which 262 are kept as prefixes of interest. Removing 272 places using SCC suffix rule.1 ms
Discarding 272 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 427 rules applied. Total rules applied 899 place count 262 transition count 482
Drop transitions (Empty/Sink Transition effects.) removed 270 transitions
Reduce isomorphic transitions removed 270 transitions.
Iterating post reduction 2 with 270 rules applied. Total rules applied 1169 place count 262 transition count 212
Reduce places removed 44 places and 44 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 1213 place count 218 transition count 168
Reduce places removed 41 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 3 with 169 rules applied. Total rules applied 1382 place count 177 transition count 40
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 4 with 128 rules applied. Total rules applied 1510 place count 49 transition count 40
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 1510 place count 49 transition count 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 43 rules applied. Total rules applied 1553 place count 26 transition count 20
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 3 rules applied. Total rules applied 1556 place count 25 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1558 place count 23 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1558 place count 23 transition count 17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1560 place count 22 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 1562 place count 21 transition count 16
Applied a total of 1562 rules in 50 ms. Remains 21 /1005 variables (removed 984) and now considering 16/954 (removed 938) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 21/1005 places, 16/954 transitions.
RANDOM walk for 40000 steps (2352 resets) in 352 ms. (113 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (881 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1077 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (898 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (900 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (871 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
// Phase 1: matrix 16 rows 21 cols
[2025-06-01 14:04:32] [INFO ] Computed 5 invariants in 0 ms
[2025-06-01 14:04:32] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/15 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 5/20 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/25 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 5/30 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 6/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 36/37 variables, and 27 constraints, problems are : Problem set: 5 solved, 0 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p3)), (G (OR p0 (NOT p1) p2 p3)), (G (OR p0 (NOT p1) (NOT p2) p3)), (G (OR (NOT p2) p3)), (G (OR p0 p1 (NOT p2) p3)), (G (AND (OR p0 (NOT p1) p3) (OR p0 (NOT p2) p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F p2), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 17 factoid took 558 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p3)]
// Phase 1: matrix 954 rows 1005 cols
[2025-06-01 14:04:33] [INFO ] Computed 51 invariants in 4 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 14:04:34] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 227 ms returned sat
[2025-06-01 14:04:48] [INFO ] [Real]Absence check using state equation in 14207 ms returned unknown
Could not prove EG (NOT p2)
[2025-06-01 14:04:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 14:04:49] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 203 ms returned sat
[2025-06-01 14:05:03] [INFO ] [Real]Absence check using state equation in 14172 ms returned unknown
Could not prove EG (NOT p3)
Support contains 4 out of 1005 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1005/1005 places, 954/954 transitions.
Applied a total of 0 rules in 39 ms. Remains 1005 /1005 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2025-06-01 14:05:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:05:04] [INFO ] Implicit Places using invariants in 552 ms returned []
[2025-06-01 14:05:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:05:15] [INFO ] Implicit Places using invariants and state equation in 11206 ms returned []
Implicit Place search using SMT with State Equation took 11768 ms to find 0 implicit places.
Running 909 sub problems to find dead transitions.
[2025-06-01 14:05:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/1959 variables, and 6 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/960 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 45/1005 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 909 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 1005/1959 variables, and 51 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1005 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 60236ms
Finished structural reductions in LTL mode , in 1 iterations and 72045 ms. Remains : 1005/1005 places, 954/954 transitions.
Computed a total of 1005 stabilizing places and 954 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1005 transition count 954
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) (NOT p3)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p3))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 83 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p3)]
RANDOM walk for 2678 steps (0 resets) in 51 ms. (51 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p3))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p3), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F p1)]
Knowledge based reduction with 10 factoid took 398 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p3)]
[2025-06-01 14:06:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 14:06:18] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 197 ms returned sat
[2025-06-01 14:06:32] [INFO ] [Real]Absence check using state equation in 14203 ms returned unknown
Could not prove EG (NOT p2)
[2025-06-01 14:06:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 14:06:33] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 188 ms returned sat
[2025-06-01 14:06:47] [INFO ] [Real]Absence check using state equation in 14279 ms returned unknown
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p3)]
Product exploration explored 100000 steps with 773 reset in 635 ms.
Product exploration explored 100000 steps with 758 reset in 685 ms.
Applying partial POR strategy [false, false, false, true, true, false]
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p3)]
Support contains 4 out of 1005 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1005/1005 places, 954/954 transitions.
Performed 426 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 426 rules applied. Total rules applied 426 place count 1005 transition count 954
Deduced a syphon composed of 426 places in 5 ms
Applied a total of 426 rules in 198 ms. Remains 1005 /1005 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 14:06:49] [INFO ] Redundant transitions in 7 ms returned []
Running 909 sub problems to find dead transitions.
// Phase 1: matrix 954 rows 1005 cols
[2025-06-01 14:06:49] [INFO ] Computed 51 invariants in 8 ms
[2025-06-01 14:06:49] [INFO ] State equation strengthened by 426 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/1959 variables, and 6 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1005 constraints, ReadFeed: 0/426 constraints, PredecessorRefiner: 909/909 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 909 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/960 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/960 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 909 unsolved
At refinement iteration 2 (OVERLAPS) 45/1005 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 909 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 1005/1959 variables, and 51 constraints, problems are : Problem set: 0 solved, 909 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1005 constraints, ReadFeed: 0/426 constraints, PredecessorRefiner: 0/909 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1005/1005 places, 954/954 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60440 ms. Remains : 1005/1005 places, 954/954 transitions.
Built C files in :
/tmp/ltsmin2721246330012905168
[2025-06-01 14:07:50] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2721246330012905168
Running compilation step : cd /tmp/ltsmin2721246330012905168;'/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 1583 ms.
Running link step : cd /tmp/ltsmin2721246330012905168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2721246330012905168;'/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/stateBased772019428235001041.hoa' '--buchi-type=spotba'
LTSmin run took 1426 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-45-LTLFireability-11 finished in 284065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 1017 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1017/1017 places, 966/966 transitions.
Reduce places removed 44 places and 44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 413 transitions
Trivial Post-agglo rules discarded 413 transitions
Performed 413 trivial Post agglomeration. Transition count delta: 413
Iterating post reduction 0 with 413 rules applied. Total rules applied 413 place count 973 transition count 509
Reduce places removed 413 places and 0 transitions.
Iterating post reduction 1 with 413 rules applied. Total rules applied 826 place count 560 transition count 509
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 835 place count 551 transition count 500
Iterating global reduction 2 with 9 rules applied. Total rules applied 844 place count 551 transition count 500
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 848 place count 551 transition count 496
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 852 place count 547 transition count 496
Applied a total of 852 rules in 58 ms. Remains 547 /1017 variables (removed 470) and now considering 496/966 (removed 470) transitions.
// Phase 1: matrix 496 rows 547 cols
[2025-06-01 14:07:53] [INFO ] Computed 51 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:07:54] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2025-06-01 14:07:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:08:07] [INFO ] Implicit Places using invariants and state equation in 13751 ms returned []
Implicit Place search using SMT with State Equation took 14786 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 14:08:07] [INFO ] Redundant transitions in 3 ms returned []
Running 409 sub problems to find dead transitions.
[2025-06-01 14:08: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/460 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 1/461 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 410/871 variables, 461/512 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/1043 variables, and 512 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 461/547 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/460 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/460 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 1/461 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 410/871 variables, 461/512 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/871 variables, 409/921 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/1043 variables, and 921 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 461/547 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in SI_LTL mode, iteration 1 : 547/1017 places, 496/966 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74943 ms. Remains : 547/1017 places, 496/966 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-12
Product exploration explored 100000 steps with 604 reset in 533 ms.
Product exploration explored 100000 steps with 590 reset in 553 ms.
Computed a total of 547 stabilizing places and 496 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 547 transition count 496
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 (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 12 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-45-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLFireability-12 finished in 76330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U X(p1)))))'
Support contains 2 out of 1017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1017/1017 places, 966/966 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1008 transition count 957
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1008 transition count 957
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 1003 transition count 952
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 1003 transition count 952
Applied a total of 28 rules in 116 ms. Remains 1003 /1017 variables (removed 14) and now considering 952/966 (removed 14) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2025-06-01 14:09:09] [INFO ] Computed 51 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:09:10] [INFO ] Implicit Places using invariants in 515 ms returned []
[2025-06-01 14:09:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:09:22] [INFO ] Implicit Places using invariants and state equation in 12351 ms returned []
Implicit Place search using SMT with State Equation took 12872 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2025-06-01 14:09:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 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 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in LTL mode, iteration 1 : 1003/1017 places, 952/966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73168 ms. Remains : 1003/1017 places, 952/966 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-13
Product exploration explored 100000 steps with 270 reset in 614 ms.
Product exploration explored 100000 steps with 271 reset in 591 ms.
Computed a total of 1003 stabilizing places and 952 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1003 transition count 952
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)), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 3655 steps (0 resets) in 48 ms. (74 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
[2025-06-01 14:10:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 14:10:26] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 210 ms returned sat
[2025-06-01 14:10:29] [INFO ] [Real]Absence check using state equation in 3410 ms returned sat
[2025-06-01 14:10:29] [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 14:10:30] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 229 ms returned sat
[2025-06-01 14:10:34] [INFO ] [Nat]Absence check using state equation in 4228 ms returned sat
[2025-06-01 14:10:34] [INFO ] Computed and/alt/rep : 434/440/434 causal constraints (skipped 473 transitions) in 64 ms.
[2025-06-01 14:10:36] [INFO ] Added : 134 causal constraints over 27 iterations in 1697 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Applied a total of 0 rules in 50 ms. Remains 1003 /1003 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2025-06-01 14:10:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:10:37] [INFO ] Implicit Places using invariants in 530 ms returned []
[2025-06-01 14:10:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:10:49] [INFO ] Implicit Places using invariants and state equation in 11982 ms returned []
Implicit Place search using SMT with State Equation took 12514 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2025-06-01 14:10:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
(s832 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 1.0)
(s13 1.0)
(s15 1.0)
(s17 1.0)
(s19 1.0)
(s21 1.0)
(s23 1.0)
(s25 1.0)
(s27 1.0)
(s29 1.0)
(s31 1.0)
(s33 1.0)
(s35 1.0)
(s37 1.0)
(s39 1.0)
(s41 1.0)
(s43 1.0)
(s45 1.0)
(s47 1.0)
(s49 1.0)
(s51 1.0)
(s53 1.0)
(s55 1.0)
(s57 1.0)
(s59 1.0)
(s61 1.0)
(s63 1.0)
(s65 1.0)
(s67 1.0)
(s69 1.0)
(s71 1.0)
(s73 1.0)
(s75 1.0)
(s77 1.0)
(s79 1.0)
(s81 1.0)
(s83 1.0)
(s85 1.0)
(s87 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 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 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 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 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 722)
(s1 1)
(s2 722)
(s3 1)
(s4 0)
(s5 1)
(s6 722)
(s7 1)
(s8 722)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 0)
(s19 720)
(s20 718)
(s21 1)
(s22 717)
(s23 1)
(s24 0)
(s25 716)
(s26 713)
(s27 1)
(s28 0)
(s29 1)
(s30 712)
(s31 1)
(s32 0)
(s33 1)
(s34 0)
(s35 712)
(s36 0)
(s37 711)
(s38 0)
(s39 710)
(s40 708)
(s41 1)
(s42 0)
(s43 708)
(s44 0)
(s45 1)
(s46 0)
(s47 706)
(s48 0)
(s49 705)
(s50 703)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 699)
(s57 1)
(s58 0)
(s59 698)
(s60 0)
(s61 697)
(s62 0)
(s63 697)
(s64 696)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 693)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 689)
(s78 0)
(s79 688)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 682)
(s86 679)
(s87 1)
(s88 0)
(s89 724)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 723)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 722)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 721)
(s118 1)
(s119 721)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 721)
(s128 1)
(s129 1)
(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 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 713)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 713)
(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 707)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 703)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 702)
(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 695)
(s226 1)
(s227 696)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 692)
(s234 1)
(s235 1)
(s236 1)
(s237 690)
(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 684)
(s254 1)
(s255 686)
(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 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Finished structural reductions in LTL mode , in 1 iterations and 72746 ms. Remains : 1003/1003 places, 952/952 transitions.
Computed a total of 1003 stabilizing places and 952 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1003 transition count 952
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)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 3587 steps (0 resets) in 42 ms. (83 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
[2025-06-01 14:11:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 14:11:51] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 216 ms returned sat
[2025-06-01 14:11:54] [INFO ] [Real]Absence check using state equation in 3478 ms returned sat
[2025-06-01 14:11:54] [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 14:11:55] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 222 ms returned sat
[2025-06-01 14:11:59] [INFO ] [Nat]Absence check using state equation in 4180 ms returned sat
[2025-06-01 14:11:59] [INFO ] Computed and/alt/rep : 434/440/434 causal constraints (skipped 473 transitions) in 55 ms.
[2025-06-01 14:12:01] [INFO ] Added : 134 causal constraints over 27 iterations in 1605 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 271 reset in 537 ms.
Product exploration explored 100000 steps with 271 reset in 560 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Performed 426 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 426 rules applied. Total rules applied 426 place count 1003 transition count 952
Deduced a syphon composed of 426 places in 5 ms
Applied a total of 426 rules in 87 ms. Remains 1003 /1003 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 14:12:03] [INFO ] Redundant transitions in 7 ms returned []
Running 907 sub problems to find dead transitions.
// Phase 1: matrix 952 rows 1003 cols
[2025-06-01 14:12:03] [INFO ] Computed 51 invariants in 3 ms
[2025-06-01 14:12:03] [INFO ] State equation strengthened by 426 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
(s225 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 1.0)
(s13 1.0)
(s15 1.0)
(s17 1.0)
(s19 1.0)
(s21 1.0)
(s23 1.0)
(s25 1.0)
(s27 1.0)
(s29 1.0)
(s31 1.0)
(s33 1.0)
(s35 1.0)
(s37 1.0)
(s39 1.0)
(s41 1.0)
(s43 1.0)
(s45 1.0)
(s47 1.0)
(s49 1.0)
(s51 1.0)
(s53 1.0)
(s55 1.0)
(s57 1.0)
(s59 1.0)
(s61 1.0)
(s63 1.0)
(s65 1.0)
(s67 1.0)
(s69 1.0)
(s71 1.0)
(s73 1.0)
(s75 1.0)
(s77 1.0)
(s79 1.0)
(s81 1.0)
(s83 1.0)
(s85 1.0)
(s87 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 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 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, ReadFeed: 0/426 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 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 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, ReadFeed: 0/426 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/1003 places, 952/952 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60258 ms. Remains : 1003/1003 places, 952/952 transitions.
Built C files in :
/tmp/ltsmin15881150915316170361
[2025-06-01 14:13:03] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15881150915316170361
Running compilation step : cd /tmp/ltsmin15881150915316170361;'/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 1659 ms.
Running link step : cd /tmp/ltsmin15881150915316170361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15881150915316170361;'/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/stateBased12432319433132437784.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 952/952 transitions.
Applied a total of 0 rules in 45 ms. Remains 1003 /1003 variables (removed 0) and now considering 952/952 (removed 0) transitions.
// Phase 1: matrix 952 rows 1003 cols
[2025-06-01 14:13:18] [INFO ] Computed 51 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:13:19] [INFO ] Implicit Places using invariants in 545 ms returned []
[2025-06-01 14:13:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:13:31] [INFO ] Implicit Places using invariants and state equation in 12082 ms returned []
Implicit Place search using SMT with State Equation took 12629 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2025-06-01 14:13:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 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 Int declared 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Finished structural reductions in LTL mode , in 1 iterations and 72874 ms. Remains : 1003/1003 places, 952/952 transitions.
Built C files in :
/tmp/ltsmin7334642063373538272
[2025-06-01 14:14:31] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7334642063373538272
Running compilation step : cd /tmp/ltsmin7334642063373538272;'/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 1675 ms.
Running link step : cd /tmp/ltsmin7334642063373538272;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7334642063373538272;'/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/stateBased16874699724065297556.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 14:14:46] [INFO ] Flatten gal took : 32 ms
[2025-06-01 14:14:46] [INFO ] Flatten gal took : 31 ms
[2025-06-01 14:14:46] [INFO ] Time to serialize gal into /tmp/LTL14261319026115526694.gal : 9 ms
[2025-06-01 14:14:46] [INFO ] Time to serialize properties into /tmp/LTL4978107353309419152.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/LTL14261319026115526694.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16716387289913155398.hoa' '-atoms' '/tmp/LTL4978107353309419152.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4978107353309419152.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16716387289913155398.hoa
Detected timeout of ITS tools.
[2025-06-01 14:15:01] [INFO ] Flatten gal took : 25 ms
[2025-06-01 14:15:01] [INFO ] Flatten gal took : 25 ms
[2025-06-01 14:15:01] [INFO ] Time to serialize gal into /tmp/LTL10807459048803288525.gal : 6 ms
[2025-06-01 14:15:01] [INFO ] Time to serialize properties into /tmp/LTL17769484549386758220.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10807459048803288525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17769484549386758220.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X(("(rcv_left_election_45_6_23_23<1)")U(X("(rcv_left_election_45_3_1_1>=1)"))))))
Formula 0 simplified : XX(!"(rcv_left_election_45_6_23_23<1)" R X!"(rcv_left_election_45_3_1_1>=1)")
Detected timeout of ITS tools.
[2025-06-01 14:15:16] [INFO ] Flatten gal took : 24 ms
[2025-06-01 14:15:16] [INFO ] Applying decomposition
[2025-06-01 14:15:16] [INFO ] Flatten gal took : 25 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/graph17076277642979021375.txt' '-o' '/tmp/graph17076277642979021375.bin' '-w' '/tmp/graph17076277642979021375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17076277642979021375.bin' '-l' '-1' '-v' '-w' '/tmp/graph17076277642979021375.weights' '-q' '0' '-e' '0.001'
[2025-06-01 14:15:17] [INFO ] Decomposing Gal with order
[2025-06-01 14:15:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 14:15:17] [INFO ] Removed a total of 100 redundant transitions.
[2025-06-01 14:15:17] [INFO ] Flatten gal took : 129 ms
[2025-06-01 14:15:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2025-06-01 14:15:17] [INFO ] Time to serialize gal into /tmp/LTL14472633259703262029.gal : 27 ms
[2025-06-01 14:15:17] [INFO ] Time to serialize properties into /tmp/LTL464059505035872375.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/LTL14472633259703262029.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL464059505035872375.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...254
Read 1 LTL properties
Checking formula 0 : !((X(X(("(i11.i0.u46.rcv_left_election_45_6_23_23<1)")U(X("(i0.u0.rcv_left_election_45_3_1_1>=1)"))))))
Formula 0 simplified : XX(!"(i11.i0.u46.rcv_left_election_45_6_23_23<1)" R X!"(i0.u0.rcv_left_election_45_3_1_1>=1)")
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-13 finished in 382917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&F(p1)))))'
Support contains 3 out of 1017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1017/1017 places, 966/966 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1008 transition count 957
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1008 transition count 957
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 1003 transition count 952
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 1003 transition count 952
Applied a total of 28 rules in 148 ms. Remains 1003 /1017 variables (removed 14) and now considering 952/966 (removed 14) transitions.
[2025-06-01 14:15:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:15:33] [INFO ] Implicit Places using invariants in 575 ms returned []
[2025-06-01 14:15:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:15:45] [INFO ] Implicit Places using invariants and state equation in 11955 ms returned []
Implicit Place search using SMT with State Equation took 12534 ms to find 0 implicit places.
Running 907 sub problems to find dead transitions.
[2025-06-01 14:15:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 958/1955 variables, and 6 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 907/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 907 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/958 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/958 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 907 unsolved
At refinement iteration 2 (OVERLAPS) 45/1003 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 907 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1955 variables, and 51 constraints, problems are : Problem set: 0 solved, 907 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/907 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 907 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 1003/1017 places, 952/966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72866 ms. Remains : 1003/1017 places, 952/966 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-14
Stuttering criterion allowed to conclude after 1034 steps with 0 reset in 6 ms.
FORMULA HirschbergSinclair-PT-45-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLFireability-14 finished in 73128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Support contains 5 out of 1017 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1017/1017 places, 966/966 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1009 transition count 958
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1009 transition count 958
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 1004 transition count 953
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 1004 transition count 953
Applied a total of 26 rules in 129 ms. Remains 1004 /1017 variables (removed 13) and now considering 953/966 (removed 13) transitions.
// Phase 1: matrix 953 rows 1004 cols
[2025-06-01 14:16:45] [INFO ] Computed 51 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:16:46] [INFO ] Implicit Places using invariants in 541 ms returned []
[2025-06-01 14:16:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:16:57] [INFO ] Implicit Places using invariants and state equation in 11103 ms returned []
Implicit Place search using SMT with State Equation took 11648 ms to find 0 implicit places.
Running 908 sub problems to find dead transitions.
[2025-06-01 14:16: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/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 959/1957 variables, and 6 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 908/908 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 908 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/959 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 2 (OVERLAPS) 45/1004 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 908 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 Int declared 1004/1957 variables, and 51 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/908 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 908 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Starting structural reductions in LTL mode, iteration 1 : 1004/1017 places, 953/966 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71988 ms. Remains : 1004/1017 places, 953/966 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-15
Product exploration explored 100000 steps with 1402 reset in 669 ms.
Product exploration explored 100000 steps with 1420 reset in 715 ms.
Computed a total of 1004 stabilizing places and 953 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1004 transition count 953
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) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 272 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 431 steps (0 resets) in 10 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 9 factoid took 361 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-06-01 14:18:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 14:18:01] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 232 ms returned sat
[2025-06-01 14:18:05] [INFO ] [Real]Absence check using state equation in 3801 ms returned sat
[2025-06-01 14:18:05] [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 14:18:06] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 247 ms returned sat
[2025-06-01 14:18:20] [INFO ] [Nat]Absence check using state equation in 14127 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 1004 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 953/953 transitions.
Applied a total of 0 rules in 45 ms. Remains 1004 /1004 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2025-06-01 14:18:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:18:20] [INFO ] Implicit Places using invariants in 523 ms returned []
[2025-06-01 14:18:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:18:31] [INFO ] Implicit Places using invariants and state equation in 11066 ms returned []
Implicit Place search using SMT with State Equation took 11595 ms to find 0 implicit places.
Running 908 sub problems to find dead transitions.
[2025-06-01 14:18:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 1.0)
(s13 1.0)
(s15 1.0)
(s17 1.0)
(s19 1.0)
(s21 1.0)
(s23 1.0)
(s25 1.0)
(s27 1.0)
(s29 1.0)
(s31 1.0)
(s33 1.0)
(s35 1.0)
(s37 1.0)
(s39 1.0)
(s41 1.0)
(s43 1.0)
(s45 1.0)
(s47 1.0)
(s49 1.0)
(s51 1.0)
(s53 1.0)
(s55 1.0)
(s57 1.0)
(s59 1.0)
(s61 1.0)
(s63 1.0)
(s65 1.0)
(s67 1.0)
(s69 1.0)
(s71 1.0)
(s73 1.0)
(s75 1.0)
(s77 1.0)
(s79 1.0)
(s81 1.0)
(s83 1.0)
(s85 1.0)
(s87 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 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 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 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 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 959/1957 variables, and 6 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 908/908 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 908 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/959 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 2 (OVERLAPS) 45/1004 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 908 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 1004/1957 variables, and 51 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/908 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60205ms problems are : Problem set: 0 solved, 908 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Finished structural reductions in LTL mode , in 1 iterations and 71852 ms. Remains : 1004/1004 places, 953/953 transitions.
Computed a total of 1004 stabilizing places and 953 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1004 transition count 953
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 p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 201 steps (0 resets) in 8 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-06-01 14:19:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 14:19:33] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 226 ms returned sat
[2025-06-01 14:19:37] [INFO ] [Real]Absence check using state equation in 3634 ms returned sat
[2025-06-01 14:19:37] [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 14:19:38] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 230 ms returned sat
[2025-06-01 14:19:52] [INFO ] [Nat]Absence check using state equation in 14222 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1443 reset in 657 ms.
Product exploration explored 100000 steps with 1418 reset in 696 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 953/953 transitions.
Performed 411 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 411 rules applied. Total rules applied 411 place count 1004 transition count 953
Deduced a syphon composed of 411 places in 11 ms
Applied a total of 411 rules in 105 ms. Remains 1004 /1004 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 14:19:54] [INFO ] Redundant transitions in 7 ms returned []
Running 908 sub problems to find dead transitions.
// Phase 1: matrix 953 rows 1004 cols
[2025-06-01 14:19:54] [INFO ] Computed 51 invariants in 4 ms
[2025-06-01 14:19:54] [INFO ] State equation strengthened by 411 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 959/1957 variables, and 6 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1004 constraints, ReadFeed: 0/411 constraints, PredecessorRefiner: 908/908 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 908 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/959 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 2 (OVERLAPS) 45/1004 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 908 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1004/1957 variables, and 51 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1004 constraints, ReadFeed: 0/411 constraints, PredecessorRefiner: 0/908 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 908 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1004/1004 places, 953/953 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60309 ms. Remains : 1004/1004 places, 953/953 transitions.
Built C files in :
/tmp/ltsmin15396066110617126366
[2025-06-01 14:20:54] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15396066110617126366
Running compilation step : cd /tmp/ltsmin15396066110617126366;'/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 1631 ms.
Running link step : cd /tmp/ltsmin15396066110617126366;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15396066110617126366;'/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/stateBased7617777397672639528.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 953/953 transitions.
Applied a total of 0 rules in 47 ms. Remains 1004 /1004 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 1004 cols
[2025-06-01 14:21:09] [INFO ] Computed 51 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:21:10] [INFO ] Implicit Places using invariants in 530 ms returned []
[2025-06-01 14:21:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:21:20] [INFO ] Implicit Places using invariants and state equation in 10821 ms returned []
Implicit Place search using SMT with State Equation took 11355 ms to find 0 implicit places.
Running 908 sub problems to find dead transitions.
[2025-06-01 14:21: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/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 959/1957 variables, and 6 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 6/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 908/908 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 908 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/959 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/959 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 908 unsolved
At refinement iteration 2 (OVERLAPS) 45/1004 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 908 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1004/1957 variables, and 51 constraints, problems are : Problem set: 0 solved, 908 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/908 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 908 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Finished structural reductions in LTL mode , in 1 iterations and 71613 ms. Remains : 1004/1004 places, 953/953 transitions.
Built C files in :
/tmp/ltsmin6105869818508733964
[2025-06-01 14:22:21] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6105869818508733964
Running compilation step : cd /tmp/ltsmin6105869818508733964;'/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 1735 ms.
Running link step : cd /tmp/ltsmin6105869818508733964;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6105869818508733964;'/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/stateBased2079552388135821018.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 14:22:36] [INFO ] Flatten gal took : 23 ms
[2025-06-01 14:22:36] [INFO ] Flatten gal took : 23 ms
[2025-06-01 14:22:36] [INFO ] Time to serialize gal into /tmp/LTL14526867629305568194.gal : 5 ms
[2025-06-01 14:22:36] [INFO ] Time to serialize properties into /tmp/LTL17114758023276513454.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/LTL14526867629305568194.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17871025153308701383.hoa' '-atoms' '/tmp/LTL17114758023276513454.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...320
Loading property file /tmp/LTL17114758023276513454.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17871025153308701383.hoa
Detected timeout of ITS tools.
[2025-06-01 14:22:51] [INFO ] Flatten gal took : 21 ms
[2025-06-01 14:22:51] [INFO ] Flatten gal took : 22 ms
[2025-06-01 14:22:51] [INFO ] Time to serialize gal into /tmp/LTL12185873223718547819.gal : 4 ms
[2025-06-01 14:22:51] [INFO ] Time to serialize properties into /tmp/LTL8134478288652928085.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/LTL12185873223718547819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8134478288652928085.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(G("(rcv_left_election_45_5_19_19>=1)")))||(F("(((newmsg35>=1)&&(election_45_6_35_to_right_34>=1))||((newmsg24>=1)&&(election_23_...181
Formula 0 simplified : XF!"(rcv_left_election_45_5_19_19>=1)" & G!"(((newmsg35>=1)&&(election_45_6_35_to_right_34>=1))||((newmsg24>=1)&&(election_23_0_1_to...171
Detected timeout of ITS tools.
[2025-06-01 14:23:06] [INFO ] Flatten gal took : 21 ms
[2025-06-01 14:23:06] [INFO ] Applying decomposition
[2025-06-01 14:23:06] [INFO ] Flatten gal took : 20 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/graph339049569974997041.txt' '-o' '/tmp/graph339049569974997041.bin' '-w' '/tmp/graph339049569974997041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph339049569974997041.bin' '-l' '-1' '-v' '-w' '/tmp/graph339049569974997041.weights' '-q' '0' '-e' '0.001'
[2025-06-01 14:23:06] [INFO ] Decomposing Gal with order
[2025-06-01 14:23:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 14:23:06] [INFO ] Removed a total of 69 redundant transitions.
[2025-06-01 14:23:06] [INFO ] Flatten gal took : 47 ms
[2025-06-01 14:23:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-01 14:23:06] [INFO ] Time to serialize gal into /tmp/LTL7385722994339988992.gal : 8 ms
[2025-06-01 14:23:06] [INFO ] Time to serialize properties into /tmp/LTL17994359329107476587.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/LTL7385722994339988992.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17994359329107476587.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(G("(i4.i1.u17.rcv_left_election_45_5_19_19>=1)")))||(F("(((i8.i1.u32.newmsg35>=1)&&(i8.i1.u85.election_45_6_35_to_right_34>=1))|...231
Formula 0 simplified : XF!"(i4.i1.u17.rcv_left_election_45_5_19_19>=1)" & G!"(((i8.i1.u32.newmsg35>=1)&&(i8.i1.u85.election_45_6_35_to_right_34>=1))||((i5....221
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-15 finished in 396382 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(p0)||(X(F(p1))&&F(p2))))'
Found a Shortening insensitive property : HirschbergSinclair-PT-45-LTLFireability-07
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 1017 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1017/1017 places, 966/966 transitions.
Reduce places removed 44 places and 44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 973 transition count 505
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 556 transition count 505
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 843 place count 547 transition count 496
Iterating global reduction 2 with 9 rules applied. Total rules applied 852 place count 547 transition count 496
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 855 place count 547 transition count 493
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 858 place count 544 transition count 493
Applied a total of 858 rules in 58 ms. Remains 544 /1017 variables (removed 473) and now considering 493/966 (removed 473) transitions.
// Phase 1: matrix 493 rows 544 cols
[2025-06-01 14:23:22] [INFO ] Computed 51 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:23:23] [INFO ] Implicit Places using invariants in 877 ms returned []
[2025-06-01 14:23:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:23:36] [INFO ] Implicit Places using invariants and state equation in 12928 ms returned []
Implicit Place search using SMT with State Equation took 13807 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2025-06-01 14:23:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 3/461 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (OVERLAPS) 410/871 variables, 461/512 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/1037 variables, and 512 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 461/544 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 3/461 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (OVERLAPS) 410/871 variables, 461/512 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/871 variables, 407/919 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/1037 variables, and 919 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 461/544 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in LI_LTL mode, iteration 1 : 544/1017 places, 493/966 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 73944 ms. Remains : 544/1017 places, 493/966 transitions.
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-07
Product exploration explored 100000 steps with 325 reset in 410 ms.
Product exploration explored 100000 steps with 325 reset in 443 ms.
Computed a total of 544 stabilizing places and 493 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 544 transition count 493
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 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (G p0)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 170 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (68 resets) in 194 ms. (205 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
[2025-06-01 14:24: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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 329/332 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 125/457 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 865/1037 variables, and 508 constraints, problems are : Problem set: 1 solved, 0 unsolved in 286 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 457/544 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 292ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (G p0)), (F (G p2)), (F (G (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 19 factoid took 396 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 304 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 309 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Support contains 3 out of 544 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 493/493 transitions.
Applied a total of 0 rules in 33 ms. Remains 544 /544 variables (removed 0) and now considering 493/493 (removed 0) transitions.
[2025-06-01 14:24:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:24:39] [INFO ] Implicit Places using invariants in 904 ms returned []
[2025-06-01 14:24:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:24:52] [INFO ] Implicit Places using invariants and state equation in 13045 ms returned []
Implicit Place search using SMT with State Equation took 13958 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 14:24:52] [INFO ] Redundant transitions in 2 ms returned []
Running 407 sub problems to find dead transitions.
[2025-06-01 14:24:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 3/461 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (OVERLAPS) 410/871 variables, 461/512 constraints. Problems are: Problem set: 0 solved, 407 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 0.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 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/1037 variables, and 512 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 461/544 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 3/461 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/461 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (OVERLAPS) 410/871 variables, 461/512 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/871 variables, 407/919 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 871/1037 variables, and 919 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 461/544 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 74082 ms. Remains : 544/544 places, 493/493 transitions.
Computed a total of 544 stabilizing places and 493 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 544 transition count 493
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 (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 247 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 296 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 40000 steps (68 resets) in 193 ms. (206 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
[2025-06-01 14:25:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 329/332 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 125/457 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 865/1037 variables, and 508 constraints, problems are : Problem set: 1 solved, 0 unsolved in 317 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 457/544 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (G (NOT p1))), (F (G p0)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 16 factoid took 324 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 309 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 325 reset in 425 ms.
Product exploration explored 100000 steps with 325 reset in 446 ms.
Built C files in :
/tmp/ltsmin2576448820215948293
[2025-06-01 14:25:56] [INFO ] Computing symmetric may disable matrix : 493 transitions.
[2025-06-01 14:25:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 14:25:56] [INFO ] Computing symmetric may enable matrix : 493 transitions.
[2025-06-01 14:25:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 14:25:56] [INFO ] Computing Do-Not-Accords matrix : 493 transitions.
[2025-06-01 14:25:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 14:25:56] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2576448820215948293
Running compilation step : cd /tmp/ltsmin2576448820215948293;'/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 1187 ms.
Running link step : cd /tmp/ltsmin2576448820215948293;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2576448820215948293;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7842425961281350054.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 493/493 transitions.
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 0 with 1 rules applied. Total rules applied 1 place count 544 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 543 transition count 492
Applied a total of 2 rules in 23 ms. Remains 543 /544 variables (removed 1) and now considering 492/493 (removed 1) transitions.
// Phase 1: matrix 492 rows 543 cols
[2025-06-01 14:26:11] [INFO ] Computed 51 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:26:12] [INFO ] Implicit Places using invariants in 917 ms returned []
[2025-06-01 14:26:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:26:25] [INFO ] Implicit Places using invariants and state equation in 13061 ms returned []
Implicit Place search using SMT with State Equation took 13982 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 14:26:25] [INFO ] Redundant transitions in 2 ms returned []
Running 406 sub problems to find dead transitions.
[2025-06-01 14:26:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 3/460 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 409/869 variables, 460/511 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 869/1035 variables, and 511 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 460/543 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 3/460 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 409/869 variables, 460/511 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/869 variables, 406/917 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/1035 variables, and 917 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 460/543 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Starting structural reductions in SI_LTL mode, iteration 1 : 543/544 places, 492/493 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74099 ms. Remains : 543/544 places, 492/493 transitions.
Built C files in :
/tmp/ltsmin17524311001761488892
[2025-06-01 14:27:25] [INFO ] Computing symmetric may disable matrix : 492 transitions.
[2025-06-01 14:27:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 14:27:25] [INFO ] Computing symmetric may enable matrix : 492 transitions.
[2025-06-01 14:27:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 14:27:25] [INFO ] Computing Do-Not-Accords matrix : 492 transitions.
[2025-06-01 14:27:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 14:27:25] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17524311001761488892
Running compilation step : cd /tmp/ltsmin17524311001761488892;'/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 1170 ms.
Running link step : cd /tmp/ltsmin17524311001761488892;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17524311001761488892;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2757621431832461315.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 14:27:40] [INFO ] Flatten gal took : 10 ms
[2025-06-01 14:27:40] [INFO ] Flatten gal took : 10 ms
[2025-06-01 14:27:40] [INFO ] Time to serialize gal into /tmp/LTL4687893728308068237.gal : 2 ms
[2025-06-01 14:27:40] [INFO ] Time to serialize properties into /tmp/LTL1753893554531255921.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/LTL4687893728308068237.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14513889541625469630.hoa' '-atoms' '/tmp/LTL1753893554531255921.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1753893554531255921.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14513889541625469630.hoa
Detected timeout of ITS tools.
[2025-06-01 14:27:55] [INFO ] Flatten gal took : 11 ms
[2025-06-01 14:27:55] [INFO ] Flatten gal took : 13 ms
[2025-06-01 14:27:55] [INFO ] Time to serialize gal into /tmp/LTL12412827975817506380.gal : 2 ms
[2025-06-01 14:27:55] [INFO ] Time to serialize properties into /tmp/LTL16803676692008594243.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12412827975817506380.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16803676692008594243.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...277
Read 1 LTL properties
Checking formula 0 : !(((G("((newmsg15<1)||(reply_45_5_to_right_14<1))"))||((X(F("(rcv_right_election_45_5_20_25>=1)")))&&(F("(rcv_right_election_45_6_4_41...164
Formula 0 simplified : F!"((newmsg15<1)||(reply_45_5_to_right_14<1))" & (XG!"(rcv_right_election_45_5_20_25>=1)" | G!"(rcv_right_election_45_6_4_41<1)")
Detected timeout of ITS tools.
[2025-06-01 14:28:10] [INFO ] Flatten gal took : 13 ms
[2025-06-01 14:28:10] [INFO ] Applying decomposition
[2025-06-01 14:28:10] [INFO ] Flatten gal took : 11 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/graph4828847775264933951.txt' '-o' '/tmp/graph4828847775264933951.bin' '-w' '/tmp/graph4828847775264933951.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4828847775264933951.bin' '-l' '-1' '-v' '-w' '/tmp/graph4828847775264933951.weights' '-q' '0' '-e' '0.001'
[2025-06-01 14:28:10] [INFO ] Decomposing Gal with order
[2025-06-01 14:28:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 14:28:10] [INFO ] Removed a total of 329 redundant transitions.
[2025-06-01 14:28:10] [INFO ] Flatten gal took : 24 ms
[2025-06-01 14:28:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 10 ms.
[2025-06-01 14:28:10] [INFO ] Time to serialize gal into /tmp/LTL9506511934537961303.gal : 7 ms
[2025-06-01 14:28:10] [INFO ] Time to serialize properties into /tmp/LTL17493460804010210565.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/LTL9506511934537961303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17493460804010210565.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("((i1.i1.u1.newmsg15<1)||(i1.i0.u0.reply_45_5_to_right_14<1))"))||((X(F("(i2.i0.u109.rcv_right_election_45_5_20_25>=1)")))&&(F("...199
Formula 0 simplified : F!"((i1.i1.u1.newmsg15<1)||(i1.i0.u0.reply_45_5_to_right_14<1))" & (XG!"(i2.i0.u109.rcv_right_election_45_5_20_25>=1)" | G!"(i6.u2.r...187
Reverse transition relation is NOT exact ! Due to transitions t55_t56, t95_t96, t108_t109, t128_t129, t149_t150, t186_t187, t225_t226, t580_t581, t907_t908...797
Computing Next relation with stutter on 3.06954e+32 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-07 finished in 304146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U X(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Found a Lengthening insensitive property : HirschbergSinclair-PT-45-LTLFireability-15
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 1017 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1017/1017 places, 966/966 transitions.
Reduce places removed 42 places and 42 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 412 transitions
Trivial Post-agglo rules discarded 412 transitions
Performed 412 trivial Post agglomeration. Transition count delta: 412
Iterating post reduction 0 with 412 rules applied. Total rules applied 412 place count 975 transition count 512
Reduce places removed 412 places and 0 transitions.
Iterating post reduction 1 with 412 rules applied. Total rules applied 824 place count 563 transition count 512
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 832 place count 555 transition count 504
Iterating global reduction 2 with 8 rules applied. Total rules applied 840 place count 555 transition count 504
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 843 place count 555 transition count 501
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 846 place count 552 transition count 501
Applied a total of 846 rules in 45 ms. Remains 552 /1017 variables (removed 465) and now considering 501/966 (removed 465) transitions.
// Phase 1: matrix 501 rows 552 cols
[2025-06-01 14:28:26] [INFO ] Computed 51 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:28:27] [INFO ] Implicit Places using invariants in 843 ms returned []
[2025-06-01 14:28:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:28:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 14:28:51] [INFO ] Implicit Places using invariants and state equation in 24099 ms returned []
Implicit Place search using SMT with State Equation took 24950 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2025-06-01 14:28:51] [INFO ] Invariant cache hit.
[2025-06-01 14:28:51] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 5/475 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 899/1053 variables, and 534 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 5/475 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 899/1053 variables, and 953 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in LI_LTL mode, iteration 1 : 552/1017 places, 501/966 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 85115 ms. Remains : 552/1017 places, 501/966 transitions.
Running random walk in product with property : HirschbergSinclair-PT-45-LTLFireability-15
Product exploration explored 100000 steps with 1331 reset in 759 ms.
Product exploration explored 100000 steps with 1329 reset in 815 ms.
Computed a total of 552 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 552 transition count 501
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) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 289 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 347 steps (0 resets) in 9 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 9 factoid took 342 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-06-01 14:29:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 14:29:56] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 1634 ms returned sat
[2025-06-01 14:30:09] [INFO ] [Real]Absence check using state equation in 13034 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 552 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 501/501 transitions.
Applied a total of 0 rules in 12 ms. Remains 552 /552 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2025-06-01 14:30:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:30:10] [INFO ] Implicit Places using invariants in 842 ms returned []
[2025-06-01 14:30:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:30:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 14:30:34] [INFO ] Implicit Places using invariants and state equation in 24229 ms returned []
Implicit Place search using SMT with State Equation took 25091 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2025-06-01 14:30:34] [INFO ] Invariant cache hit.
[2025-06-01 14:30:34] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 5/475 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 899/1053 variables, and 534 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 5/475 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 899/1053 variables, and 953 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Finished structural reductions in LTL mode , in 1 iterations and 85197 ms. Remains : 552/552 places, 501/501 transitions.
Computed a total of 552 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 552 transition count 501
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 p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 384 steps (0 resets) in 9 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-06-01 14:31:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 14:31:37] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 1626 ms returned sat
[2025-06-01 14:31:50] [INFO ] [Real]Absence check using state equation in 13055 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1332 reset in 742 ms.
Product exploration explored 100000 steps with 1329 reset in 806 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 501/501 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 552 transition count 501
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 1 rules in 34 ms. Remains 552 /552 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 14:31:52] [INFO ] Redundant transitions in 2 ms returned []
Running 419 sub problems to find dead transitions.
// Phase 1: matrix 501 rows 552 cols
[2025-06-01 14:31:52] [INFO ] Computed 51 invariants in 1 ms
[2025-06-01 14:31:52] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 5/475 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Problem TDEAD312 is UNSAT
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 1 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 1 solved, 418 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 899/1053 variables, and 534 constraints, problems are : Problem set: 1 solved, 418 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 418 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 6/475 variables, 47/51 constraints. Problems are: Problem set: 1 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 418 unsolved
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 1 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 1 solved, 418 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 418/952 constraints. Problems are: Problem set: 1 solved, 418 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 899/1053 variables, and 952 constraints, problems are : Problem set: 1 solved, 418 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 418/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 1 solved, 418 unsolved
Search for dead transitions found 1 dead transitions in 60075ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 552/552 places, 500/501 transitions.
Graph (complete) has 1380 edges and 552 vertex of which 551 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 551 /552 variables (removed 1) and now considering 500/500 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 551/552 places, 500/501 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60147 ms. Remains : 551/552 places, 500/501 transitions.
Built C files in :
/tmp/ltsmin16539032106796762351
[2025-06-01 14:32:52] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16539032106796762351
Running compilation step : cd /tmp/ltsmin16539032106796762351;'/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 811 ms.
Running link step : cd /tmp/ltsmin16539032106796762351;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16539032106796762351;'/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/stateBased11917009312813250375.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 501/501 transitions.
Applied a total of 0 rules in 12 ms. Remains 552 /552 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 552 cols
[2025-06-01 14:33:07] [INFO ] Computed 51 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:33:08] [INFO ] Implicit Places using invariants in 858 ms returned []
[2025-06-01 14:33:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:33:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 14:33:32] [INFO ] Implicit Places using invariants and state equation in 24096 ms returned []
Implicit Place search using SMT with State Equation took 24978 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2025-06-01 14:33:32] [INFO ] Invariant cache hit.
[2025-06-01 14:33:32] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 5/475 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 899/1053 variables, and 534 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 5/475 variables, 46/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 424/899 variables, 475/526 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 899/1053 variables, and 953 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 51/51 constraints, State Equation: 475/552 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Finished structural reductions in LTL mode , in 1 iterations and 85062 ms. Remains : 552/552 places, 501/501 transitions.
Built C files in :
/tmp/ltsmin463065624929129533
[2025-06-01 14:34:32] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin463065624929129533
Running compilation step : cd /tmp/ltsmin463065624929129533;'/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 792 ms.
Running link step : cd /tmp/ltsmin463065624929129533;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin463065624929129533;'/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/stateBased11735310726161582544.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 14:34:47] [INFO ] Flatten gal took : 10 ms
[2025-06-01 14:34:47] [INFO ] Flatten gal took : 10 ms
[2025-06-01 14:34:47] [INFO ] Time to serialize gal into /tmp/LTL4776312444682961150.gal : 2 ms
[2025-06-01 14:34:47] [INFO ] Time to serialize properties into /tmp/LTL10002147158654954959.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/LTL4776312444682961150.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13407852926257295535.hoa' '-atoms' '/tmp/LTL10002147158654954959.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10002147158654954959.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13407852926257295535.hoa
Detected timeout of ITS tools.
[2025-06-01 14:35:02] [INFO ] Flatten gal took : 10 ms
[2025-06-01 14:35:02] [INFO ] Flatten gal took : 9 ms
[2025-06-01 14:35:02] [INFO ] Time to serialize gal into /tmp/LTL10335120810972326351.gal : 2 ms
[2025-06-01 14:35:02] [INFO ] Time to serialize properties into /tmp/LTL4895044387898150907.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/LTL10335120810972326351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4895044387898150907.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(G("(rcv_left_election_45_5_19_19>=1)")))||(F("(((newmsg35>=1)&&(election_45_6_35_to_right_34>=1))||((newmsg24>=1)&&(election_23_...181
Formula 0 simplified : XF!"(rcv_left_election_45_5_19_19>=1)" & G!"(((newmsg35>=1)&&(election_45_6_35_to_right_34>=1))||((newmsg24>=1)&&(election_23_0_1_to...171
Detected timeout of ITS tools.
[2025-06-01 14:35:17] [INFO ] Flatten gal took : 10 ms
[2025-06-01 14:35:17] [INFO ] Applying decomposition
[2025-06-01 14:35:17] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1634300960522756492.txt' '-o' '/tmp/graph1634300960522756492.bin' '-w' '/tmp/graph1634300960522756492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1634300960522756492.bin' '-l' '-1' '-v' '-w' '/tmp/graph1634300960522756492.weights' '-q' '0' '-e' '0.001'
[2025-06-01 14:35:17] [INFO ] Decomposing Gal with order
[2025-06-01 14:35:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 14:35:17] [INFO ] Removed a total of 326 redundant transitions.
[2025-06-01 14:35:17] [INFO ] Flatten gal took : 25 ms
[2025-06-01 14:35:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 9 ms.
[2025-06-01 14:35:17] [INFO ] Time to serialize gal into /tmp/LTL10277800539904618691.gal : 5 ms
[2025-06-01 14:35:17] [INFO ] Time to serialize properties into /tmp/LTL5564010343635443734.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/LTL10277800539904618691.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5564010343635443734.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(G("(i1.u138.rcv_left_election_45_5_19_19>=1)")))||(F("(((i7.u1.newmsg35>=1)&&(i7.u195.election_45_6_35_to_right_34>=1))||((i1.u2...217
Formula 0 simplified : XF!"(i1.u138.rcv_left_election_45_5_19_19>=1)" & G!"(((i7.u1.newmsg35>=1)&&(i7.u195.election_45_6_35_to_right_34>=1))||((i1.u25.newm...207
Reverse transition relation is NOT exact ! Due to transitions t85_t86, t114_t115, t149_t150, t196_t197, t216_t217, t433_t434, t676_t677, t829_t830, i1.t148...847
Computing Next relation with stutter on 3.68345e+32 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-45-LTLFireability-15 finished in 426685 ms.
[2025-06-01 14:35:32] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8517358262664800844
[2025-06-01 14:35:32] [INFO ] Computing symmetric may disable matrix : 966 transitions.
[2025-06-01 14:35:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 14:35:32] [INFO ] Computing symmetric may enable matrix : 966 transitions.
[2025-06-01 14:35:32] [INFO ] Applying decomposition
[2025-06-01 14:35:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 14:35:32] [INFO ] Flatten gal took : 20 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/graph11738333338942932934.txt' '-o' '/tmp/graph11738333338942932934.bin' '-w' '/tmp/graph11738333338942932934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11738333338942932934.bin' '-l' '-1' '-v' '-w' '/tmp/graph11738333338942932934.weights' '-q' '0' '-e' '0.001'
[2025-06-01 14:35:32] [INFO ] Decomposing Gal with order
[2025-06-01 14:35:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 14:35:33] [INFO ] Removed a total of 105 redundant transitions.
[2025-06-01 14:35:33] [INFO ] Computing Do-Not-Accords matrix : 966 transitions.
[2025-06-01 14:35:33] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 14:35:33] [INFO ] Built C files in 216ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8517358262664800844
Running compilation step : cd /tmp/ltsmin8517358262664800844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-01 14:35:33] [INFO ] Flatten gal took : 85 ms
[2025-06-01 14:35:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-01 14:35:33] [INFO ] Time to serialize gal into /tmp/LTLFireability2982111419725335565.gal : 9 ms
[2025-06-01 14:35:33] [INFO ] Time to serialize properties into /tmp/LTLFireability11003512299099479718.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2982111419725335565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11003512299099479718.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !(((G("((i3.i1.u13.newmsg15<1)||(i3.i1.u13.reply_45_5_to_right_14<1))"))||((X(F("(i6.u49.rcv_right_election_45_5_20_25>=1)")))&&(F("(i...202
Formula 0 simplified : F!"((i3.i1.u13.newmsg15<1)||(i3.i1.u13.reply_45_5_to_right_14<1))" & (XG!"(i6.u49.rcv_right_election_45_5_20_25>=1)" | G!"(i11.i0.u3...190
Compilation finished in 2812 ms.
Running link step : cd /tmp/ltsmin8517358262664800844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin8517358262664800844;'/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' '([]((LTLAPp0==true))||(X(<>((LTLAPp1==true)))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.054: LTL layer: formula: ([]((LTLAPp0==true))||(X(<>((LTLAPp1==true)))&&<>((LTLAPp2==true))))
pins2lts-mc-linux64( 2/ 8), 0.054: "([]((LTLAPp0==true))||(X(<>((LTLAPp1==true)))&&<>((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.054: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.267: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.268: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.315: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.315: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.317: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.321: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.324: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.358: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.923: DFS-FIFO for weak LTL, using special progress label 974
pins2lts-mc-linux64( 0/ 8), 0.923: There are 975 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.923: State length is 1018, there are 985 groups
pins2lts-mc-linux64( 0/ 8), 0.923: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.923: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.923: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.923: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 3.602: ~1 levels ~960 states ~41464 transitions
pins2lts-mc-linux64( 2/ 8), 4.427: ~1 levels ~1920 states ~82808 transitions
pins2lts-mc-linux64( 2/ 8), 6.755: ~1 levels ~3840 states ~164328 transitions
pins2lts-mc-linux64( 2/ 8), 9.297: ~1 levels ~7680 states ~327160 transitions
pins2lts-mc-linux64( 2/ 8), 11.676: ~1 levels ~15360 states ~651416 transitions
pins2lts-mc-linux64( 2/ 8), 17.239: ~1 levels ~30720 states ~1296864 transitions
pins2lts-mc-linux64( 5/ 8), 21.475: ~1 levels ~61440 states ~2577688 transitions
pins2lts-mc-linux64( 2/ 8), 29.010: ~1 levels ~122880 states ~5146696 transitions
pins2lts-mc-linux64( 2/ 8), 43.536: ~1 levels ~245760 states ~10254312 transitions
pins2lts-mc-linux64( 2/ 8), 73.234: ~1 levels ~491520 states ~20294072 transitions
pins2lts-mc-linux64( 2/ 8), 132.972: ~1 levels ~983040 states ~40607512 transitions
pins2lts-mc-linux64( 0/ 8), 158.836: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 159.123:
pins2lts-mc-linux64( 0/ 8), 159.123: mean standard work distribution: 0.7% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 159.123:
pins2lts-mc-linux64( 0/ 8), 159.123: Explored 1152344 states 47405956 transitions, fanout: 41.139
pins2lts-mc-linux64( 0/ 8), 159.123: Total exploration time 158.190 sec (157.890 sec minimum, 158.003 sec on average)
pins2lts-mc-linux64( 0/ 8), 159.123: States per second: 7285, Transitions per second: 299677
pins2lts-mc-linux64( 0/ 8), 159.123:
pins2lts-mc-linux64( 0/ 8), 159.123: Progress states detected: 10238869
pins2lts-mc-linux64( 0/ 8), 159.123: Redundant explorations: -88.7457
pins2lts-mc-linux64( 0/ 8), 159.123:
pins2lts-mc-linux64( 0/ 8), 159.123: Queue width: 8B, total height: 11257660, memory: 85.89MB
pins2lts-mc-linux64( 0/ 8), 159.123: Tree memory: 334.1MB, 34.2 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 159.123: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 159.123: Stored 1176 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 159.123: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 159.123: Est. total memory use: 420.0MB (~1109.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8517358262664800844;'/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' '([]((LTLAPp0==true))||(X(<>((LTLAPp1==true)))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8517358262664800844;'/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' '([]((LTLAPp0==true))||(X(<>((LTLAPp1==true)))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t7, t8, t12, t16, t17, t21, t24, t28, t31, t34, t36, t39, t40, t43, t44, t80, t12...1671
Computing Next relation with stutter on 1.58382e+33 deadlock states

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-45"
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-45, 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-174876422100124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-45.tgz
mv HirschbergSinclair-PT-45 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;