About the Execution of ITS-Tools for HirschbergSinclair-PT-15
| 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 | FFFTFFFTFFFF?TFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422000075.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-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422000075
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 173K 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-15-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748775588505
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 10:59:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 10:59:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:59:50] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2025-06-01 10:59:50] [INFO ] Transformed 330 places.
[2025-06-01 10:59:50] [INFO ] Transformed 296 transitions.
[2025-06-01 10:59:50] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 296/296 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 318 transition count 296
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 19 place count 311 transition count 289
Iterating global reduction 1 with 7 rules applied. Total rules applied 26 place count 311 transition count 289
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 305 transition count 283
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 305 transition count 283
Applied a total of 38 rules in 81 ms. Remains 305 /330 variables (removed 25) and now considering 283/296 (removed 13) transitions.
// Phase 1: matrix 283 rows 305 cols
[2025-06-01 10:59:50] [INFO ] Computed 22 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:59:50] [INFO ] Implicit Places using invariants in 371 ms returned []
[2025-06-01 10:59:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:59:52] [INFO ] Implicit Places using invariants and state equation in 1340 ms returned []
Implicit Place search using SMT with State Equation took 1759 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2025-06-01 10:59: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/287 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 6/293 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 12/305 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 283/588 variables, 305/327 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/588 variables, and 327 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 6/293 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 12/305 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 283/588 variables, 305/327 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/588 variables, 268/595 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/588 variables, and 595 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 305/330 places, 283/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62012 ms. Remains : 305/330 places, 283/296 transitions.
Support contains 49 out of 305 places after structural reductions.
[2025-06-01 11:00:52] [INFO ] Flatten gal took : 47 ms
[2025-06-01 11:00:52] [INFO ] Flatten gal took : 20 ms
[2025-06-01 11:00:52] [INFO ] Input system was already deterministic with 283 transitions.
RANDOM walk for 40000 steps (133 resets) in 1727 ms. (23 steps per ms) remains 21/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
[2025-06-01 11:00:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 15/38 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 239/277 variables, 19/22 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/22 constraints. Problems are: Problem set: 3 solved, 18 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
At refinement iteration 5 (OVERLAPS) 283/560 variables, 277/299 constraints. Problems are: Problem set: 18 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 0/299 constraints. Problems are: Problem set: 18 solved, 3 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 7 (OVERLAPS) 28/588 variables, 28/327 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 0/327 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/588 variables, 0/327 constraints. Problems are: Problem set: 20 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 588/588 variables, and 327 constraints, problems are : Problem set: 20 solved, 1 unsolved in 872 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 1 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: 20 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 190/194 variables, 5/5 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/5 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/266 variables, 14/19 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/19 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/275 variables, 3/22 constraints. Problems are: Problem set: 20 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/22 constraints. Problems are: Problem set: 20 solved, 1 unsolved
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Int declared 558/588 variables, and 297 constraints, problems are : Problem set: 21 solved, 0 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 275/305 constraints, PredecessorRefiner: 0/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1074ms problems are : Problem set: 21 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 21 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 305 stabilizing places and 283 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 305 transition count 283
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-15-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0||X(G(p0))))))'
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 283/283 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 302 transition count 283
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 293 transition count 274
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 293 transition count 274
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 29 place count 285 transition count 266
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 285 transition count 266
Applied a total of 37 rules in 29 ms. Remains 285 /305 variables (removed 20) and now considering 266/283 (removed 17) transitions.
// Phase 1: matrix 266 rows 285 cols
[2025-06-01 11:00:54] [INFO ] Computed 19 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:00:55] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-01 11:00:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:00:56] [INFO ] Implicit Places using invariants and state equation in 1661 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2025-06-01 11:00:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 26345 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56407ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 56408ms
Starting structural reductions in LTL mode, iteration 1 : 285/305 places, 266/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58251 ms. Remains : 285/305 places, 266/283 transitions.
Stuttering acceptance computed with spot in 351 ms :[true, false, (NOT p0), false, false]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 155 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-00 finished in 58683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G((p1||X(p1))))))'
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 283/283 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 302 transition count 283
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 293 transition count 274
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 293 transition count 274
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 29 place count 285 transition count 266
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 285 transition count 266
Applied a total of 37 rules in 32 ms. Remains 285 /305 variables (removed 20) and now considering 266/283 (removed 17) transitions.
[2025-06-01 11:01:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:01:53] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-01 11:01:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:01:55] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 1606 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2025-06-01 11:01: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/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 26628 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56688ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 56689ms
Starting structural reductions in LTL mode, iteration 1 : 285/305 places, 266/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58330 ms. Remains : 285/305 places, 266/283 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-02
Stuttering criterion allowed to conclude after 296 steps with 0 reset in 5 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-02 finished in 58519 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 U X(p1))&&X(X((p0||X(G(p2))))))))'
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 283/283 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 304 transition count 283
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 297 transition count 276
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 297 transition count 276
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 291 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 291 transition count 270
Applied a total of 27 rules in 22 ms. Remains 291 /305 variables (removed 14) and now considering 270/283 (removed 13) transitions.
// Phase 1: matrix 270 rows 291 cols
[2025-06-01 11:02:52] [INFO ] Computed 21 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:02:52] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-01 11:02:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:02:53] [INFO ] Implicit Places using invariants and state equation in 1676 ms returned []
Implicit Place search using SMT with State Equation took 1820 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2025-06-01 11:02:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 4/278 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 13/291 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 270/561 variables, 291/312 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 0/561 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 312 constraints, problems are : Problem set: 0 solved, 255 unsolved in 28680 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 4/278 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 13/291 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 270/561 variables, 291/312 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 255/567 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/561 variables, and 567 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58735ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 58736ms
Starting structural reductions in LTL mode, iteration 1 : 291/305 places, 270/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60581 ms. Remains : 291/305 places, 270/283 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2)), (NOT p1), true, (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-05 finished in 60956 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(G(p1)))))'
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 283/283 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 302 transition count 283
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 294 transition count 275
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 294 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 287 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 287 transition count 268
Applied a total of 33 rules in 14 ms. Remains 287 /305 variables (removed 18) and now considering 268/283 (removed 15) transitions.
// Phase 1: matrix 268 rows 287 cols
[2025-06-01 11:03:53] [INFO ] Computed 19 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:03:53] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-01 11:03:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:03:54] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-06-01 11:03: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/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 0 solved, 253 unsolved in 27334 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 253/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 559 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57382ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 57384ms
Starting structural reductions in LTL mode, iteration 1 : 287/305 places, 268/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59078 ms. Remains : 287/305 places, 268/283 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Computed a total of 287 stabilizing places and 268 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 268
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X p0), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-07 finished in 59810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p0 U (G(p0)||p1))) U (G(X((p0 U (p1||G(p0)))))||((F(p2) U G(F(p2)))&&X((p0 U (p1||G(p0))))))))))'
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 283/283 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 302 transition count 283
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 294 transition count 275
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 294 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 287 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 287 transition count 268
Applied a total of 33 rules in 22 ms. Remains 287 /305 variables (removed 18) and now considering 268/283 (removed 15) transitions.
// Phase 1: matrix 268 rows 287 cols
[2025-06-01 11:04:52] [INFO ] Computed 19 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:04:53] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-01 11:04:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:04:54] [INFO ] Implicit Places using invariants and state equation in 1549 ms returned []
Implicit Place search using SMT with State Equation took 1710 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-06-01 11:04: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/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 0 solved, 253 unsolved in 27662 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 253/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 559 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57718ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 57718ms
Starting structural reductions in LTL mode, iteration 1 : 287/305 places, 268/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59451 ms. Remains : 287/305 places, 268/283 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT 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-15-LTLCardinality-12
Product exploration explored 100000 steps with 364 reset in 302 ms.
Product exploration explored 100000 steps with 365 reset in 334 ms.
Computed a total of 287 stabilizing places and 268 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 268
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) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 238 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 24 states, 70 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false, (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false, (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Reduction of identical properties reduced properties to check from 15 to 13
RANDOM walk for 40000 steps (132 resets) in 361 ms. (110 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40003 steps (16 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (16 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (17 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
[2025-06-01 11:05:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
Problem apf5 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 229/234 variables, 16/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/259 variables, 3/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf6 is UNSAT
At refinement iteration 5 (OVERLAPS) 268/527 variables, 259/278 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/278 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/555 variables, 28/306 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 3 solved, 1 unsolved in 762 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 229/234 variables, 16/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/259 variables, 3/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem apf13 is UNSAT
After SMT solving in domain Int declared 527/555 variables, and 278 constraints, problems are : Problem set: 4 solved, 0 unsolved in 158 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 259/287 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 927ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (G (OR (NOT p2) p0 p1)), (G (OR (NOT p2) (NOT p0) (NOT p1))), (G (OR (NOT p2) p0 (NOT p1))), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p2) p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 1520 ms. Reduced automaton from 24 states, 70 edges and 3 AP (stutter insensitive) to 17 states, 49 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 794 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false]
Stuttering acceptance computed with spot in 817 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false]
Support contains 5 out of 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 268/268 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 272 transition count 141
Reduce places removed 112 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 113 rules applied. Total rules applied 225 place count 160 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 226 place count 159 transition count 140
Applied a total of 226 rules in 25 ms. Remains 159 /287 variables (removed 128) and now considering 140/268 (removed 128) transitions.
// Phase 1: matrix 140 rows 159 cols
[2025-06-01 11:05:59] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:05:59] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-01 11:05:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:05:59] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:05:59] [INFO ] Redundant transitions in 4 ms returned []
Running 111 sub problems to find dead transitions.
[2025-06-01 11:05:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 2/249 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/299 variables, and 153 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6477 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 111/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 2/249 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/299 variables, and 264 constraints, problems are : Problem set: 0 solved, 111 unsolved in 24712 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31202ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 31202ms
Starting structural reductions in SI_LTL mode, iteration 1 : 159/287 places, 140/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31833 ms. Remains : 159/287 places, 140/268 transitions.
Computed a total of 159 stabilizing places and 140 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 140
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) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (OR p2 (NOT p0) p1))), (X p0), (X (NOT (AND p2 p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 214 ms. Reduced automaton from 17 states, 49 edges and 3 AP (stutter insensitive) to 17 states, 49 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 865 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (248 resets) in 267 ms. (149 steps per ms) remains 4/14 properties
BEST_FIRST walk for 40004 steps (35 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (34 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (37 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
[2025-06-01 11:06:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
Problem apf7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/106 variables, 16/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/131 variables, 3/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf9 is UNSAT
At refinement iteration 5 (OVERLAPS) 113/244 variables, 131/150 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/245 variables, 1/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/299 variables, and 151 constraints, problems are : Problem set: 3 solved, 1 unsolved in 158 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 132/159 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 101/106 variables, 16/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/131 variables, 3/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 244/299 variables, and 150 constraints, problems are : Problem set: 4 solved, 0 unsolved in 98 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 131/159 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 261ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (OR p2 (NOT p0) p1))), (X p0), (X (NOT (AND p2 p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (G (OR p0 p2 (NOT p1))), (G (OR p0 (NOT p2) p1)), (G (OR p0 (NOT p2) (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 36 factoid took 809 ms. Reduced automaton from 17 states, 49 edges and 3 AP (stutter insensitive) to 17 states, 49 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 823 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Stuttering acceptance computed with spot in 782 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Stuttering acceptance computed with spot in 814 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Product exploration explored 100000 steps with 805 reset in 260 ms.
Product exploration explored 100000 steps with 808 reset in 211 ms.
Built C files in :
/tmp/ltsmin12187598067292459012
[2025-06-01 11:06:36] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2025-06-01 11:06:36] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:06:36] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2025-06-01 11:06:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:06:36] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2025-06-01 11:06:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:06:36] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12187598067292459012
Running compilation step : cd /tmp/ltsmin12187598067292459012;'/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 428 ms.
Running link step : cd /tmp/ltsmin12187598067292459012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin12187598067292459012;'/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/stateBased11581485674602681447.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 140/140 transitions.
Applied a total of 0 rules in 13 ms. Remains 159 /159 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2025-06-01 11:06:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:06:51] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-01 11:06:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:06:52] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:06:52] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2025-06-01 11:06: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/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 2/249 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/299 variables, and 153 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6344 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 111/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 2/249 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/299 variables, and 264 constraints, problems are : Problem set: 0 solved, 111 unsolved in 24496 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30847ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 30848ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31477 ms. Remains : 159/159 places, 140/140 transitions.
Built C files in :
/tmp/ltsmin389467331482302393
[2025-06-01 11:07:22] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2025-06-01 11:07:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:07:22] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2025-06-01 11:07:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:07:22] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2025-06-01 11:07:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:07:22] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin389467331482302393
Running compilation step : cd /tmp/ltsmin389467331482302393;'/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 294 ms.
Running link step : cd /tmp/ltsmin389467331482302393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin389467331482302393;'/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/stateBased7055442299255586111.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 11:07:38] [INFO ] Flatten gal took : 15 ms
[2025-06-01 11:07:38] [INFO ] Flatten gal took : 7 ms
[2025-06-01 11:07:38] [INFO ] Time to serialize gal into /tmp/LTL14801192774593204189.gal : 2 ms
[2025-06-01 11:07:38] [INFO ] Time to serialize properties into /tmp/LTL11384532577521493786.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/LTL14801192774593204189.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9834152880521574122.hoa' '-atoms' '/tmp/LTL11384532577521493786.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/LTL11384532577521493786.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9834152880521574122.hoa
Reverse transition relation is NOT exact ! Due to transitions t17.t18, t21.t22, t27.t28, t33.t34, t38, t41.t42, t43.t44, t47.t48, t52.t53, t58.t59, t62.t63...301
Computing Next relation with stutter on 1.31836e+11 deadlock states
Detected timeout of ITS tools.
[2025-06-01 11:07:53] [INFO ] Flatten gal took : 7 ms
[2025-06-01 11:07:53] [INFO ] Flatten gal took : 6 ms
[2025-06-01 11:07:53] [INFO ] Time to serialize gal into /tmp/LTL2883165190179731381.gal : 2 ms
[2025-06-01 11:07:53] [INFO ] Time to serialize properties into /tmp/LTL3025428845608250291.ltl : 17 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/LTL2883165190179731381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3025428845608250291.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("(reply_15_2_to_right_13<1)")U((G("(reply_15_2_to_right_13<1)"))||("((rcv_left_election_15_4_14_14>rcv_left_election_5_0_1_...655
Formula 0 simplified : XXG(F(!"((rcv_left_election_15_4_14_14>rcv_left_election_5_0_1_6)&&(reply_15_2_to_right_13<1))" & !"(reply_15_2_to_right_13<1)") & (...339
Reverse transition relation is NOT exact ! Due to transitions t17.t18, t21.t22, t27.t28, t33.t34, t38, t41.t42, t43.t44, t47.t48, t52.t53, t58.t59, t62.t63...301
Computing Next relation with stutter on 1.31836e+11 deadlock states
Detected timeout of ITS tools.
[2025-06-01 11:08:08] [INFO ] Flatten gal took : 9 ms
[2025-06-01 11:08:08] [INFO ] Applying decomposition
[2025-06-01 11:08:08] [INFO ] Flatten gal took : 6 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/graph70539440116173711.txt' '-o' '/tmp/graph70539440116173711.bin' '-w' '/tmp/graph70539440116173711.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph70539440116173711.bin' '-l' '-1' '-v' '-w' '/tmp/graph70539440116173711.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:08:08] [INFO ] Decomposing Gal with order
[2025-06-01 11:08:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:08:08] [INFO ] Removed a total of 86 redundant transitions.
[2025-06-01 11:08:08] [INFO ] Flatten gal took : 48 ms
[2025-06-01 11:08:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 8 ms.
[2025-06-01 11:08:08] [INFO ] Time to serialize gal into /tmp/LTL6363053215406037472.gal : 4 ms
[2025-06-01 11:08:08] [INFO ] Time to serialize properties into /tmp/LTL3622746314347919275.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/LTL6363053215406037472.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3622746314347919275.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("(gi1.gi0.gu25.reply_15_2_to_right_13<1)")U((G("(gi1.gi0.gu25.reply_15_2_to_right_13<1)"))||("((gu5.rcv_left_election_15_4_...816
Formula 0 simplified : XXG(F(!"((gu5.rcv_left_election_15_4_14_14>gu5.rcv_left_election_5_0_1_6)&&(gi1.gi0.gu25.reply_15_2_to_right_13<1))" & !"(gi1.gi0.gu...417
Reverse transition relation is NOT exact ! Due to transitions gi1.gi0.gi2.t21_t22, gi1.gi0.t105_t106, gi1.gi0.t236_t237, gi1.gi1.t33_t34, gi1.gi1.t41_t42, ...411
Computing Next relation with stutter on 1.31836e+11 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-12 finished in 210736 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)))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 283/283 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 302 transition count 283
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 294 transition count 275
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 294 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 287 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 287 transition count 268
Applied a total of 33 rules in 32 ms. Remains 287 /305 variables (removed 18) and now considering 268/283 (removed 15) transitions.
// Phase 1: matrix 268 rows 287 cols
[2025-06-01 11:08:23] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:08:23] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-06-01 11:08:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:08:25] [INFO ] Implicit Places using invariants and state equation in 1711 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2025-06-01 11:08: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/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 0 solved, 253 unsolved in 27008 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 253/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 559 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57072ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 57073ms
Starting structural reductions in LTL mode, iteration 1 : 287/305 places, 268/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59056 ms. Remains : 287/305 places, 268/283 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 231 ms.
Product exploration explored 100000 steps with 33333 reset in 215 ms.
Computed a total of 287 stabilizing places and 268 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 268
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 (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-13 finished in 59811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p0 U (G(p0)||p1))) U (G(X((p0 U (p1||G(p0)))))||((F(p2) U G(F(p2)))&&X((p0 U (p1||G(p0))))))))))'
Found a Shortening insensitive property : HirschbergSinclair-PT-15-LTLCardinality-12
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 305/305 places, 283/283 transitions.
Graph (complete) has 567 edges and 305 vertex of which 302 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 287 transition count 150
Reduce places removed 118 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 169 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 168 transition count 149
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 247 place count 160 transition count 141
Iterating global reduction 3 with 8 rules applied. Total rules applied 255 place count 160 transition count 141
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 256 place count 160 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 257 place count 159 transition count 140
Applied a total of 257 rules in 34 ms. Remains 159 /305 variables (removed 146) and now considering 140/283 (removed 143) transitions.
// Phase 1: matrix 140 rows 159 cols
[2025-06-01 11:09:24] [INFO ] Computed 19 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:09:24] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-01 11:09:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:09:24] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2025-06-01 11:09:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 2/249 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/299 variables, and 153 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6138 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 111/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 2/249 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/299 variables, and 264 constraints, problems are : Problem set: 0 solved, 111 unsolved in 24710 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30867ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 30867ms
Starting structural reductions in LI_LTL mode, iteration 1 : 159/305 places, 140/283 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 31549 ms. Remains : 159/305 places, 140/283 transitions.
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-12
Product exploration explored 100000 steps with 720 reset in 159 ms.
Product exploration explored 100000 steps with 712 reset in 187 ms.
Computed a total of 159 stabilizing places and 140 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 140
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) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 236 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 24 states, 70 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 857 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false, (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false, (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Reduction of identical properties reduced properties to check from 15 to 13
RANDOM walk for 40000 steps (248 resets) in 259 ms. (153 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40004 steps (34 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (36 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
[2025-06-01 11:09:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
Problem apf5 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/106 variables, 16/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/131 variables, 3/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf6 is UNSAT
At refinement iteration 5 (OVERLAPS) 113/244 variables, 131/150 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/245 variables, 1/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/299 variables, and 151 constraints, problems are : Problem set: 3 solved, 1 unsolved in 119 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 132/159 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 101/106 variables, 16/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/131 variables, 3/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem apf13 is UNSAT
After SMT solving in domain Int declared 244/299 variables, and 150 constraints, problems are : Problem set: 4 solved, 0 unsolved in 97 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 131/159 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 221ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (G (OR (NOT p2) p0 p1)), (G (OR (NOT p2) (NOT p0) (NOT p1))), (G (OR (NOT p2) p0 (NOT p1))), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p2) p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 1492 ms. Reduced automaton from 24 states, 70 edges and 3 AP (stutter insensitive) to 17 states, 49 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 837 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false]
Stuttering acceptance computed with spot in 836 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false]
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 140/140 transitions.
Applied a total of 0 rules in 8 ms. Remains 159 /159 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2025-06-01 11:10:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:10:00] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-01 11:10:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:10:01] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:10:01] [INFO ] Redundant transitions in 3 ms returned []
Running 111 sub problems to find dead transitions.
[2025-06-01 11:10:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 2/249 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/299 variables, and 153 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6320 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 111/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 2/249 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/299 variables, and 264 constraints, problems are : Problem set: 0 solved, 111 unsolved in 24829 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31178ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 31178ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31804 ms. Remains : 159/159 places, 140/140 transitions.
Computed a total of 159 stabilizing places and 140 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 140
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) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (OR p2 (NOT p0) p1))), (X p0), (X (NOT (AND p2 p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 205 ms. Reduced automaton from 17 states, 49 edges and 3 AP (stutter insensitive) to 17 states, 49 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 585 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (248 resets) in 254 ms. (156 steps per ms) remains 4/14 properties
BEST_FIRST walk for 40004 steps (35 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (35 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (36 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
[2025-06-01 11:10:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
Problem apf7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/106 variables, 16/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/131 variables, 3/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf9 is UNSAT
At refinement iteration 5 (OVERLAPS) 113/244 variables, 131/150 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/245 variables, 1/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/299 variables, and 151 constraints, problems are : Problem set: 3 solved, 1 unsolved in 149 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 132/159 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 101/106 variables, 16/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/131 variables, 3/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 244/299 variables, and 150 constraints, problems are : Problem set: 4 solved, 0 unsolved in 103 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 131/159 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 280ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) p0 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (OR p2 (NOT p0) p1))), (X p0), (X (NOT (AND p2 p0 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR p2 (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (G (OR p0 p2 (NOT p1))), (G (OR p0 (NOT p2) p1)), (G (OR p0 (NOT p2) (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 36 factoid took 719 ms. Reduced automaton from 17 states, 49 edges and 3 AP (stutter insensitive) to 17 states, 49 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 599 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Stuttering acceptance computed with spot in 602 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Stuttering acceptance computed with spot in 589 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), false, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p1 p2), false, false, false]
Product exploration explored 100000 steps with 815 reset in 206 ms.
Product exploration explored 100000 steps with 805 reset in 213 ms.
Built C files in :
/tmp/ltsmin6420431689011154915
[2025-06-01 11:10:36] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2025-06-01 11:10:36] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:10:36] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2025-06-01 11:10:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:10:36] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2025-06-01 11:10:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:10:36] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6420431689011154915
Running compilation step : cd /tmp/ltsmin6420431689011154915;'/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 270 ms.
Running link step : cd /tmp/ltsmin6420431689011154915;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6420431689011154915;'/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/stateBased13782759261589047423.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 140/140 transitions.
Applied a total of 0 rules in 12 ms. Remains 159 /159 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2025-06-01 11:10:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:10:52] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-01 11:10:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:10:52] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:10:52] [INFO ] Redundant transitions in 5 ms returned []
Running 111 sub problems to find dead transitions.
[2025-06-01 11:10: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/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 2/249 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/299 variables, and 153 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6420 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 2/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 115/247 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 111/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 2/249 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/249 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/299 variables, and 264 constraints, problems are : Problem set: 0 solved, 111 unsolved in 24194 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 134/159 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30625ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 30626ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31254 ms. Remains : 159/159 places, 140/140 transitions.
Built C files in :
/tmp/ltsmin15734375635926837739
[2025-06-01 11:11:23] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2025-06-01 11:11:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:11:23] [INFO ] Computing symmetric may enable matrix : 140 transitions.
[2025-06-01 11:11:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:11:23] [INFO ] Computing Do-Not-Accords matrix : 140 transitions.
[2025-06-01 11:11:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:11:23] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15734375635926837739
Running compilation step : cd /tmp/ltsmin15734375635926837739;'/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 275 ms.
Running link step : cd /tmp/ltsmin15734375635926837739;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15734375635926837739;'/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/stateBased11583186457080192204.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 11:11:38] [INFO ] Flatten gal took : 6 ms
[2025-06-01 11:11:38] [INFO ] Flatten gal took : 6 ms
[2025-06-01 11:11:38] [INFO ] Time to serialize gal into /tmp/LTL3515154635359316748.gal : 1 ms
[2025-06-01 11:11:38] [INFO ] Time to serialize properties into /tmp/LTL6281108255555748884.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/LTL3515154635359316748.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4768385443665804511.hoa' '-atoms' '/tmp/LTL6281108255555748884.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6281108255555748884.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4768385443665804511.hoa
Reverse transition relation is NOT exact ! Due to transitions t17.t18, t21.t22, t27.t28, t33.t34, t38, t41.t42, t43.t44, t47.t48, t52.t53, t58.t59, t62.t63...301
Computing Next relation with stutter on 1.31836e+11 deadlock states
Detected timeout of ITS tools.
[2025-06-01 11:11:53] [INFO ] Flatten gal took : 6 ms
[2025-06-01 11:11:53] [INFO ] Flatten gal took : 5 ms
[2025-06-01 11:11:53] [INFO ] Time to serialize gal into /tmp/LTL11024799837859969744.gal : 1 ms
[2025-06-01 11:11:53] [INFO ] Time to serialize properties into /tmp/LTL1742715468309900537.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/LTL11024799837859969744.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1742715468309900537.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("(reply_15_2_to_right_13<1)")U((G("(reply_15_2_to_right_13<1)"))||("((rcv_left_election_15_4_14_14>rcv_left_election_5_0_1_...655
Formula 0 simplified : XXG(F(!"((rcv_left_election_15_4_14_14>rcv_left_election_5_0_1_6)&&(reply_15_2_to_right_13<1))" & !"(reply_15_2_to_right_13<1)") & (...339
Reverse transition relation is NOT exact ! Due to transitions t17.t18, t21.t22, t27.t28, t33.t34, t38, t41.t42, t43.t44, t47.t48, t52.t53, t58.t59, t62.t63...301
Computing Next relation with stutter on 1.31836e+11 deadlock states
Detected timeout of ITS tools.
[2025-06-01 11:12:08] [INFO ] Flatten gal took : 6 ms
[2025-06-01 11:12:08] [INFO ] Applying decomposition
[2025-06-01 11:12:08] [INFO ] Flatten gal took : 5 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/graph4374537915882071861.txt' '-o' '/tmp/graph4374537915882071861.bin' '-w' '/tmp/graph4374537915882071861.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4374537915882071861.bin' '-l' '-1' '-v' '-w' '/tmp/graph4374537915882071861.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:12:08] [INFO ] Decomposing Gal with order
[2025-06-01 11:12:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:12:08] [INFO ] Removed a total of 87 redundant transitions.
[2025-06-01 11:12:08] [INFO ] Flatten gal took : 46 ms
[2025-06-01 11:12:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2025-06-01 11:12:08] [INFO ] Time to serialize gal into /tmp/LTL1683766554442832416.gal : 2 ms
[2025-06-01 11:12:08] [INFO ] Time to serialize properties into /tmp/LTL2410040195305409317.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/LTL1683766554442832416.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2410040195305409317.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("(gi2.gi2.gu24.reply_15_2_to_right_13<1)")U((G("(gi2.gi2.gu24.reply_15_2_to_right_13<1)"))||("((gu58.rcv_left_election_15_4...822
Formula 0 simplified : XXG(F(!"((gu58.rcv_left_election_15_4_14_14>gu58.rcv_left_election_5_0_1_6)&&(gi2.gi2.gu24.reply_15_2_to_right_13<1))" & !"(gi2.gi2....421
Reverse transition relation is NOT exact ! Due to transitions gi2.gi0.t17_t18, gi2.gi0.t21_t22, gi2.gi0.t27_t28, gi2.gi0.t236_t237, gi2.gi1.gi1.t52_t53, gi...409
Computing Next relation with stutter on 1.31836e+11 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-12 finished in 180470 ms.
[2025-06-01 11:12:23] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1885294138413929327
[2025-06-01 11:12:23] [INFO ] Computing symmetric may disable matrix : 283 transitions.
[2025-06-01 11:12:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:12:23] [INFO ] Computing symmetric may enable matrix : 283 transitions.
[2025-06-01 11:12:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:12:23] [INFO ] Applying decomposition
[2025-06-01 11:12:23] [INFO ] Flatten gal took : 9 ms
[2025-06-01 11:12:23] [INFO ] Computing Do-Not-Accords matrix : 283 transitions.
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/graph10356020344905134717.txt' '-o' '/tmp/graph10356020344905134717.bin' '-w' '/tmp/graph10356020344905134717.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10356020344905134717.bin' '-l' '-1' '-v' '-w' '/tmp/graph10356020344905134717.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:12:23] [INFO ] Decomposing Gal with order
[2025-06-01 11:12:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:12:23] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:12:23] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1885294138413929327
Running compilation step : cd /tmp/ltsmin1885294138413929327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-01 11:12:23] [INFO ] Removed a total of 43 redundant transitions.
[2025-06-01 11:12:24] [INFO ] Flatten gal took : 53 ms
[2025-06-01 11:12:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 47 ms.
[2025-06-01 11:12:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality15188172713268946516.gal : 3 ms
[2025-06-01 11:12:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality12104071532043446299.ltl : 16 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/LTLCardinality15188172713268946516.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12104071532043446299.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...299
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("(gi0.gi0.gi2.gu28.reply_15_2_to_right_13<1)")U((G("(gi0.gi0.gi2.gu28.reply_15_2_to_right_13<1)"))||("((gu38.rcv_left_elect...858
Formula 0 simplified : XXG(F(!"((gu38.rcv_left_election_15_4_14_14>gu38.rcv_left_election_5_0_1_6)&&(gi0.gi0.gi2.gu28.reply_15_2_to_right_13<1))" & !"(gi0....437
Compilation finished in 684 ms.
Running link step : cd /tmp/ltsmin1885294138413929327;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1885294138413929327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))) U ([](X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))||((<>((LTLAPp2==true)) U [](<>((LTLAPp2==true))))&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gi0.gu0.t237, gi0.gi0.gi0.gu1.t18, gi0.gi0.gi0.gu11.t16, gi0.gi0.gi0.t20, gi0.gi0.gi0...898
Computing Next relation with stutter on 5.6687e+11 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: LTL layer: formula: X(<>((X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))) U ([](X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))||((<>((LTLAPp2==true)) U [](<>((LTLAPp2==true))))&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))))))
pins2lts-mc-linux64( 1/ 8), 0.006: "X(<>((X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))) U ([](X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))||((<>((LTLAPp2==true)) U [](<>((LTLAPp2==true))))&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.038: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.038: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.243: There are 287 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.243: State length is 306, there are 299 groups
pins2lts-mc-linux64( 0/ 8), 0.243: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.243: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.243: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.243: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.826: [Blue] ~120 levels ~960 states ~8968 transitions
pins2lts-mc-linux64( 7/ 8), 0.920: [Blue] ~240 levels ~1920 states ~10872 transitions
pins2lts-mc-linux64( 3/ 8), 1.053: [Blue] ~287 levels ~3840 states ~13576 transitions
pins2lts-mc-linux64( 7/ 8), 1.291: [Blue] ~285 levels ~7680 states ~21768 transitions
pins2lts-mc-linux64( 0/ 8), 1.885: [Blue] ~297 levels ~15360 states ~37712 transitions
pins2lts-mc-linux64( 6/ 8), 2.700: [Blue] ~295 levels ~30720 states ~73792 transitions
pins2lts-mc-linux64( 1/ 8), 3.067: [Blue] ~297 levels ~61440 states ~170896 transitions
pins2lts-mc-linux64( 1/ 8), 3.751: [Blue] ~297 levels ~122880 states ~352920 transitions
pins2lts-mc-linux64( 0/ 8), 4.926: [Blue] ~297 levels ~245760 states ~827392 transitions
pins2lts-mc-linux64( 0/ 8), 7.797: [Blue] ~297 levels ~491520 states ~1786448 transitions
pins2lts-mc-linux64( 1/ 8), 11.761: [Blue] ~297 levels ~983040 states ~3753664 transitions
pins2lts-mc-linux64( 4/ 8), 18.348: [Blue] ~296 levels ~1966080 states ~6983832 transitions
pins2lts-mc-linux64( 4/ 8), 31.631: [Blue] ~296 levels ~3932160 states ~15237640 transitions
pins2lts-mc-linux64( 4/ 8), 58.407: [Blue] ~296 levels ~7864320 states ~33241920 transitions
pins2lts-mc-linux64( 4/ 8), 114.394: [Blue] ~296 levels ~15728640 states ~71295376 transitions
pins2lts-mc-linux64( 4/ 8), 223.252: [Blue] ~296 levels ~31457280 states ~152393744 transitions
pins2lts-mc-linux64( 4/ 8), 447.795: [Blue] ~296 levels ~62914560 states ~326791160 transitions
pins2lts-mc-linux64( 3/ 8), 909.808: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 909.864:
pins2lts-mc-linux64( 0/ 8), 909.864: Explored 119920788 states 725656940 transitions, fanout: 6.051
pins2lts-mc-linux64( 0/ 8), 909.864: Total exploration time 909.590 sec (909.540 sec minimum, 909.565 sec on average)
pins2lts-mc-linux64( 0/ 8), 909.864: States per second: 131840, Transitions per second: 797785
pins2lts-mc-linux64( 0/ 8), 909.864:
pins2lts-mc-linux64( 0/ 8), 909.864: State space has 116593545 states, 157982 are accepting
pins2lts-mc-linux64( 0/ 8), 909.864: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 909.865: blue states: 119920788 (102.85%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 909.865: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 909.865: all-red states: 961685 (0.82%), bogus 5260 (0.00%)
pins2lts-mc-linux64( 0/ 8), 909.865:
pins2lts-mc-linux64( 0/ 8), 909.865: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 909.865:
pins2lts-mc-linux64( 0/ 8), 909.865: Queue width: 8B, total height: 2361, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 909.865: Tree memory: 1145.5MB, 10.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 909.865: Tree fill ratio (roots/leafs): 86.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 909.865: Stored 285 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 909.865: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 909.865: Est. total memory use: 1145.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1885294138413929327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))) U ([](X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))||((<>((LTLAPp2==true)) U [](<>((LTLAPp2==true))))&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1885294138413929327;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))) U ([](X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))||((<>((LTLAPp2==true)) U [](<>((LTLAPp2==true))))&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-01 11:36:35] [INFO ] Flatten gal took : 10 ms
[2025-06-01 11:36:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality9184398635561234804.gal : 2 ms
[2025-06-01 11:36:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality8698986822014944610.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/LTLCardinality9184398635561234804.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8698986822014944610.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X(F((X(("(reply_15_2_to_right_13<1)")U((G("(reply_15_2_to_right_13<1)"))||("((rcv_left_election_15_4_14_14>rcv_left_election_5_0_1_...655
Formula 0 simplified : XXG(F(!"((rcv_left_election_15_4_14_14>rcv_left_election_5_0_1_6)&&(reply_15_2_to_right_13<1))" & !"(reply_15_2_to_right_13<1)") & (...339
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t28, t32...365
Computing Next relation with stutter on 5.6687e+11 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-15"
export BK_EXAMINATION="LTLCardinality"
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-15, examination is LTLCardinality"
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-174876422000075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-15.tgz
mv HirschbergSinclair-PT-15 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;