About the Execution of ITS-Tools for TriangularGrid-PT-5046
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 961243.00 | 0.00 | 0.00 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r240-tall-174915589800444.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 TriangularGrid-PT-5046, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915589800444
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 8.3K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rwxr-xr-x 1 mcc users 185K May 29 14:33 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 TriangularGrid-PT-5046-LTLFireability-00
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-01
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-02
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-03
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-04
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-05
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-06
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-07
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-08
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-09
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-10
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-11
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-12
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-13
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-14
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749235454403
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TriangularGrid-PT-5046
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 18:44:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 18:44:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 18:44:15] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2025-06-06 18:44:15] [INFO ] Transformed 280 places.
[2025-06-06 18:44:15] [INFO ] Transformed 240 transitions.
[2025-06-06 18:44:15] [INFO ] Parsed PT model containing 280 places and 240 transitions and 960 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Support contains 72 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 32 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
// Phase 1: matrix 240 rows 280 cols
[2025-06-06 18:44:16] [INFO ] Computed 116 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:44:16] [INFO ] Implicit Places using invariants in 395 ms returned []
[2025-06-06 18:44:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:44:16] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:44:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11669 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 21149 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32892ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 32912ms
Finished structural reductions in LTL mode , in 1 iterations and 33693 ms. Remains : 280/280 places, 240/240 transitions.
Support contains 72 out of 280 places after structural reductions.
[2025-06-06 18:44:50] [INFO ] Flatten gal took : 43 ms
[2025-06-06 18:44:50] [INFO ] Flatten gal took : 20 ms
[2025-06-06 18:44:50] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 69 out of 280 places (down from 72) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 37 to 33
RANDOM walk for 2223 steps (0 resets) in 356 ms. (6 steps per ms) remains 0/33 properties
FORMULA TriangularGrid-PT-5046-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA TriangularGrid-PT-5046-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)&&X(p2)&&p0))&&F(G(p2))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 19 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:44:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:44:51] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-06-06 18:44:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:44:51] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:44:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11121 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 21070 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32218ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 32219ms
Finished structural reductions in LTL mode , in 1 iterations and 32686 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-00 finished in 33150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 19 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:45:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:45:24] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-06 18:45:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:45:24] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:45:24] [INFO ] Redundant transitions in 12 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:45: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, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11280 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20688 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31991ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31992ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32467 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-01
Product exploration explored 100000 steps with 1060 reset in 1493 ms.
Product exploration explored 100000 steps with 1111 reset in 1522 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 295 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 908 steps (0 resets) in 35 ms. (25 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p0), (F p1)]
Knowledge based reduction with 1 factoid took 314 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-06 18:46:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:46:01] [INFO ] [Real]Absence check using 115 positive place invariants in 395 ms returned sat
[2025-06-06 18:46:01] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 14 ms returned sat
[2025-06-06 18:46:02] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2025-06-06 18:46:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:46:02] [INFO ] [Nat]Absence check using 115 positive place invariants in 167 ms returned sat
[2025-06-06 18:46:02] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 12 ms returned sat
[2025-06-06 18:46:03] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2025-06-06 18:46:03] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-06 18:46:03] [INFO ] Added : 88 causal constraints over 18 iterations in 476 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-06 18:46:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:46:03] [INFO ] [Real]Absence check using 115 positive place invariants in 33 ms returned sat
[2025-06-06 18:46:04] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 653 ms returned sat
[2025-06-06 18:46:05] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2025-06-06 18:46:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:46:05] [INFO ] [Nat]Absence check using 115 positive place invariants in 81 ms returned sat
[2025-06-06 18:46:05] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 503 ms returned sat
[2025-06-06 18:46:06] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2025-06-06 18:46:06] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-06 18:46:06] [INFO ] Added : 85 causal constraints over 17 iterations in 457 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 15 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:46:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:46:07] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-06 18:46:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:46:07] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:46:07] [INFO ] Redundant transitions in 9 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:46:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11139 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20799 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31960ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31961ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32418 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 288 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 549 steps (0 resets) in 33 ms. (16 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p0), (F p1)]
Knowledge based reduction with 1 factoid took 331 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-06 18:46:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:46:40] [INFO ] [Real]Absence check using 115 positive place invariants in 394 ms returned sat
[2025-06-06 18:46:40] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 11 ms returned sat
[2025-06-06 18:46:41] [INFO ] [Real]Absence check using state equation in 989 ms returned sat
[2025-06-06 18:46:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:46:42] [INFO ] [Nat]Absence check using 115 positive place invariants in 161 ms returned sat
[2025-06-06 18:46:42] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 6 ms returned sat
[2025-06-06 18:46:42] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2025-06-06 18:46:42] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-06 18:46:43] [INFO ] Added : 88 causal constraints over 18 iterations in 446 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-06 18:46:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:46:43] [INFO ] [Real]Absence check using 115 positive place invariants in 34 ms returned sat
[2025-06-06 18:46:44] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 656 ms returned sat
[2025-06-06 18:46:44] [INFO ] [Real]Absence check using state equation in 637 ms returned sat
[2025-06-06 18:46:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:46:44] [INFO ] [Nat]Absence check using 115 positive place invariants in 81 ms returned sat
[2025-06-06 18:46:45] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 497 ms returned sat
[2025-06-06 18:46:46] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2025-06-06 18:46:46] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-06 18:46:46] [INFO ] Added : 85 causal constraints over 17 iterations in 443 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1090 reset in 1408 ms.
Product exploration explored 100000 steps with 1008 reset in 1516 ms.
Built C files in :
/tmp/ltsmin5847779664010322172
[2025-06-06 18:46:49] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-06-06 18:46:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:46:49] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-06-06 18:46:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:46:49] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-06-06 18:46:49] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:46:49] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5847779664010322172
Running compilation step : cd /tmp/ltsmin5847779664010322172;'/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 636 ms.
Running link step : cd /tmp/ltsmin5847779664010322172;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin5847779664010322172;'/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/stateBased397363770458465817.hoa' '--buchi-type=spotba'
LTSmin run took 653 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5046-LTLFireability-01 finished in 87100 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' '!(!((((p1 U p2) U G(p3))&&F(p1)&&p0) U X(p4)))'
Support contains 10 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 10 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:46:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:46:51] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-06 18:46:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:46:51] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:46:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11086 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20543 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31646ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31647ms
Finished structural reductions in LTL mode , in 1 iterations and 32065 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 811 ms :[p4, p4, (AND p1 p3 p4), (AND p1 p3 p4), (AND p2 p3 p4), (AND p3 p4), (AND p3 p4), true, (AND p3 p1 p4), (AND p3 p4), (AND p1 p3 p4), (AND p2 p3 p4), (AND p3 p4), p3, (AND p3 p1), p3, (AND p1 p3), (AND p2 p3)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-02
Entered a terminal (fully accepting) state of product in 97 steps with 11 reset in 3 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-02 finished in 32920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X((G(p0)||p2))&&p1))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:47:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:47:24] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-06 18:47:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:47:24] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:47: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, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11260 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20524 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31800ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31801ms
Finished structural reductions in LTL mode , in 1 iterations and 32254 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-04 finished in 32484 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(G(p0))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:47:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:47:56] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-06 18:47:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:47:56] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:47: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/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11021 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20435 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31476ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31476ms
Finished structural reductions in LTL mode , in 1 iterations and 31905 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-05
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 2 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-05 finished in 32062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 10 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:48:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:48:28] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-06 18:48:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:48:28] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:48:28] [INFO ] Redundant transitions in 3 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:48:28] [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, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10958 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20499 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31472ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31472ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31927 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-06
Product exploration explored 100000 steps with 223 reset in 1447 ms.
Product exploration explored 100000 steps with 231 reset in 1531 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 581 steps (0 resets) in 28 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2025-06-06 18:49:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TriangularGrid-PT-5046-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TriangularGrid-PT-5046-LTLFireability-06 finished in 35584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(!p0) U ((X(!p0)&&G(p1))||X(G(!p0)))) U (G((X(!p0) U ((X(!p0)&&G(p1))||X(G(!p0)))))||(!p2&&(X(!p0) U ((X(!p0)&&G(p1))||X(G(!p0))))))))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:49:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:49:04] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-06 18:49:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:49:04] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:49:04] [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, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11019 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20741 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31776ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31777ms
Finished structural reductions in LTL mode , in 1 iterations and 32207 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 300 ms :[p0, false, p0, false, (AND p0 (NOT p1)), false, false]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-07
Product exploration explored 100000 steps with 28604 reset in 980 ms.
Product exploration explored 100000 steps with 28503 reset in 1018 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 1060 ms. Reduced automaton from 7 states, 32 edges and 3 AP (stutter sensitive) to 7 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[p0, false, p0, false, (AND p0 (NOT p1)), false, false]
RANDOM walk for 2570 steps (0 resets) in 80 ms. (31 steps per ms) remains 0/14 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 p0 (NOT p2)))), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0)))), (F p2), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F p0), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 9 factoid took 1616 ms. Reduced automaton from 7 states, 32 edges and 3 AP (stutter sensitive) to 7 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[p0, false, p0, false, (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 329 ms :[p0, false, p0, false, (AND p0 (NOT p1)), false, false]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:49:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:49:42] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-06-06 18:49:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:49:42] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:49:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11182 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 21230 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32430ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 32430ms
Finished structural reductions in LTL mode , in 1 iterations and 32877 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 1071 ms. Reduced automaton from 7 states, 32 edges and 3 AP (stutter sensitive) to 7 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[p0, false, p0, false, (AND p0 (NOT p1)), false, false]
RANDOM walk for 2020 steps (0 resets) in 69 ms. (28 steps per ms) remains 0/14 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 p0 (NOT p2)))), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0)))), (F p2), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F p0), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 9 factoid took 1624 ms. Reduced automaton from 7 states, 32 edges and 3 AP (stutter sensitive) to 7 states, 32 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[p0, false, p0, false, (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 287 ms :[p0, false, p0, false, (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 311 ms :[p0, false, p0, false, (AND p0 (NOT p1)), false, false]
Product exploration explored 100000 steps with 28543 reset in 959 ms.
Product exploration explored 100000 steps with 28669 reset in 1010 ms.
Built C files in :
/tmp/ltsmin11556657820894273910
[2025-06-06 18:50:21] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11556657820894273910
Running compilation step : cd /tmp/ltsmin11556657820894273910;'/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 418 ms.
Running link step : cd /tmp/ltsmin11556657820894273910;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11556657820894273910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4524283031311574900.hoa' '--buchi-type=spotba'
LTSmin run took 1606 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5046-LTLFireability-07 finished in 79517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:50:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:50:23] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-06 18:50:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:50:24] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:50: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, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11003 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20601 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31619ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31619ms
Finished structural reductions in LTL mode , in 1 iterations and 32046 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-08
Entered a terminal (fully accepting) state of product in 90 steps with 0 reset in 4 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-08 finished in 32162 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))&&G((p1||(!p2 U (p3||G(!p2)))))))'
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:50:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:50:55] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-06 18:50:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:50:56] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:50: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/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11273 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20496 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31785ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31786ms
Finished structural reductions in LTL mode , in 1 iterations and 32197 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), true, (NOT p0), (AND p1 (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-09
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 2 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-09 finished in 32462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (p1||G(!p0))))))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:51:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:51:28] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-06 18:51:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:51:28] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:51:28] [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, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11086 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20621 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31733ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31734ms
Finished structural reductions in LTL mode , in 1 iterations and 32165 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 140 ms :[p0, p0, (AND p0 (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-10
Product exploration explored 100000 steps with 742 reset in 1424 ms.
Product exploration explored 100000 steps with 728 reset in 1490 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 485 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[p0, p0, (AND p0 (NOT p1))]
RANDOM walk for 634 steps (0 resets) in 38 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 609 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[p0, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[p0, p0, (AND p0 (NOT p1))]
[2025-06-06 18:52:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:52:05] [INFO ] [Real]Absence check using 115 positive place invariants in 35 ms returned sat
[2025-06-06 18:52:05] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 74 ms returned sat
[2025-06-06 18:52:07] [INFO ] [Real]Absence check using state equation in 2652 ms returned sat
[2025-06-06 18:52:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:52:08] [INFO ] [Nat]Absence check using 115 positive place invariants in 73 ms returned sat
[2025-06-06 18:52:08] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 48 ms returned sat
[2025-06-06 18:52:08] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2025-06-06 18:52:08] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-06 18:52:09] [INFO ] Added : 89 causal constraints over 18 iterations in 451 ms. Result :sat
Could not prove EG p0
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:52:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:52:09] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-06 18:52:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:52:09] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:52:09] [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, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11048 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20470 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31532ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31532ms
Finished structural reductions in LTL mode , in 1 iterations and 31986 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 472 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[p0, p0, (AND p0 (NOT p1))]
RANDOM walk for 461 steps (0 resets) in 19 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 556 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[p0, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[p0, p0, (AND p0 (NOT p1))]
[2025-06-06 18:52:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:52:42] [INFO ] [Real]Absence check using 115 positive place invariants in 35 ms returned sat
[2025-06-06 18:52:42] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 73 ms returned sat
[2025-06-06 18:52:45] [INFO ] [Real]Absence check using state equation in 2639 ms returned sat
[2025-06-06 18:52:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:52:45] [INFO ] [Nat]Absence check using 115 positive place invariants in 73 ms returned sat
[2025-06-06 18:52:45] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 45 ms returned sat
[2025-06-06 18:52:46] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2025-06-06 18:52:46] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-06 18:52:46] [INFO ] Added : 89 causal constraints over 18 iterations in 417 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 115 ms :[p0, p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 730 reset in 1442 ms.
Product exploration explored 100000 steps with 732 reset in 1527 ms.
Built C files in :
/tmp/ltsmin5486760834230008064
[2025-06-06 18:52:49] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5486760834230008064
Running compilation step : cd /tmp/ltsmin5486760834230008064;'/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 412 ms.
Running link step : cd /tmp/ltsmin5486760834230008064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5486760834230008064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8485136784722421150.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:53:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:53:05] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-06 18:53:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:53:05] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:53:05] [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, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10992 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31069ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31070ms
Finished structural reductions in LTL mode , in 1 iterations and 31498 ms. Remains : 280/280 places, 240/240 transitions.
Built C files in :
/tmp/ltsmin7936905561118007881
[2025-06-06 18:53:36] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7936905561118007881
Running compilation step : cd /tmp/ltsmin7936905561118007881;'/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 400 ms.
Running link step : cd /tmp/ltsmin7936905561118007881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7936905561118007881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14832908232221415484.hoa' '--buchi-type=spotba'
LTSmin run took 822 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5046-LTLFireability-10 finished in 129655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 12 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:53:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:53:38] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-06 18:53:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:53:38] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:53:38] [INFO ] Redundant transitions in 2 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:53:38] [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, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11122 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20470 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31606ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31608ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32045 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-12
Product exploration explored 100000 steps with 372 reset in 1457 ms.
Product exploration explored 100000 steps with 355 reset in 1554 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 435 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1649 steps (0 resets) in 55 ms. (29 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 518 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 12 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:54:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:54:14] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-06 18:54:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:54:14] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:54:14] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:54:14] [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, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11102 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20307 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31423ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31425ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31856 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 435 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1242 steps (0 resets) in 48 ms. (25 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 515 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 362 reset in 1455 ms.
Product exploration explored 100000 steps with 382 reset in 1531 ms.
Built C files in :
/tmp/ltsmin14245369857512393335
[2025-06-06 18:54:50] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-06-06 18:54:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:54:50] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-06-06 18:54:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:54:50] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-06-06 18:54:50] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:54:50] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14245369857512393335
Running compilation step : cd /tmp/ltsmin14245369857512393335;'/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 504 ms.
Running link step : cd /tmp/ltsmin14245369857512393335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14245369857512393335;'/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/stateBased3213754642600135285.hoa' '--buchi-type=spotba'
LTSmin run took 1669 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5046-LTLFireability-12 finished in 74897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 12 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:54:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:54:52] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-06 18:54:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:54:53] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:54:53] [INFO ] Redundant transitions in 0 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:54: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/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11023 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20446 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31483ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31483ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31923 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-13
Stuttering criterion allowed to conclude after 9625 steps with 0 reset in 121 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-13 finished in 32105 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)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:55:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:55:25] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-06 18:55:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:55:25] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:55: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/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11187 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20475 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31675ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31675ms
Finished structural reductions in LTL mode , in 1 iterations and 32109 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-14
Product exploration explored 100000 steps with 38595 reset in 774 ms.
Product exploration explored 100000 steps with 38818 reset in 840 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 448 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 810 steps (0 resets) in 26 ms. (30 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 530 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:56:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:56:00] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-06 18:56:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:56:00] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:56:00] [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, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11031 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20509 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31554ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31554ms
Finished structural reductions in LTL mode , in 1 iterations and 31978 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 436 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1115 steps (0 resets) in 40 ms. (27 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 513 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 38851 reset in 768 ms.
Product exploration explored 100000 steps with 38935 reset in 846 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 24 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:56:35] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:56:35] [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, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11204 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20466 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31685ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31685ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31718 ms. Remains : 280/280 places, 240/240 transitions.
Built C files in :
/tmp/ltsmin2918188811020134325
[2025-06-06 18:57:06] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2918188811020134325
Running compilation step : cd /tmp/ltsmin2918188811020134325;'/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 400 ms.
Running link step : cd /tmp/ltsmin2918188811020134325;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2918188811020134325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16728805841352525835.hoa' '--buchi-type=spotba'
LTSmin run took 972 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5046-LTLFireability-14 finished in 103430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||((p2 U p3)&&p1)))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 15 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:57:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:57:08] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-06 18:57:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:57:08] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:57:08] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:57:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11106 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20615 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31744ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31745ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32196 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-15
Product exploration explored 100000 steps with 247 reset in 1367 ms.
Product exploration explored 100000 steps with 236 reset in 1465 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND p0 (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2))))]
Knowledge based reduction with 10 factoid took 1047 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter insensitive) to 3 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 911 ms. (43 steps per ms) remains 3/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 3/3 properties
[2025-06-06 18:57:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 6/520 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/115 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/280 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (G (OR p0 p2 p3)), (G (OR p0 (NOT p2) p3)), (G (OR p0 (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND p0 (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (AND (OR p0 p1) (OR p0 p2 p3)))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F p2), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p0) p2 p3)))), (F (NOT p3)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 13 factoid took 1350 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 12 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:57:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:57:47] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-06 18:57:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:57:47] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:57:47] [INFO ] Redundant transitions in 0 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:57:47] [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, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10973 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20340 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31336ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31337ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31772 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1))), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1))))), (X (X (AND p2 (NOT p3) p1))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 880 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 775 ms. (51 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
[2025-06-06 18:58:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf6 is UNSAT
After SMT solving in domain Real declared 6/520 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/115 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/280 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (G (OR p0 p1 p2 p3))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1))), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1))))), (X (X (AND p2 (NOT p3) p1))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR (NOT p0) p2 p3) (OR (NOT p1) p2 p3)))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p1) p2 p3)))), (F p2), (F (NOT p3)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p2) p3))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 1161 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 242 reset in 1320 ms.
Product exploration explored 100000 steps with 272 reset in 1397 ms.
Built C files in :
/tmp/ltsmin11434978920112159934
[2025-06-06 18:58:24] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-06-06 18:58:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:58:24] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-06-06 18:58:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:58:24] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-06-06 18:58:24] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:58:24] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11434978920112159934
Running compilation step : cd /tmp/ltsmin11434978920112159934;'/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 490 ms.
Running link step : cd /tmp/ltsmin11434978920112159934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11434978920112159934;'/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/stateBased3880597150631206195.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 13 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:58:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:58:39] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-06-06 18:58:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:58:39] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:58:39] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:58:39] [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, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11028 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20606 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31649ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31650ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32070 ms. Remains : 280/280 places, 240/240 transitions.
Built C files in :
/tmp/ltsmin10264097331672712531
[2025-06-06 18:59:11] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-06-06 18:59:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:59:11] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-06-06 18:59:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:59:11] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-06-06 18:59:11] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:59:11] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10264097331672712531
Running compilation step : cd /tmp/ltsmin10264097331672712531;'/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 494 ms.
Running link step : cd /tmp/ltsmin10264097331672712531;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10264097331672712531;'/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/stateBased18155448414173753006.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 18:59:26] [INFO ] Flatten gal took : 14 ms
[2025-06-06 18:59:26] [INFO ] Flatten gal took : 13 ms
[2025-06-06 18:59:26] [INFO ] Time to serialize gal into /tmp/LTL5636427749568267152.gal : 5 ms
[2025-06-06 18:59:26] [INFO ] Time to serialize properties into /tmp/LTL17027099141193745926.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5636427749568267152.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18090160497908911959.hoa' '-atoms' '/tmp/LTL17027099141193745926.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/LTL17027099141193745926.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18090160497908911959.hoa
Detected timeout of ITS tools.
[2025-06-06 18:59:41] [INFO ] Flatten gal took : 14 ms
[2025-06-06 18:59:41] [INFO ] Flatten gal took : 13 ms
[2025-06-06 18:59:41] [INFO ] Time to serialize gal into /tmp/LTL14587068401791724409.gal : 4 ms
[2025-06-06 18:59:41] [INFO ] Time to serialize properties into /tmp/LTL15653730101852703287.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/LTL14587068401791724409.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15653730101852703287.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((pb1_5_2<1)||(pil1_5_3<1))||((pbl_3_2<1)||(po2_3_1<1)))"))||(("((pb3_4_5>=1)&&(pol3_4_5>=1))")&&(("((pbl_3_2>=1)&&(po2_3_...203
Formula 0 simplified : G(F!"(((pb1_5_2<1)||(pil1_5_3<1))||((pbl_3_2<1)||(po2_3_1<1)))" & FG(!"((pb3_4_5>=1)&&(pol3_4_5>=1))" | (!"((pbl_3_2>=1)&&(po2_3_1>=...197
Detected timeout of ITS tools.
[2025-06-06 18:59:56] [INFO ] Flatten gal took : 13 ms
[2025-06-06 18:59:56] [INFO ] Applying decomposition
[2025-06-06 18:59:56] [INFO ] Flatten gal took : 13 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/graph16515102516296086711.txt' '-o' '/tmp/graph16515102516296086711.bin' '-w' '/tmp/graph16515102516296086711.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16515102516296086711.bin' '-l' '-1' '-v' '-w' '/tmp/graph16515102516296086711.weights' '-q' '0' '-e' '0.001'
[2025-06-06 18:59:57] [INFO ] Decomposing Gal with order
[2025-06-06 18:59:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 18:59:57] [INFO ] Removed a total of 150 redundant transitions.
[2025-06-06 18:59:57] [INFO ] Flatten gal took : 61 ms
[2025-06-06 18:59:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-06 18:59:57] [INFO ] Time to serialize gal into /tmp/LTL3390412043569445058.gal : 5 ms
[2025-06-06 18:59:57] [INFO ] Time to serialize properties into /tmp/LTL17549314097036646155.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/LTL3390412043569445058.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17549314097036646155.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((i8.i1.u18.pb1_5_2<1)||(i11.u31.pil1_5_3<1))||((i1.i1.u11.pbl_3_2<1)||(i1.i1.u101.po2_3_1<1)))"))||(("((i3.i0.u5.pb3_4_5>...300
Formula 0 simplified : G(F!"(((i8.i1.u18.pb1_5_2<1)||(i11.u31.pil1_5_3<1))||((i1.i1.u11.pbl_3_2<1)||(i1.i1.u101.po2_3_1<1)))" & FG(!"((i3.i0.u5.pb3_4_5>=1)...294
Detected timeout of ITS tools.
Treatment of property TriangularGrid-PT-5046-LTLFireability-15 finished in 183849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||((p2 U p3)&&p1)))))'
[2025-06-06 19:00:12] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2451313905309069244
[2025-06-06 19:00:12] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-06-06 19:00:12] [INFO ] Applying decomposition
[2025-06-06 19:00:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 19:00:12] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-06-06 19:00:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 19:00:12] [INFO ] Flatten gal took : 9 ms
[2025-06-06 19:00:12] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-06-06 19:00:12] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 19:00:12] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2451313905309069244
Running compilation step : cd /tmp/ltsmin2451313905309069244;'/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'
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/graph7028000685117004487.txt' '-o' '/tmp/graph7028000685117004487.bin' '-w' '/tmp/graph7028000685117004487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7028000685117004487.bin' '-l' '-1' '-v' '-w' '/tmp/graph7028000685117004487.weights' '-q' '0' '-e' '0.001'
[2025-06-06 19:00:12] [INFO ] Decomposing Gal with order
[2025-06-06 19:00:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 19:00:12] [INFO ] Removed a total of 150 redundant transitions.
[2025-06-06 19:00:12] [INFO ] Flatten gal took : 30 ms
[2025-06-06 19:00:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-06 19:00:12] [INFO ] Time to serialize gal into /tmp/LTLFireability15852545401494495797.gal : 4 ms
[2025-06-06 19:00:12] [INFO ] Time to serialize properties into /tmp/LTLFireability14193942520597363345.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/LTLFireability15852545401494495797.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14193942520597363345.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(((i9.i0.u20.pb1_5_2<1)||(i9.i1.u57.pil1_5_3<1))||((i3.i0.u9.pbl_3_2<1)||(i3.i0.u101.po2_3_1<1)))"))||(("((i6.i0.u4.pb3_4_5...304
Formula 0 simplified : G(F!"(((i9.i0.u20.pb1_5_2<1)||(i9.i1.u57.pil1_5_3<1))||((i3.i0.u9.pbl_3_2<1)||(i3.i0.u101.po2_3_1<1)))" & FG(!"((i6.i0.u4.pb3_4_5>=1...298
Compilation finished in 492 ms.
Running link step : cd /tmp/ltsmin2451313905309069244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2451313905309069244;'/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' '--ltl' '[](<>(([]((LTLAPp0==true))||(((LTLAPp2==true) U (LTLAPp3==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
LTSmin run took 2698 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 959840 ms.
BK_STOP 1749236415646
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TriangularGrid-PT-5046"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is TriangularGrid-PT-5046, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r240-tall-174915589800444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-5046.tgz
mv TriangularGrid-PT-5046 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;