Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rwxr-xr-x 1 mcc users 55K 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 SquareGrid-PT-020102-LTLFireability-00
FORMULA_NAME SquareGrid-PT-020102-LTLFireability-01
FORMULA_NAME SquareGrid-PT-020102-LTLFireability-02
FORMULA_NAME SquareGrid-PT-020102-LTLFireability-03
FORMULA_NAME SquareGrid-PT-020102-LTLFireability-04
FORMULA_NAME SquareGrid-PT-020102-LTLFireability-05
FORMULA_NAME SquareGrid-PT-020102-LTLFireability-06
FORMULA_NAME SquareGrid-PT-020102-LTLFireability-07
FORMULA_NAME SquareGrid-PT-020102-LTLFireability-08
FORMULA_NAME SquareGrid-PT-020102-LTLFireability-09
FORMULA_NAME SquareGrid-PT-020102-LTLFireability-10
FORMULA_NAME SquareGrid-PT-020102-LTLFireability-11
FORMULA_NAME SquareGrid-PT-020102-LTLFireability-12
FORMULA_NAME SquareGrid-PT-020102-LTLFireability-13
FORMULA_NAME SquareGrid-PT-020102-LTLFireability-14
FORMULA_NAME SquareGrid-PT-020102-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749279074859

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SquareGrid-PT-020102
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 06:51:16] [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-07 06:51:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 06:51:16] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2025-06-07 06:51:16] [INFO ] Transformed 68 places.
[2025-06-07 06:51:16] [INFO ] Transformed 72 transitions.
[2025-06-07 06:51:16] [INFO ] Parsed PT model containing 68 places and 72 transitions and 288 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA SquareGrid-PT-020102-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SquareGrid-PT-020102-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 7 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 68 cols
[2025-06-07 06:51:16] [INFO ] Computed 29 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:16] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-07 06:51:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:16] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2025-06-07 06:51: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/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1317 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1716 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3085ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 3107ms
Finished structural reductions in LTL mode , in 1 iterations and 3449 ms. Remains : 68/68 places, 72/72 transitions.
Support contains 34 out of 68 places after structural reductions.
[2025-06-07 06:51:20] [INFO ] Flatten gal took : 24 ms
[2025-06-07 06:51:20] [INFO ] Flatten gal took : 9 ms
[2025-06-07 06:51:20] [INFO ] Input system was already deterministic with 72 transitions.
Reduction of identical properties reduced properties to check from 28 to 23
RANDOM walk for 423 steps (0 resets) in 40 ms. (10 steps per ms) remains 0/23 properties
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' '!(((F(p0) U (F(p2)&&p1)) U X((p3||(X(p2)&&p4)))))'
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:51:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:20] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-07 06:51:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:20] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2025-06-07 06:51:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1064 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1591 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2668ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2670ms
Finished structural reductions in LTL mode , in 1 iterations and 2811 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 777 ms :[(OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p3) (NOT p4)) (AND (NOT p0) p1 (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p2) p3)), (NOT p2), (AND (NOT p0) p1 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : SquareGrid-PT-020102-LTLFireability-00
Product exploration explored 100000 steps with 7031 reset in 433 ms.
Product exploration explored 100000 steps with 7124 reset in 351 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) (NOT p0) (NOT p2) (NOT p3) (NOT p4)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p0) (NOT p3) p4))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p4))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3) p4)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p4)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0) p3) (AND (NOT p1) (NOT p2) (NOT p0) p4))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p4)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3) p4))))]
False Knowledge obtained : [(X p4), (X (NOT p4)), (X (AND (NOT p3) p4)), (X (NOT (AND (NOT p3) p4))), (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p4))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p4)))), (X (AND (NOT p1) (NOT p3) p4)), (X (NOT (AND (NOT p1) (NOT p3) p4))), (X (AND (NOT p3) (NOT p4))), (X (NOT (AND (NOT p3) (NOT p4)))), (X p0), (X (NOT p0)), (X (AND (NOT p1) (NOT p3) (NOT p4))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p4)))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X p4)), (X (X (NOT p4))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p3) p4))), (X (X (NOT (AND (NOT p1) (NOT p3) p4)))), (X (X (AND (NOT p2) (NOT p3) p4))), (X (X (NOT (AND (NOT p2) (NOT p3) p4)))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (AND (NOT p2) (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) p4))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) p4)))), (X (X (AND (NOT p1) (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3) (NOT p4))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND (NOT p3) p4))), (X (X (NOT (AND (NOT p3) p4)))), (X (X (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) (NOT p2) p4)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) (NOT p2) p4))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 2507 ms. Reduced automaton from 13 states, 42 edges and 5 AP (stutter sensitive) to 13 states, 40 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 641 ms :[(OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p3) (NOT p4)) (AND (NOT p0) p1 (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2) p4) (AND (NOT p2) p3)), (NOT p2), (AND (NOT p0) p1 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Reduction of identical properties reduced properties to check from 29 to 24
RANDOM walk for 40000 steps (25 resets) in 1146 ms. (34 steps per ms) remains 8/24 properties
BEST_FIRST walk for 40004 steps (9 resets) in 257 ms. (155 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (11 resets) in 108 ms. (366 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (10 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (10 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (11 resets) in 367 ms. (108 steps per ms) remains 8/8 properties
[2025-06-07 06:51:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
Problem apf11 is UNSAT
Problem apf13 is UNSAT
Problem apf14 is UNSAT
Problem apf18 is UNSAT
Problem apf20 is UNSAT
Problem apf21 is UNSAT
Problem apf24 is UNSAT
After SMT solving in domain Real declared 6/140 variables, and 0 constraints, problems are : Problem set: 8 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 0/28 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/68 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3) (NOT p4)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p0) (NOT p3) p4))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p4))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3) p4)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) p4)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0) p3) (AND (NOT p1) (NOT p2) (NOT p0) p4))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p4)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3) p4)))), (G (OR p0 (NOT p1) p3 (NOT p4))), (G (AND (OR p0 p1 (NOT p3) p2) (OR p0 p1 (NOT p4) p2))), (G (OR p0 (NOT p1) p3 p4)), (G (OR p0 (NOT p1) p3 (NOT p4) p2)), (G (OR p0 p1 p3 (NOT p4) p2)), (G (OR p0 p1 p3 (NOT p4))), (G (OR (NOT p1) p3 p2)), (G (OR p0 (NOT p1) p3 p4 p2))]
False Knowledge obtained : [(X p4), (X (NOT p4)), (X (AND (NOT p3) p4)), (X (NOT (AND (NOT p3) p4))), (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p4))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p4)))), (X (AND (NOT p1) (NOT p3) p4)), (X (NOT (AND (NOT p1) (NOT p3) p4))), (X (AND (NOT p3) (NOT p4))), (X (NOT (AND (NOT p3) (NOT p4)))), (X p0), (X (NOT p0)), (X (AND (NOT p1) (NOT p3) (NOT p4))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p4)))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X p4)), (X (X (NOT p4))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p3) p4))), (X (X (NOT (AND (NOT p1) (NOT p3) p4)))), (X (X (AND (NOT p2) (NOT p3) p4))), (X (X (NOT (AND (NOT p2) (NOT p3) p4)))), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (AND (NOT p2) (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) p4))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) p4)))), (X (X (AND (NOT p1) (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3) (NOT p4))))), (X (X (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (AND (NOT p3) p4))), (X (X (NOT (AND (NOT p3) p4)))), (X (X (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) (NOT p2) p4)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) (NOT p2) p4))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p4))))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p1) (NOT p3) p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4)))), (F (NOT (AND (OR p1 (NOT p3) p2) (OR p1 (NOT p4) p2)))), (F p2), (F (NOT (OR p1 p3 (NOT p4) p2))), (F p4), (F p3), (F p1), (F (NOT (OR p3 (NOT p4)))), (F (NOT (OR p1 p3 (NOT p4)))), (F (NOT (AND (NOT p3) (NOT p4) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p3) (NOT p4)))), (F (NOT (AND (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p4)))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p4) (NOT p2)))), (F (NOT (OR p3 (NOT p4) p2)))]
Knowledge based reduction with 25 factoid took 3312 ms. Reduced automaton from 13 states, 40 edges and 5 AP (stutter sensitive) to 9 states, 23 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 416 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p2) p3) (AND (NOT p2) p4)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 438 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p2) p3) (AND (NOT p2) p4)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
[2025-06-07 06:51:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:51:33] [INFO ] [Real]Absence check using 28 positive place invariants in 7 ms returned sat
[2025-06-07 06:51:33] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-07 06:51:33] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-07 06:51:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:51:33] [INFO ] [Nat]Absence check using 28 positive place invariants in 7 ms returned sat
[2025-06-07 06:51:33] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-07 06:51:33] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-06-07 06:51:33] [INFO ] Computed and/alt/rep : 56/56/56 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-07 06:51:33] [INFO ] Added : 22 causal constraints over 5 iterations in 69 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
[2025-06-07 06:51:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:51:33] [INFO ] [Real]Absence check using 28 positive place invariants in 6 ms returned sat
[2025-06-07 06:51:33] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-07 06:51:33] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2025-06-07 06:51:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:51:33] [INFO ] [Nat]Absence check using 28 positive place invariants in 7 ms returned sat
[2025-06-07 06:51:33] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 06:51:33] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-07 06:51:33] [INFO ] Computed and/alt/rep : 56/56/56 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-07 06:51:33] [INFO ] Added : 21 causal constraints over 5 iterations in 39 ms. Result :sat
Could not prove EG (AND (NOT p3) (NOT p4))
[2025-06-07 06:51:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:51:33] [INFO ] [Real]Absence check using 28 positive place invariants in 11 ms returned sat
[2025-06-07 06:51:33] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-07 06:51:34] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-06-07 06:51:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:51:34] [INFO ] [Nat]Absence check using 28 positive place invariants in 6 ms returned sat
[2025-06-07 06:51:34] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 5 ms returned sat
[2025-06-07 06:51:34] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-07 06:51:34] [INFO ] Computed and/alt/rep : 56/56/56 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 06:51:34] [INFO ] Added : 20 causal constraints over 4 iterations in 30 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:51:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:34] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-07 06:51:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:34] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2025-06-07 06:51:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1120 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1626 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2757ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2757ms
Finished structural reductions in LTL mode , in 1 iterations and 2880 ms. Remains : 68/68 places, 72/72 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 p3) (NOT p1) (NOT p4) (NOT p2)), (X (NOT p3)), (X (NOT p1))]
False Knowledge obtained : [(X p4), (X (NOT p4)), (X (AND (NOT p3) (NOT p4))), (X (NOT (AND (NOT p3) (NOT p4)))), (X (AND (NOT p3) p4)), (X (NOT (AND (NOT p3) p4))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (NOT p0)), (X (AND (NOT p1) (NOT p3) p4)), (X (NOT (AND (NOT p1) (NOT p3) p4))), (X (AND (NOT p1) (NOT p3) (NOT p4))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p4)))), (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 p4)), (X (X (NOT p4))), (X (X (OR (AND p1 p3 (NOT p2)) (AND p1 (NOT p4) (NOT p2))))), (X (X (NOT (OR (AND p1 p3 (NOT p2)) (AND p1 (NOT p4) (NOT p2)))))), (X (X (AND (NOT p3) p4))), (X (X (NOT (AND (NOT p3) p4)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p3) (NOT p4) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p1) p3 (NOT p2)) (AND (NOT p3) p4 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p3 (NOT p2)) (AND (NOT p3) p4 (NOT p2)))))), (X (X (AND (NOT p1) (NOT p3) p4))), (X (X (NOT (AND (NOT p1) (NOT p3) p4)))), (X (X (AND (NOT p3) p4 (NOT p2)))), (X (X (NOT (AND (NOT p3) p4 (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4)))))]
Knowledge based reduction with 3 factoid took 1498 ms. Reduced automaton from 9 states, 23 edges and 5 AP (stutter sensitive) to 9 states, 23 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 420 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p2) p3) (AND (NOT p2) p4)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Reduction of identical properties reduced properties to check from 17 to 12
RANDOM walk for 178 steps (0 resets) in 5 ms. (29 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p4) (NOT p2)), (X (NOT p3)), (X (NOT p1))]
False Knowledge obtained : [(X p4), (X (NOT p4)), (X (AND (NOT p3) (NOT p4))), (X (NOT (AND (NOT p3) (NOT p4)))), (X (AND (NOT p3) p4)), (X (NOT (AND (NOT p3) p4))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (NOT p0)), (X (AND (NOT p1) (NOT p3) p4)), (X (NOT (AND (NOT p1) (NOT p3) p4))), (X (AND (NOT p1) (NOT p3) (NOT p4))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p4)))), (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 p4)), (X (X (NOT p4))), (X (X (OR (AND p1 p3 (NOT p2)) (AND p1 (NOT p4) (NOT p2))))), (X (X (NOT (OR (AND p1 p3 (NOT p2)) (AND p1 (NOT p4) (NOT p2)))))), (X (X (AND (NOT p3) p4))), (X (X (NOT (AND (NOT p3) p4)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p3) (NOT p4) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p1) p3 (NOT p2)) (AND (NOT p3) p4 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p3 (NOT p2)) (AND (NOT p3) p4 (NOT p2)))))), (X (X (AND (NOT p1) (NOT p3) p4))), (X (X (NOT (AND (NOT p1) (NOT p3) p4)))), (X (X (AND (NOT p3) p4 (NOT p2)))), (X (X (NOT (AND (NOT p3) p4 (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p3) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p4))))), (F (NOT (AND (OR (NOT p1) p2 p4) (OR (NOT p1) p2 (NOT p3))))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F p4), (F p0), (F (NOT (OR (NOT p4) p3))), (F (NOT (AND (OR p1 p2 (NOT p3)) (OR p2 (NOT p4) p3)))), (F (NOT (OR p2 (NOT p4) p3))), (F (NOT (AND (NOT p1) (NOT p4) (NOT p3)))), (F (NOT (OR p1 (NOT p4) p3))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F p3), (F p1), (F (NOT (AND (NOT p2) (NOT p4) (NOT p3)))), (F (NOT (AND (NOT p4) (NOT p3)))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 3 factoid took 2030 ms. Reduced automaton from 9 states, 23 edges and 5 AP (stutter sensitive) to 9 states, 23 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 465 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p2) p3) (AND (NOT p2) p4)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 457 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p2) p3) (AND (NOT p2) p4)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
[2025-06-07 06:51:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:51:42] [INFO ] [Real]Absence check using 28 positive place invariants in 7 ms returned sat
[2025-06-07 06:51:42] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-07 06:51:42] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-07 06:51:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:51:42] [INFO ] [Nat]Absence check using 28 positive place invariants in 7 ms returned sat
[2025-06-07 06:51:42] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 06:51:42] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-07 06:51:42] [INFO ] Computed and/alt/rep : 56/56/56 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 06:51:42] [INFO ] Added : 22 causal constraints over 5 iterations in 37 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
[2025-06-07 06:51:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:51:42] [INFO ] [Real]Absence check using 28 positive place invariants in 6 ms returned sat
[2025-06-07 06:51:42] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-07 06:51:42] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-06-07 06:51:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:51:42] [INFO ] [Nat]Absence check using 28 positive place invariants in 7 ms returned sat
[2025-06-07 06:51:42] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 06:51:42] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-07 06:51:42] [INFO ] Computed and/alt/rep : 56/56/56 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 06:51:42] [INFO ] Added : 21 causal constraints over 5 iterations in 37 ms. Result :sat
Could not prove EG (AND (NOT p3) (NOT p4))
[2025-06-07 06:51:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:51:42] [INFO ] [Real]Absence check using 28 positive place invariants in 4 ms returned sat
[2025-06-07 06:51:42] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-07 06:51:42] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-06-07 06:51:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:51:42] [INFO ] [Nat]Absence check using 28 positive place invariants in 6 ms returned sat
[2025-06-07 06:51:42] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-07 06:51:42] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-07 06:51:42] [INFO ] Computed and/alt/rep : 56/56/56 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 06:51:42] [INFO ] Added : 20 causal constraints over 4 iterations in 30 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 401 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (AND p1 (NOT p2)) (AND (NOT p2) p3) (AND (NOT p2) p4)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 3942 reset in 292 ms.
Stuttering criterion allowed to conclude after 3519 steps with 121 reset in 11 ms.
FORMULA SquareGrid-PT-020102-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-LTLFireability-00 finished in 22612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(G(!p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:51:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:43] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-07 06:51:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:43] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2025-06-07 06:51:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1093 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1609 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2709ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2710ms
Finished structural reductions in LTL mode , in 1 iterations and 2833 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : SquareGrid-PT-020102-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SquareGrid-PT-020102-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-LTLFireability-02 finished in 2982 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(p2)&&p1)||p0))&&X(F(p3))))'
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:51:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:46] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 06:51:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:46] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2025-06-07 06:51:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1039 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1614 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2666ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2666ms
Finished structural reductions in LTL mode , in 1 iterations and 2771 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p3), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SquareGrid-PT-020102-LTLFireability-03
Product exploration explored 100000 steps with 3951 reset in 332 ms.
Product exploration explored 100000 steps with 3924 reset in 411 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) p2 (NOT p3)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X p2), (X (NOT p2)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT p0)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p3))), (X (X p3)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 754 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 17 states, 51 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 657 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p3), (AND (NOT p0) (NOT p2)), false, false, false, false, false, false, false, false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 21 to 19
RANDOM walk for 40000 steps (17 resets) in 313 ms. (127 steps per ms) remains 7/19 properties
BEST_FIRST walk for 40004 steps (9 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (11 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 45 ms. (869 steps per ms) remains 7/7 properties
[2025-06-07 06:51:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
Problem apf15 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
After SMT solving in domain Real declared 6/140 variables, and 0 constraints, problems are : Problem set: 7 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 0/28 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/68 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 (NOT p3)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (OR (NOT p0) (NOT p1) (NOT p2) p3)), (G (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (G (OR (NOT p0) p1 (NOT p2) p3)), (G (OR p0 p1 p2 (NOT p3))), (G (OR p0 p2)), (G (OR p0 (NOT p1) p2 (NOT p3))), (G (OR (NOT p0) p1 (NOT p2) (NOT p3)))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X p2), (X (NOT p2)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT p0)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p3))), (X (X p3)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT p2)), (F p0), (F p3), (F (NOT (OR p0 p1 (NOT p2) (NOT p3)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F p1)]
Knowledge based reduction with 13 factoid took 1198 ms. Reduced automaton from 17 states, 51 edges and 4 AP (stutter insensitive) to 10 states, 28 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p3) (AND (NOT p1) p2)), (AND (NOT p1) p2), (NOT p3), false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p3) (AND (NOT p1) p2)), (AND (NOT p1) p2), (NOT p3), false, false, false, false, false, false, false]
[2025-06-07 06:51:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:51:53] [INFO ] [Real]Absence check using 28 positive place invariants in 5 ms returned sat
[2025-06-07 06:51:53] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-07 06:51:53] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2025-06-07 06:51:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:51:53] [INFO ] [Nat]Absence check using 28 positive place invariants in 6 ms returned sat
[2025-06-07 06:51:53] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-07 06:51:53] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-07 06:51:53] [INFO ] Computed and/alt/rep : 56/56/56 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 06:51:53] [INFO ] Added : 23 causal constraints over 5 iterations in 33 ms. Result :sat
Could not prove EG (NOT p3)
[2025-06-07 06:51:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:51:54] [INFO ] [Real]Absence check using 28 positive place invariants in 6 ms returned sat
[2025-06-07 06:51:54] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-07 06:51:54] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-07 06:51:54] [INFO ] Computed and/alt/rep : 56/56/56 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 06:51:54] [INFO ] Added : 22 causal constraints over 5 iterations in 54 ms. Result :sat
Could not prove EG (AND (NOT p1) p2)
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 7 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:51:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:54] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-07 06:51:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:51:54] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:51:54] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2025-06-07 06:51:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1560 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2591ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2591ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2714 ms. Remains : 68/68 places, 72/72 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 p1) p2 (NOT p3)), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT p3)), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p1 p2 p3))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p3))), (X (X p3)), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
Knowledge based reduction with 13 factoid took 841 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter insensitive) to 10 states, 28 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p3) (AND (NOT p1) p2)), (AND p2 (NOT p1)), (NOT p3), false, false, false, false, false, false, false]
RANDOM walk for 2921 steps (2 resets) in 23 ms. (121 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p3)), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT p3)), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND p1 p2 p3))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p1) p2 p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p3))), (X (X p3)), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (F (NOT (OR (NOT p2) (NOT p3) p1))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR p2 p3 (NOT p1)))), (F (NOT (OR p2 (NOT p3) (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p3) (NOT p1)))), (F p3), (F (NOT (OR p2 p3 p1))), (F p1), (F (NOT (OR (NOT p2) p3 (NOT p1)))), (F (NOT (OR p2 (NOT p3) p1)))]
Knowledge based reduction with 13 factoid took 1221 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter insensitive) to 10 states, 28 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p3) (AND (NOT p1) p2)), (AND p2 (NOT p1)), (NOT p3), false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p3) (AND (NOT p1) p2)), (AND p2 (NOT p1)), (NOT p3), false, false, false, false, false, false, false]
[2025-06-07 06:51:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:52:00] [INFO ] [Real]Absence check using 28 positive place invariants in 5 ms returned sat
[2025-06-07 06:52:00] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-07 06:52:00] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-06-07 06:52:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:52:00] [INFO ] [Nat]Absence check using 28 positive place invariants in 6 ms returned sat
[2025-06-07 06:52:00] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-07 06:52:00] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-07 06:52:00] [INFO ] Computed and/alt/rep : 56/56/56 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-07 06:52:00] [INFO ] Added : 23 causal constraints over 5 iterations in 39 ms. Result :sat
Could not prove EG (NOT p3)
[2025-06-07 06:52:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:52:00] [INFO ] [Real]Absence check using 28 positive place invariants in 6 ms returned sat
[2025-06-07 06:52:00] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-07 06:52:00] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-07 06:52:00] [INFO ] Computed and/alt/rep : 56/56/56 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 06:52:00] [INFO ] Added : 22 causal constraints over 5 iterations in 35 ms. Result :sat
Could not prove EG (AND (NOT p1) p2)
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p3) (AND (NOT p1) p2)), (AND p2 (NOT p1)), (NOT p3), false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 4186 reset in 281 ms.
Stack based approach found an accepted trace after 5925 steps with 276 reset with depth 28 and stack size 28 in 18 ms.
FORMULA SquareGrid-PT-020102-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SquareGrid-PT-020102-LTLFireability-03 finished in 14656 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)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 6 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:52:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:01] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-07 06:52:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:01] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:52:01] [INFO ] Redundant transitions in 0 ms returned []
Running 56 sub problems to find dead transitions.
[2025-06-07 06:52:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1001 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1542 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2551ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2552ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2666 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-020102-LTLFireability-04
Product exploration explored 100000 steps with 3232 reset in 349 ms.
Product exploration explored 100000 steps with 3159 reset in 309 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 94 steps (0 resets) in 6 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 5 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:52:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:05] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-07 06:52:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:05] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:52:05] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2025-06-07 06:52: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/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1050 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1649 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2708ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2708ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2829 ms. Remains : 68/68 places, 72/72 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3192 reset in 290 ms.
Product exploration explored 100000 steps with 3195 reset in 300 ms.
Built C files in :
/tmp/ltsmin13324283506813373895
[2025-06-07 06:52:09] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2025-06-07 06:52:09] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:52:09] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2025-06-07 06:52:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:52:09] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2025-06-07 06:52:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:52:09] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13324283506813373895
Running compilation step : cd /tmp/ltsmin13324283506813373895;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 275 ms.
Running link step : cd /tmp/ltsmin13324283506813373895;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin13324283506813373895;'/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/stateBased1193823032510775933.hoa' '--buchi-type=spotba'
LTSmin run took 288 ms.
FORMULA SquareGrid-PT-020102-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SquareGrid-PT-020102-LTLFireability-04 finished in 8734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p1))||p0))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:52:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:09] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-07 06:52:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:09] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2025-06-07 06: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/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1624 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2677ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2678ms
Finished structural reductions in LTL mode , in 1 iterations and 2804 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SquareGrid-PT-020102-LTLFireability-06
Product exploration explored 100000 steps with 8484 reset in 246 ms.
Stack based approach found an accepted trace after 72082 steps with 7321 reset with depth 738 and stack size 733 in 216 ms.
FORMULA SquareGrid-PT-020102-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SquareGrid-PT-020102-LTLFireability-06 finished in 3405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0) U (!p1 U p2))) U X((p3 U !p2)))))'
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:52:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:13] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-07 06:52:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:13] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2025-06-07 06:52:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1067 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1602 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2677ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2678ms
Finished structural reductions in LTL mode , in 1 iterations and 2779 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 269 ms :[p2, p2, p2, (AND (NOT p0) p2), (NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : SquareGrid-PT-020102-LTLFireability-07
Product exploration explored 100000 steps with 2935 reset in 294 ms.
Product exploration explored 100000 steps with 2970 reset in 308 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 p2 p1 p0 (NOT p3)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p0), (X (X (NOT (AND p2 (NOT p0) p3))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3)))))]
Knowledge based reduction with 4 factoid took 386 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[p2, p2, p2, (NOT p2), (NOT p0), (NOT p2)]
RANDOM walk for 271 steps (0 resets) in 7 ms. (33 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 p1 p0 (NOT p3)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p0), (X (X (NOT (AND p2 (NOT p0) p3))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (F (NOT p0)), (F (NOT (AND p2 (NOT p3)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2))), (F p3)]
Knowledge based reduction with 4 factoid took 597 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[p2, p2, p2, (NOT p2), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 190 ms :[p2, p2, p2, (NOT p2), (NOT p0), (NOT p2)]
[2025-06-07 06:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:52:18] [INFO ] [Real]Absence check using 28 positive place invariants in 5 ms returned sat
[2025-06-07 06:52:18] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-07 06:52:18] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-06-07 06:52:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:52:18] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2025-06-07 06:52:18] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-07 06:52:18] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-07 06:52:18] [INFO ] Computed and/alt/rep : 56/56/56 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 06:52:18] [INFO ] Added : 22 causal constraints over 5 iterations in 44 ms. Result :sat
Could not prove EG p2
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:18] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-07 06:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:18] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2025-06-07 06:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1077 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1618 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2703ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2704ms
Finished structural reductions in LTL mode , in 1 iterations and 2821 ms. Remains : 68/68 places, 72/72 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 p2 (NOT p3) p0 p1)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3)))))]
Knowledge based reduction with 1 factoid took 199 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[p2, p2, p2, (NOT p2), (NOT p0), (NOT p2)]
RANDOM walk for 265 steps (0 resets) in 4 ms. (53 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 (NOT p3) p0 p1)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (F (NOT p0)), (F (NOT (AND p2 (NOT p3)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2))), (F p3)]
Knowledge based reduction with 1 factoid took 347 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[p2, p2, p2, (NOT p2), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 253 ms :[p2, p2, p2, (NOT p2), (NOT p0), (NOT p2)]
[2025-06-07 06:52:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:52:22] [INFO ] [Real]Absence check using 28 positive place invariants in 5 ms returned sat
[2025-06-07 06:52:22] [INFO ] [Real]Absence check using 28 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-07 06:52:22] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-06-07 06:52:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 06:52:22] [INFO ] [Nat]Absence check using 28 positive place invariants in 6 ms returned sat
[2025-06-07 06:52:22] [INFO ] [Nat]Absence check using 28 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-07 06:52:23] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-07 06:52:23] [INFO ] Computed and/alt/rep : 56/56/56 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 06:52:23] [INFO ] Added : 22 causal constraints over 5 iterations in 33 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 255 ms :[p2, p2, p2, (NOT p2), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 2982 reset in 281 ms.
Product exploration explored 100000 steps with 2924 reset in 319 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 220 ms :[p2, p2, p2, (NOT p2), (NOT p0), (NOT p2)]
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:52:24] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2025-06-07 06:52: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/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1032 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1587 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2629ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2631ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2643 ms. Remains : 68/68 places, 72/72 transitions.
Built C files in :
/tmp/ltsmin16343042345990901138
[2025-06-07 06:52:26] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16343042345990901138
Running compilation step : cd /tmp/ltsmin16343042345990901138;'/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 150 ms.
Running link step : cd /tmp/ltsmin16343042345990901138;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16343042345990901138;'/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/stateBased13156982450424384153.hoa' '--buchi-type=spotba'
LTSmin run took 429 ms.
FORMULA SquareGrid-PT-020102-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SquareGrid-PT-020102-LTLFireability-07 finished in 14437 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(G(p1)) U p1)||G(p2)))))'
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 6 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:52:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:27] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 06:52:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:27] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:52:27] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2025-06-07 06:52:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1049 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1608 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2664ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2665ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2784 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : SquareGrid-PT-020102-LTLFireability-08
Product exploration explored 100000 steps with 2136 reset in 287 ms.
Product exploration explored 100000 steps with 2163 reset in 303 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 p2 p1 p0), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0)))]
False Knowledge obtained : [(X (AND p2 (NOT p1) p0)), (X (NOT (AND p2 (NOT p1) p0))), (X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
Knowledge based reduction with 3 factoid took 493 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2))]
RANDOM walk for 256 steps (0 resets) in 6 ms. (36 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (NOT (AND (NOT p2) (NOT p1) p0)))]
False Knowledge obtained : [(X (AND p2 (NOT p1) p0)), (X (NOT (AND p2 (NOT p1) p0))), (X p2), (X (NOT p2)), (X p1), (X (NOT p1)), (X (X (AND p2 (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F (NOT (OR p1 (NOT p0) p2)))]
Knowledge based reduction with 3 factoid took 596 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2))]
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:52:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:32] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-07 06:52:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:32] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:52:32] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2025-06-07 06:52:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1024 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1599 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2630ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2631ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2754 ms. Remains : 68/68 places, 72/72 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 p1 p0 p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 472 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2))]
RANDOM walk for 196 steps (0 resets) in 4 ms. (39 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F (NOT (OR p1 (NOT p0) p2)))]
Knowledge based reduction with 3 factoid took 588 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2))]
Product exploration explored 100000 steps with 2230 reset in 313 ms.
Product exploration explored 100000 steps with 2175 reset in 332 ms.
Built C files in :
/tmp/ltsmin664768202627326306
[2025-06-07 06:52:37] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2025-06-07 06:52:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:52:37] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2025-06-07 06:52:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:52:37] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2025-06-07 06:52:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:52:37] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin664768202627326306
Running compilation step : cd /tmp/ltsmin664768202627326306;'/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 164 ms.
Running link step : cd /tmp/ltsmin664768202627326306;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin664768202627326306;'/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/stateBased18420813296583021227.hoa' '--buchi-type=spotba'
LTSmin run took 122 ms.
FORMULA SquareGrid-PT-020102-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SquareGrid-PT-020102-LTLFireability-08 finished in 9988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((G(p0)||X(!p1)))))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:37] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-07 06:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:37] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2025-06-07 06:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1585 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2678ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2679ms
Finished structural reductions in LTL mode , in 1 iterations and 2798 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 268 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : SquareGrid-PT-020102-LTLFireability-09
Entered a terminal (fully accepting) state of product in 54 steps with 0 reset in 0 ms.
FORMULA SquareGrid-PT-020102-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-LTLFireability-09 finished in 3081 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(F(p1)) U G(p2))))))'
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:52:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:40] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 06:52:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:40] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2025-06-07 06:52:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1073 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1598 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2680ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2680ms
Finished structural reductions in LTL mode , in 1 iterations and 2791 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : SquareGrid-PT-020102-LTLFireability-10
Product exploration explored 100000 steps with 4651 reset in 283 ms.
Stack based approach found an accepted trace after 23717 steps with 1088 reset with depth 74 and stack size 74 in 67 ms.
FORMULA SquareGrid-PT-020102-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SquareGrid-PT-020102-LTLFireability-10 finished in 3354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(X((X(G(p0))||X(p1)))))) U p2))'
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:52:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:44] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-07 06:52:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:44] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2025-06-07 06:52:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1594 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2651ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2651ms
Finished structural reductions in LTL mode , in 1 iterations and 2754 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SquareGrid-PT-020102-LTLFireability-11
Stuttering criterion allowed to conclude after 3639 steps with 240 reset in 17 ms.
FORMULA SquareGrid-PT-020102-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-LTLFireability-11 finished in 2961 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)||G(p1))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:52:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:47] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 06:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:47] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:52:47] [INFO ] Redundant transitions in 0 ms returned []
Running 56 sub problems to find dead transitions.
[2025-06-07 06:52: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/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1058 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1603 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2668ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2668ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2781 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SquareGrid-PT-020102-LTLFireability-12
Product exploration explored 100000 steps with 30 reset in 366 ms.
Product exploration explored 100000 steps with 34 reset in 405 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), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (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 526 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 507 steps (0 resets) in 5 ms. (84 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (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 p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 660 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:52:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:51] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-07 06:52:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:51] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:52:51] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2025-06-07 06:52: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/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1049 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1583 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2638ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2642ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2757 ms. Remains : 68/68 places, 72/72 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 p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (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 550 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 947 steps (0 resets) in 11 ms. (78 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (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 p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 646 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33 reset in 290 ms.
Product exploration explored 100000 steps with 42 reset in 311 ms.
Built C files in :
/tmp/ltsmin8321569668007335168
[2025-06-07 06:52:56] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2025-06-07 06:52:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:52:56] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2025-06-07 06:52:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:52:56] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2025-06-07 06:52:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:52:56] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8321569668007335168
Running compilation step : cd /tmp/ltsmin8321569668007335168;'/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 167 ms.
Running link step : cd /tmp/ltsmin8321569668007335168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin8321569668007335168;'/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/stateBased6662240946060758612.hoa' '--buchi-type=spotba'
LTSmin run took 193 ms.
FORMULA SquareGrid-PT-020102-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SquareGrid-PT-020102-LTLFireability-12 finished in 10018 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)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:52:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:57] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 06:52:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:52:57] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:52:57] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2025-06-07 06:52:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1580 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2603ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2604ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2714 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SquareGrid-PT-020102-LTLFireability-13
Product exploration explored 100000 steps with 2136 reset in 273 ms.
Product exploration explored 100000 steps with 2118 reset in 289 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 99 steps (0 resets) in 4 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 5 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:53:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:53:00] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-07 06:53:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:53:00] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 06:53:00] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2025-06-07 06:53: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/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1610 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2686ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2687ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2809 ms. Remains : 68/68 places, 72/72 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 117 steps (0 resets) in 5 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2155 reset in 265 ms.
Product exploration explored 100000 steps with 2111 reset in 292 ms.
Built C files in :
/tmp/ltsmin14098566194697286869
[2025-06-07 06:53:04] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2025-06-07 06:53:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:53:04] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2025-06-07 06:53:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:53:04] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2025-06-07 06:53:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 06:53:04] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14098566194697286869
Running compilation step : cd /tmp/ltsmin14098566194697286869;'/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 182 ms.
Running link step : cd /tmp/ltsmin14098566194697286869;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14098566194697286869;'/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/stateBased886988496997410512.hoa' '--buchi-type=spotba'
LTSmin run took 195 ms.
FORMULA SquareGrid-PT-020102-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SquareGrid-PT-020102-LTLFireability-13 finished in 8162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(!p0) U (p1||F(p2))))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:53:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:53:05] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-07 06:53:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:53:05] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2025-06-07 06: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/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1064 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1605 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2677ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2677ms
Finished structural reductions in LTL mode , in 1 iterations and 2787 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2)]
Running random walk in product with property : SquareGrid-PT-020102-LTLFireability-14
Product exploration explored 100000 steps with 1950 reset in 278 ms.
Product exploration explored 100000 steps with 1947 reset in 297 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) p2 p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 424 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2)]
RANDOM walk for 793 steps (0 resets) in 11 ms. (66 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p2 p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p0 p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 1 factoid took 627 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2)]
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:53:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:53:10] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-07 06:53:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:53:10] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2025-06-07 06:53:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1053 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1574 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2634ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2634ms
Finished structural reductions in LTL mode , in 1 iterations and 2745 ms. Remains : 68/68 places, 72/72 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 p1) p2 p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 499 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2)]
RANDOM walk for 378 steps (0 resets) in 8 ms. (42 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p2 p0)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p0 p1 p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 1 factoid took 592 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2)]
Product exploration explored 100000 steps with 2049 reset in 275 ms.
Stack based approach found an accepted trace after 38536 steps with 761 reset with depth 50 and stack size 50 in 115 ms.
FORMULA SquareGrid-PT-020102-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SquareGrid-PT-020102-LTLFireability-14 finished in 9845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p1))&&p0)))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-06-07 06:53:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:53:15] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-07 06:53:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 06:53:15] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2025-06-07 06:53:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 97 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1001 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 32/68 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 56/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1531 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2539ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2539ms
Finished structural reductions in LTL mode , in 1 iterations and 2642 ms. Remains : 68/68 places, 72/72 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SquareGrid-PT-020102-LTLFireability-15
Product exploration explored 100000 steps with 2389 reset in 361 ms.
Stuttering criterion allowed to conclude after 46794 steps with 1104 reset in 195 ms.
FORMULA SquareGrid-PT-020102-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SquareGrid-PT-020102-LTLFireability-15 finished in 3364 ms.
All properties solved by simple procedures.
Total runtime 122356 ms.

BK_STOP 1749279198459

--------------------
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="SquareGrid-PT-020102"
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 SquareGrid-PT-020102, 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 r212-tall-174901995300892"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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