Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r540-smll-171690573900252.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is TriangularGrid-PT-4022, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r540-smll-171690573900252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 13 04:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 13 04:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 144K Apr 13 04:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 121K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-00
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-01
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-02
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-03
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-04
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-05
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-06
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-07
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-08
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-09
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-10
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-11
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-12
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-13
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-14
FORMULA_NAME TriangularGrid-PT-4022-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717268057450

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TriangularGrid-PT-4022
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:54:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 18:54:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:54:19] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-06-01 18:54:19] [INFO ] Transformed 184 places.
[2024-06-01 18:54:19] [INFO ] Transformed 156 transitions.
[2024-06-01 18:54:19] [INFO ] Parsed PT model containing 184 places and 156 transitions and 624 arcs in 388 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 87 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA TriangularGrid-PT-4022-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-4022-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-4022-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 25 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 184 cols
[2024-06-01 18:54:20] [INFO ] Computed 77 invariants in 43 ms
[2024-06-01 18:54:20] [INFO ] Implicit Places using invariants in 718 ms returned []
[2024-06-01 18:54:20] [INFO ] Invariant cache hit.
[2024-06-01 18:54:21] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 1204 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:54:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4625 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7465 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 12221ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 12243ms
Finished structural reductions in LTL mode , in 1 iterations and 13504 ms. Remains : 184/184 places, 156/156 transitions.
Support contains 60 out of 184 places after structural reductions.
[2024-06-01 18:54:33] [INFO ] Flatten gal took : 60 ms
[2024-06-01 18:54:33] [INFO ] Flatten gal took : 25 ms
[2024-06-01 18:54:33] [INFO ] Input system was already deterministic with 156 transitions.
Support contains 58 out of 184 places (down from 60) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 30
RANDOM walk for 946 steps (0 resets) in 262 ms. (3 steps per ms) remains 0/30 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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||((G(!p2)&&p1) U p3))))'
Support contains 8 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 13 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:54:34] [INFO ] Invariant cache hit.
[2024-06-01 18:54:34] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-06-01 18:54:34] [INFO ] Invariant cache hit.
[2024-06-01 18:54:35] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:54:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4248 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7228 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11526ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11529ms
Finished structural reductions in LTL mode , in 1 iterations and 12121 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 392 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) p2)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-00
Product exploration explored 100000 steps with 38322 reset in 936 ms.
Product exploration explored 100000 steps with 37561 reset in 929 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 718 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
RANDOM walk for 173 steps (0 resets) in 13 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p3))), (F (NOT p0)), (F p3)]
Knowledge based reduction with 2 factoid took 981 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Support contains 4 out of 184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 17 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:54:51] [INFO ] Invariant cache hit.
[2024-06-01 18:54:51] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-06-01 18:54:51] [INFO ] Invariant cache hit.
[2024-06-01 18:54:51] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:54:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4216 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7588 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11848ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11852ms
Finished structural reductions in LTL mode , in 1 iterations and 12389 ms. Remains : 184/184 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p3), (X (NOT p3)), (X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 249 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
RANDOM walk for 535 steps (0 resets) in 23 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p3))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p3), (X (NOT p3)), (X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 p3))), (F (NOT p0)), (F p3)]
Knowledge based reduction with 1 factoid took 319 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Product exploration explored 100000 steps with 38498 reset in 725 ms.
Product exploration explored 100000 steps with 37975 reset in 856 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 12 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:55:06] [INFO ] Redundant transitions in 5 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 18:55:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4245 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7713 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11999ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 12001ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12026 ms. Remains : 184/184 places, 156/156 transitions.
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:55:18] [INFO ] Invariant cache hit.
[2024-06-01 18:55:18] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-06-01 18:55:18] [INFO ] Invariant cache hit.
[2024-06-01 18:55:19] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:55:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4182 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6863 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11075ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11076ms
Finished structural reductions in LTL mode , in 1 iterations and 11615 ms. Remains : 184/184 places, 156/156 transitions.
Treatment of property TriangularGrid-PT-4022-LTLFireability-00 finished in 55737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((F(p1)&&p0)) U p1)))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:55:30] [INFO ] Invariant cache hit.
[2024-06-01 18:55:30] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-06-01 18:55:30] [INFO ] Invariant cache hit.
[2024-06-01 18:55:30] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:55:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4358 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7006 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11394ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11395ms
Finished structural reductions in LTL mode , in 1 iterations and 11911 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-02
Stuttering criterion allowed to conclude after 29963 steps with 7318 reset in 303 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-02 finished in 12414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G(F(!((F(p0) U X(p1)) U !p2)))))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:55:42] [INFO ] Invariant cache hit.
[2024-06-01 18:55:42] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-01 18:55:42] [INFO ] Invariant cache hit.
[2024-06-01 18:55:43] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:55:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4040 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 8179 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 12244ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 12245ms
Finished structural reductions in LTL mode , in 1 iterations and 12783 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 449 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-04
Product exploration explored 100000 steps with 1351 reset in 1138 ms.
Product exploration explored 100000 steps with 1299 reset in 1158 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X p2), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 1748 ms. Reduced automaton from 7 states, 38 edges and 3 AP (stutter sensitive) to 7 states, 38 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
RANDOM walk for 2209 steps (0 resets) in 63 ms. (34 steps per ms) remains 0/16 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X p2), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p0), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 7 factoid took 2362 ms. Reduced automaton from 7 states, 38 edges and 3 AP (stutter sensitive) to 7 states, 38 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 317 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
[2024-06-01 18:56:03] [INFO ] Invariant cache hit.
[2024-06-01 18:56:03] [INFO ] [Real]Absence check using 76 positive place invariants in 34 ms returned sat
[2024-06-01 18:56:03] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 18:56:03] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-06-01 18:56:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:56:03] [INFO ] [Nat]Absence check using 76 positive place invariants in 32 ms returned sat
[2024-06-01 18:56:03] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 7 ms returned sat
[2024-06-01 18:56:03] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-06-01 18:56:03] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 18:56:04] [INFO ] Added : 59 causal constraints over 12 iterations in 236 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:56:04] [INFO ] Invariant cache hit.
[2024-06-01 18:56:04] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 18:56:04] [INFO ] Invariant cache hit.
[2024-06-01 18:56:04] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:56:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4300 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7315 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11643ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11645ms
Finished structural reductions in LTL mode , in 1 iterations and 12175 ms. Remains : 184/184 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X p2), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 1814 ms. Reduced automaton from 7 states, 38 edges and 3 AP (stutter sensitive) to 7 states, 38 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
RANDOM walk for 2120 steps (0 resets) in 48 ms. (43 steps per ms) remains 0/16 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X p2), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F p2), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p1), (F (NOT (OR p2 (NOT p0)))), (F p0), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 7 factoid took 2311 ms. Reduced automaton from 7 states, 38 edges and 3 AP (stutter sensitive) to 7 states, 38 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 450 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
[2024-06-01 18:56:21] [INFO ] Invariant cache hit.
[2024-06-01 18:56:21] [INFO ] [Real]Absence check using 76 positive place invariants in 33 ms returned sat
[2024-06-01 18:56:21] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 18:56:21] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-06-01 18:56:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:56:22] [INFO ] [Nat]Absence check using 76 positive place invariants in 36 ms returned sat
[2024-06-01 18:56:22] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 7 ms returned sat
[2024-06-01 18:56:22] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-06-01 18:56:22] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 18:56:22] [INFO ] Added : 59 causal constraints over 12 iterations in 223 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 297 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1304 reset in 1057 ms.
Product exploration explored 100000 steps with 1284 reset in 1146 ms.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:56:25] [INFO ] Invariant cache hit.
[2024-06-01 18:56:25] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 18:56:25] [INFO ] Invariant cache hit.
[2024-06-01 18:56:25] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:56:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4220 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7186 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11436ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11438ms
Finished structural reductions in LTL mode , in 1 iterations and 11937 ms. Remains : 184/184 places, 156/156 transitions.
Treatment of property TriangularGrid-PT-4022-LTLFireability-04 finished in 54599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!p0&&G(!p1)) U p2))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 8 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:56:37] [INFO ] Invariant cache hit.
[2024-06-01 18:56:37] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-06-01 18:56:37] [INFO ] Invariant cache hit.
[2024-06-01 18:56:37] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2024-06-01 18:56:37] [INFO ] Redundant transitions in 5 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 18:56:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4235 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7460 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11727ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11729ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12316 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-05
Product exploration explored 100000 steps with 38 reset in 928 ms.
Product exploration explored 100000 steps with 43 reset in 1147 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 p0 (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (OR p2 (AND (NOT p0) (NOT p1)))), (X (NOT (OR p2 (AND (NOT p0) (NOT p1))))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (OR p2 (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR p2 (AND (NOT p0) (NOT p1)))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 945 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
RANDOM walk for 1977 steps (0 resets) in 47 ms. (41 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (OR p2 (AND (NOT p0) (NOT p1)))), (X (NOT (OR p2 (AND (NOT p0) (NOT p1))))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (OR p2 (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR p2 (AND (NOT p0) (NOT p1)))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p1 p0))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (AND (OR p2 (NOT p1)) (OR p2 (NOT p0))))), (F (NOT (OR p2 (AND (NOT p1) (NOT p0))))), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 6 factoid took 1221 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 7 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:56:54] [INFO ] Invariant cache hit.
[2024-06-01 18:56:54] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 18:56:54] [INFO ] Invariant cache hit.
[2024-06-01 18:56:54] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2024-06-01 18:56:54] [INFO ] Redundant transitions in 5 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 18:56:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4083 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7267 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11376ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11377ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11942 ms. Remains : 184/184 places, 156/156 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 p1) p0), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (OR p2 (AND (NOT p1) (NOT p0)))), (X (NOT (OR p2 (AND (NOT p1) (NOT p0))))), (X p2), (X (NOT p2)), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (OR p2 (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR p2 (AND (NOT p1) (NOT p0)))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 1024 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
RANDOM walk for 2004 steps (0 resets) in 37 ms. (52 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X (OR p2 (AND (NOT p1) (NOT p0)))), (X (NOT (OR p2 (AND (NOT p1) (NOT p0))))), (X p2), (X (NOT p2)), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (OR p2 (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR p2 (AND (NOT p1) (NOT p0)))))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p1 p0))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p2 p1))), (F (NOT (AND (OR p2 (NOT p1)) (OR p2 (NOT p0))))), (F (NOT (OR p2 (AND (NOT p1) (NOT p0))))), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 6 factoid took 1214 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 43 reset in 929 ms.
Product exploration explored 100000 steps with 40 reset in 957 ms.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 9 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:57:10] [INFO ] Invariant cache hit.
[2024-06-01 18:57:11] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-01 18:57:11] [INFO ] Invariant cache hit.
[2024-06-01 18:57:11] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-06-01 18:57:11] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 18:57:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4330 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7520 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11877ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11879ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12399 ms. Remains : 184/184 places, 156/156 transitions.
Treatment of property TriangularGrid-PT-4022-LTLFireability-05 finished in 46195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p1) U X((G(!p0) U X(G(p2)))))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:57:23] [INFO ] Invariant cache hit.
[2024-06-01 18:57:23] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-01 18:57:23] [INFO ] Invariant cache hit.
[2024-06-01 18:57:23] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:57:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4103 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7465 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11599ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11600ms
Finished structural reductions in LTL mode , in 1 iterations and 12133 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-06
Product exploration explored 100000 steps with 4126 reset in 1003 ms.
Product exploration explored 100000 steps with 3959 reset in 1076 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) (NOT p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (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 p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 760 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
RANDOM walk for 757 steps (0 resets) in 14 ms. (50 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (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 p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 1 factoid took 997 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 494 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
[2024-06-01 18:57:40] [INFO ] Invariant cache hit.
[2024-06-01 18:57:41] [INFO ] [Real]Absence check using 76 positive place invariants in 38 ms returned sat
[2024-06-01 18:57:41] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 15 ms returned sat
[2024-06-01 18:57:41] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-06-01 18:57:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:57:41] [INFO ] [Nat]Absence check using 76 positive place invariants in 32 ms returned sat
[2024-06-01 18:57:41] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 5 ms returned sat
[2024-06-01 18:57:41] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-06-01 18:57:41] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 18:57:41] [INFO ] Added : 58 causal constraints over 12 iterations in 202 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 18:57:41] [INFO ] Invariant cache hit.
[2024-06-01 18:57:42] [INFO ] [Real]Absence check using 76 positive place invariants in 33 ms returned sat
[2024-06-01 18:57:42] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 34 ms returned sat
[2024-06-01 18:57:42] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-06-01 18:57:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:57:42] [INFO ] [Nat]Absence check using 76 positive place invariants in 39 ms returned sat
[2024-06-01 18:57:42] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 18:57:42] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-06-01 18:57:42] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 18:57:42] [INFO ] Added : 57 causal constraints over 12 iterations in 205 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:57:42] [INFO ] Invariant cache hit.
[2024-06-01 18:57:42] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 18:57:42] [INFO ] Invariant cache hit.
[2024-06-01 18:57:43] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:57:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4157 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7230 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11421ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11423ms
Finished structural reductions in LTL mode , in 1 iterations and 11948 ms. Remains : 184/184 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (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 p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 745 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
RANDOM walk for 778 steps (0 resets) in 14 ms. (51 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (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 p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 1 factoid took 987 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
[2024-06-01 18:57:57] [INFO ] Invariant cache hit.
[2024-06-01 18:57:57] [INFO ] [Real]Absence check using 76 positive place invariants in 34 ms returned sat
[2024-06-01 18:57:57] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 14 ms returned sat
[2024-06-01 18:57:57] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2024-06-01 18:57:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:57:58] [INFO ] [Nat]Absence check using 76 positive place invariants in 35 ms returned sat
[2024-06-01 18:57:58] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 6 ms returned sat
[2024-06-01 18:57:58] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-06-01 18:57:58] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 18:57:58] [INFO ] Added : 58 causal constraints over 12 iterations in 199 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 18:57:58] [INFO ] Invariant cache hit.
[2024-06-01 18:57:58] [INFO ] [Real]Absence check using 76 positive place invariants in 33 ms returned sat
[2024-06-01 18:57:58] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 35 ms returned sat
[2024-06-01 18:57:58] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-06-01 18:57:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:57:58] [INFO ] [Nat]Absence check using 76 positive place invariants in 41 ms returned sat
[2024-06-01 18:57:58] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 18:57:59] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-06-01 18:57:59] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 18:57:59] [INFO ] Added : 57 causal constraints over 12 iterations in 202 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Product exploration explored 100000 steps with 4084 reset in 979 ms.
Product exploration explored 100000 steps with 3890 reset in 1065 ms.
Applying partial POR strategy [false, true, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:58:02] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 18:58:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4099 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7357 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11480ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11481ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11496 ms. Remains : 184/184 places, 156/156 transitions.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:58:13] [INFO ] Invariant cache hit.
[2024-06-01 18:58:13] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-06-01 18:58:13] [INFO ] Invariant cache hit.
[2024-06-01 18:58:14] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:58:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4171 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7087 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11282ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11284ms
Finished structural reductions in LTL mode , in 1 iterations and 11879 ms. Remains : 184/184 places, 156/156 transitions.
Treatment of property TriangularGrid-PT-4022-LTLFireability-06 finished in 62147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:58:25] [INFO ] Invariant cache hit.
[2024-06-01 18:58:25] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-06-01 18:58:25] [INFO ] Invariant cache hit.
[2024-06-01 18:58:26] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:58:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4069 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7414 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11511ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11514ms
Finished structural reductions in LTL mode , in 1 iterations and 12057 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-07 finished in 12160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&((F(X(F(p2))) U p3)||G(X(!p2)))))'
Support contains 8 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:58:37] [INFO ] Invariant cache hit.
[2024-06-01 18:58:37] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 18:58:37] [INFO ] Invariant cache hit.
[2024-06-01 18:58:38] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:58:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4468 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7309 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11804ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11806ms
Finished structural reductions in LTL mode , in 1 iterations and 12329 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (AND p2 (NOT p3))), true, (NOT p1), (AND (NOT p3) p2), (OR (NOT p3) (NOT p2)), (NOT p2)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-09 finished in 12566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 7 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:58:50] [INFO ] Invariant cache hit.
[2024-06-01 18:58:50] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-01 18:58:50] [INFO ] Invariant cache hit.
[2024-06-01 18:58:50] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2024-06-01 18:58:50] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 18:58:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4040 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7959 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 12028ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 12030ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12654 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-10
Stuttering criterion allowed to conclude after 2924 steps with 0 reset in 25 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-10 finished in 12730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(F(p1))||F(p2)))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:59:03] [INFO ] Invariant cache hit.
[2024-06-01 18:59:03] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-01 18:59:03] [INFO ] Invariant cache hit.
[2024-06-01 18:59:03] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:59:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4198 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7035 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11262ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11263ms
Finished structural reductions in LTL mode , in 1 iterations and 11782 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-11
Product exploration explored 100000 steps with 33112 reset in 716 ms.
Product exploration explored 100000 steps with 33114 reset in 792 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 p2 (NOT p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 199 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 391 steps (0 resets) in 12 ms. (30 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p2 (NOT p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 1 factoid took 299 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:59:17] [INFO ] Invariant cache hit.
[2024-06-01 18:59:17] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-06-01 18:59:17] [INFO ] Invariant cache hit.
[2024-06-01 18:59:17] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:59:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4106 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7009 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11139ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11141ms
Finished structural reductions in LTL mode , in 1 iterations and 11678 ms. Remains : 184/184 places, 156/156 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 p2 (NOT p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 209 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 371 steps (0 resets) in 12 ms. (28 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p2 (NOT p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 1 factoid took 302 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 33109 reset in 722 ms.
Product exploration explored 100000 steps with 33051 reset in 795 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 6 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:59:31] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 18:59:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5330 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7051 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 12418ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 12419ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12432 ms. Remains : 184/184 places, 156/156 transitions.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:59:44] [INFO ] Invariant cache hit.
[2024-06-01 18:59:44] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-01 18:59:44] [INFO ] Invariant cache hit.
[2024-06-01 18:59:44] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:59:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4077 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7236 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11337ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11338ms
Finished structural reductions in LTL mode , in 1 iterations and 11867 ms. Remains : 184/184 places, 156/156 transitions.
Treatment of property TriangularGrid-PT-4022-LTLFireability-11 finished in 53300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)&&p0))||X(((p2 U p1)&&F(p3)))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 18:59:56] [INFO ] Invariant cache hit.
[2024-06-01 18:59:56] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-01 18:59:56] [INFO ] Invariant cache hit.
[2024-06-01 18:59:56] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 18:59:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4314 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7137 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11478ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11481ms
Finished structural reductions in LTL mode , in 1 iterations and 12038 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (NOT p1), (OR (NOT p1) (NOT p3))]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-12
Entered a terminal (fully accepting) state of product in 189 steps with 0 reset in 2 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-12 finished in 12319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:00:08] [INFO ] Invariant cache hit.
[2024-06-01 19:00:08] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 19:00:08] [INFO ] Invariant cache hit.
[2024-06-01 19:00:09] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 19:00:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4288 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7136 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11450ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11452ms
Finished structural reductions in LTL mode , in 1 iterations and 12010 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-4022-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-4022-LTLFireability-13 finished in 12104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((!p1 U (G(!p1)||p2)))||p0))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:00:20] [INFO ] Invariant cache hit.
[2024-06-01 19:00:20] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-06-01 19:00:20] [INFO ] Invariant cache hit.
[2024-06-01 19:00:21] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 19:00:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4196 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6903 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11125ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11127ms
Finished structural reductions in LTL mode , in 1 iterations and 11696 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-14
Product exploration explored 100000 steps with 37 reset in 829 ms.
Product exploration explored 100000 steps with 38 reset in 922 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 p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 625 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (14 resets) in 495 ms. (80 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 1/1 properties
[2024-06-01 19:00:35] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
After SMT solving in domain Real declared 6/340 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 0/76 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/184 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p1), (F p0), (F p2), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 828 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 8 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:00:36] [INFO ] Invariant cache hit.
[2024-06-01 19:00:36] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 19:00:36] [INFO ] Invariant cache hit.
[2024-06-01 19:00:36] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-06-01 19:00:36] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 19:00:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4002 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7462 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11490ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11492ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12043 ms. Remains : 184/184 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 771 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 40000 steps (14 resets) in 498 ms. (80 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
[2024-06-01 19:00:49] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 6/340 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 0/76 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/184 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p0), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (F p1)]
Knowledge based reduction with 5 factoid took 1135 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 35 reset in 822 ms.
Product exploration explored 100000 steps with 36 reset in 926 ms.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:00:52] [INFO ] Invariant cache hit.
[2024-06-01 19:00:52] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-01 19:00:52] [INFO ] Invariant cache hit.
[2024-06-01 19:00:53] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2024-06-01 19:00:53] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 19:00:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4773 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7148 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11957ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11968ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12497 ms. Remains : 184/184 places, 156/156 transitions.
Treatment of property TriangularGrid-PT-4022-LTLFireability-14 finished in 44457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:01:05] [INFO ] Invariant cache hit.
[2024-06-01 19:01:05] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-01 19:01:05] [INFO ] Invariant cache hit.
[2024-06-01 19:01:05] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-06-01 19:01:05] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 19:01:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4273 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7437 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11736ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11738ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12262 ms. Remains : 184/184 places, 156/156 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-15
Product exploration explored 100000 steps with 1779 reset in 1007 ms.
Product exploration explored 100000 steps with 1700 reset in 1081 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 151 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 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 301 steps (0 resets) in 9 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 175 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2024-06-01 19:01:20] [INFO ] Invariant cache hit.
[2024-06-01 19:01:20] [INFO ] [Real]Absence check using 76 positive place invariants in 78 ms returned sat
[2024-06-01 19:01:20] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 9 ms returned sat
[2024-06-01 19:01:20] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2024-06-01 19:01:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:01:20] [INFO ] [Nat]Absence check using 76 positive place invariants in 32 ms returned sat
[2024-06-01 19:01:20] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 7 ms returned sat
[2024-06-01 19:01:21] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-06-01 19:01:21] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 19:01:21] [INFO ] Added : 56 causal constraints over 12 iterations in 195 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 12 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:01:21] [INFO ] Invariant cache hit.
[2024-06-01 19:01:21] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-06-01 19:01:21] [INFO ] Invariant cache hit.
[2024-06-01 19:01:21] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2024-06-01 19:01:21] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 19:01:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4168 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11220ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11221ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11768 ms. Remains : 184/184 places, 156/156 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 : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 165 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 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 343 steps (0 resets) in 8 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 166 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-06-01 19:01:33] [INFO ] Invariant cache hit.
[2024-06-01 19:01:33] [INFO ] [Real]Absence check using 76 positive place invariants in 55 ms returned sat
[2024-06-01 19:01:33] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 8 ms returned sat
[2024-06-01 19:01:33] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2024-06-01 19:01:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:01:34] [INFO ] [Nat]Absence check using 76 positive place invariants in 34 ms returned sat
[2024-06-01 19:01:34] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 7 ms returned sat
[2024-06-01 19:01:34] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-06-01 19:01:34] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 19:01:34] [INFO ] Added : 56 causal constraints over 12 iterations in 198 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1652 reset in 989 ms.
Product exploration explored 100000 steps with 1659 reset in 1099 ms.
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:01:36] [INFO ] Invariant cache hit.
[2024-06-01 19:01:36] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-01 19:01:36] [INFO ] Invariant cache hit.
[2024-06-01 19:01:37] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2024-06-01 19:01:37] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 19:01:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4115 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7137 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11278ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11280ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11800 ms. Remains : 184/184 places, 156/156 transitions.
Treatment of property TriangularGrid-PT-4022-LTLFireability-15 finished in 43393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||((G(!p2)&&p1) U p3))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G(F(!((F(p0) U X(p1)) U !p2)))))))'
Found a Shortening insensitive property : TriangularGrid-PT-4022-LTLFireability-04
Stuttering acceptance computed with spot in 365 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:01:49] [INFO ] Invariant cache hit.
[2024-06-01 19:01:50] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 19:01:50] [INFO ] Invariant cache hit.
[2024-06-01 19:01:50] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 19:01:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4567 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7158 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11781ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11784ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 12351 ms. Remains : 184/184 places, 156/156 transitions.
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-04
Product exploration explored 100000 steps with 1294 reset in 1090 ms.
Product exploration explored 100000 steps with 1314 reset in 1178 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X p2), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 1786 ms. Reduced automaton from 7 states, 38 edges and 3 AP (stutter sensitive) to 7 states, 38 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 396 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
RANDOM walk for 2564 steps (0 resets) in 35 ms. (71 steps per ms) remains 0/16 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p2)), (X p2), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p0), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 7 factoid took 2294 ms. Reduced automaton from 7 states, 38 edges and 3 AP (stutter sensitive) to 7 states, 38 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 284 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
[2024-06-01 19:02:09] [INFO ] Invariant cache hit.
[2024-06-01 19:02:09] [INFO ] [Real]Absence check using 76 positive place invariants in 35 ms returned sat
[2024-06-01 19:02:09] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 19:02:10] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-06-01 19:02:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:02:10] [INFO ] [Nat]Absence check using 76 positive place invariants in 39 ms returned sat
[2024-06-01 19:02:10] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 7 ms returned sat
[2024-06-01 19:02:10] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-06-01 19:02:10] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 19:02:10] [INFO ] Added : 59 causal constraints over 12 iterations in 219 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:02:10] [INFO ] Invariant cache hit.
[2024-06-01 19:02:10] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-06-01 19:02:10] [INFO ] Invariant cache hit.
[2024-06-01 19:02:11] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 19:02:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4126 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7234 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11396ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11398ms
Finished structural reductions in LTL mode , in 1 iterations and 11948 ms. Remains : 184/184 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X p2), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 1757 ms. Reduced automaton from 7 states, 38 edges and 3 AP (stutter sensitive) to 7 states, 38 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
RANDOM walk for 1992 steps (0 resets) in 28 ms. (68 steps per ms) remains 0/16 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X p2), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F p2), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p1), (F (NOT (OR p2 (NOT p0)))), (F p0), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 7 factoid took 2304 ms. Reduced automaton from 7 states, 38 edges and 3 AP (stutter sensitive) to 7 states, 38 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 397 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
[2024-06-01 19:02:27] [INFO ] Invariant cache hit.
[2024-06-01 19:02:27] [INFO ] [Real]Absence check using 76 positive place invariants in 38 ms returned sat
[2024-06-01 19:02:27] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 19:02:28] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-06-01 19:02:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:02:28] [INFO ] [Nat]Absence check using 76 positive place invariants in 38 ms returned sat
[2024-06-01 19:02:28] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 6 ms returned sat
[2024-06-01 19:02:28] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-06-01 19:02:28] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 19:02:28] [INFO ] Added : 59 causal constraints over 12 iterations in 201 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 292 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1264 reset in 1062 ms.
Stuttering criterion allowed to conclude after 9690 steps with 104 reset in 110 ms.
Treatment of property TriangularGrid-PT-4022-LTLFireability-04 finished in 41304 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!p0&&G(!p1)) U p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p1) U X((G(!p0) U X(G(p2)))))))'
Found a Lengthening insensitive property : TriangularGrid-PT-4022-LTLFireability-06
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 10 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:02:30] [INFO ] Invariant cache hit.
[2024-06-01 19:02:30] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-06-01 19:02:30] [INFO ] Invariant cache hit.
[2024-06-01 19:02:31] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 19:02:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4150 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7403 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11578ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11580ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 12152 ms. Remains : 184/184 places, 156/156 transitions.
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-06
Product exploration explored 100000 steps with 3834 reset in 980 ms.
Product exploration explored 100000 steps with 3651 reset in 1070 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) (NOT p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (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 p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 733 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
RANDOM walk for 718 steps (0 resets) in 17 ms. (39 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (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 p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 1 factoid took 948 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
[2024-06-01 19:02:47] [INFO ] Invariant cache hit.
[2024-06-01 19:02:47] [INFO ] [Real]Absence check using 76 positive place invariants in 35 ms returned sat
[2024-06-01 19:02:47] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 14 ms returned sat
[2024-06-01 19:02:47] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-06-01 19:02:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:02:48] [INFO ] [Nat]Absence check using 76 positive place invariants in 33 ms returned sat
[2024-06-01 19:02:48] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 7 ms returned sat
[2024-06-01 19:02:48] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-06-01 19:02:48] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 19:02:48] [INFO ] Added : 58 causal constraints over 12 iterations in 201 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 19:02:48] [INFO ] Invariant cache hit.
[2024-06-01 19:02:48] [INFO ] [Real]Absence check using 76 positive place invariants in 29 ms returned sat
[2024-06-01 19:02:48] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 34 ms returned sat
[2024-06-01 19:02:48] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-06-01 19:02:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:02:49] [INFO ] [Nat]Absence check using 76 positive place invariants in 39 ms returned sat
[2024-06-01 19:02:49] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 19:02:49] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-06-01 19:02:49] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 19:02:49] [INFO ] Added : 57 causal constraints over 12 iterations in 204 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:02:49] [INFO ] Invariant cache hit.
[2024-06-01 19:02:49] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-01 19:02:49] [INFO ] Invariant cache hit.
[2024-06-01 19:02:49] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 19:02:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4133 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7106 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11268ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11270ms
Finished structural reductions in LTL mode , in 1 iterations and 11822 ms. Remains : 184/184 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (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 p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 753 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
RANDOM walk for 1682 steps (0 resets) in 26 ms. (62 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (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 p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 1 factoid took 988 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
[2024-06-01 19:03:03] [INFO ] Invariant cache hit.
[2024-06-01 19:03:04] [INFO ] [Real]Absence check using 76 positive place invariants in 34 ms returned sat
[2024-06-01 19:03:04] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 14 ms returned sat
[2024-06-01 19:03:04] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-06-01 19:03:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:03:04] [INFO ] [Nat]Absence check using 76 positive place invariants in 36 ms returned sat
[2024-06-01 19:03:04] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 8 ms returned sat
[2024-06-01 19:03:04] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-06-01 19:03:04] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 19:03:04] [INFO ] Added : 58 causal constraints over 12 iterations in 215 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 19:03:04] [INFO ] Invariant cache hit.
[2024-06-01 19:03:05] [INFO ] [Real]Absence check using 76 positive place invariants in 33 ms returned sat
[2024-06-01 19:03:05] [INFO ] [Real]Absence check using 76 positive and 1 generalized place invariants in 34 ms returned sat
[2024-06-01 19:03:05] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-06-01 19:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:03:05] [INFO ] [Nat]Absence check using 76 positive place invariants in 42 ms returned sat
[2024-06-01 19:03:05] [INFO ] [Nat]Absence check using 76 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 19:03:05] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-06-01 19:03:05] [INFO ] Computed and/alt/rep : 108/108/108 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 19:03:05] [INFO ] Added : 57 causal constraints over 12 iterations in 193 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Product exploration explored 100000 steps with 4178 reset in 977 ms.
Product exploration explored 100000 steps with 3910 reset in 1063 ms.
Applying partial POR strategy [false, true, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) p0 p2)]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:03:08] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 19:03:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4155 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7152 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11339ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11341ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11363 ms. Remains : 184/184 places, 156/156 transitions.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:03:20] [INFO ] Invariant cache hit.
[2024-06-01 19:03:20] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-01 19:03:20] [INFO ] Invariant cache hit.
[2024-06-01 19:03:20] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 19:03:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4130 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7230 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11383ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11384ms
Finished structural reductions in LTL mode , in 1 iterations and 11924 ms. Remains : 184/184 places, 156/156 transitions.
Treatment of property TriangularGrid-PT-4022-LTLFireability-06 finished in 61713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(F(p1))||F(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((!p1 U (G(!p1)||p2)))||p0))))'
Found a Lengthening insensitive property : TriangularGrid-PT-4022-LTLFireability-14
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:03:32] [INFO ] Invariant cache hit.
[2024-06-01 19:03:32] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-06-01 19:03:32] [INFO ] Invariant cache hit.
[2024-06-01 19:03:32] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 19:03:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4113 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7246 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11387ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11394ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 12043 ms. Remains : 184/184 places, 156/156 transitions.
Running random walk in product with property : TriangularGrid-PT-4022-LTLFireability-14
Product exploration explored 100000 steps with 38 reset in 839 ms.
Product exploration explored 100000 steps with 38 reset in 913 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 p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 641 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
RANDOM walk for 40000 steps (15 resets) in 545 ms. (73 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
[2024-06-01 19:03:47] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
After SMT solving in domain Real declared 6/340 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 0/76 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/184 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p1), (F p0), (F p2), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 859 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:03:48] [INFO ] Invariant cache hit.
[2024-06-01 19:03:48] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-06-01 19:03:48] [INFO ] Invariant cache hit.
[2024-06-01 19:03:48] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-06-01 19:03:48] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 19:03:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4192 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7065 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11283ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11285ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11839 ms. Remains : 184/184 places, 156/156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 732 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 40000 steps (14 resets) in 496 ms. (80 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
[2024-06-01 19:04:01] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 6/340 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/76 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/184 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 20ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2)))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F p0), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (F p1)]
Knowledge based reduction with 5 factoid took 1102 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 37 reset in 845 ms.
Product exploration explored 100000 steps with 38 reset in 924 ms.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 156/156 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2024-06-01 19:04:04] [INFO ] Invariant cache hit.
[2024-06-01 19:04:04] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-01 19:04:04] [INFO ] Invariant cache hit.
[2024-06-01 19:04:04] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2024-06-01 19:04:04] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 19:04:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4120 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 93/181 variables, 64/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 156/340 variables, 184/261 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 108/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 369 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7258 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 11412ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 11414ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11950 ms. Remains : 184/184 places, 156/156 transitions.
Treatment of property TriangularGrid-PT-4022-LTLFireability-14 finished in 44055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 19:04:16] [INFO ] Flatten gal took : 19 ms
[2024-06-01 19:04:16] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 19:04:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 184 places, 156 transitions and 624 arcs took 5 ms.
Total runtime 597106 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA TriangularGrid-PT-4022-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLFireability-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA TriangularGrid-PT-4022-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717268899288

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name TriangularGrid-PT-4022-LTLFireability-00
ltl formula formula --ltl=/tmp/5559/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 184 places, 156 transitions and 624 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5559/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5559/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5559/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5559/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 186 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 185, there are 207 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~125!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 281
pnml2lts-mc( 0/ 4): unique states count: 762
pnml2lts-mc( 0/ 4): unique transitions count: 21180
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 33
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 773
pnml2lts-mc( 0/ 4): - cum. max stack depth: 488
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 773 states 21524 transitions, fanout: 27.845
pnml2lts-mc( 0/ 4): Total exploration time 0.160 sec (0.160 sec minimum, 0.160 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4831, Transitions per second: 134525
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.8MB, 39.9 B/state, compr.: 5.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 156 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.8MB (~256.0MB paged-in)
ltl formula name TriangularGrid-PT-4022-LTLFireability-04
ltl formula formula --ltl=/tmp/5559/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 184 places, 156 transitions and 624 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5559/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5559/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5559/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5559/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 13 states
pnml2lts-mc( 0/ 4): There are 185 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 185, there are 296 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~314!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 273
pnml2lts-mc( 0/ 4): unique states count: 1058
pnml2lts-mc( 0/ 4): unique transitions count: 39065
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 4
pnml2lts-mc( 0/ 4): - claim found count: 5
pnml2lts-mc( 0/ 4): - claim success count: 1061
pnml2lts-mc( 0/ 4): - cum. max stack depth: 788
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1061 states 39357 transitions, fanout: 37.094
pnml2lts-mc( 0/ 4): Total exploration time 0.170 sec (0.170 sec minimum, 0.170 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6241, Transitions per second: 231512
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.2MB, 31.8 B/state, compr.: 4.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 156 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.2MB (~256.0MB paged-in)
ltl formula name TriangularGrid-PT-4022-LTLFireability-05
ltl formula formula --ltl=/tmp/5559/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 184 places, 156 transitions and 624 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5559/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5559/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5559/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5559/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 185 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 185, there are 197 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~159!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 612
pnml2lts-mc( 0/ 4): unique transitions count: 31813
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 12
pnml2lts-mc( 0/ 4): - claim success count: 615
pnml2lts-mc( 0/ 4): - cum. max stack depth: 615
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 615 states 31961 transitions, fanout: 51.969
pnml2lts-mc( 0/ 4): Total exploration time 0.130 sec (0.130 sec minimum, 0.130 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4731, Transitions per second: 245854
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.9MB, 36.7 B/state, compr.: 4.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 156 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.9MB (~256.0MB paged-in)
ltl formula name TriangularGrid-PT-4022-LTLFireability-06
ltl formula formula --ltl=/tmp/5559/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 184 places, 156 transitions and 624 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5559/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5559/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5559/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5559/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 185 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 185, there are 207 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~411!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 923
pnml2lts-mc( 0/ 4): unique states count: 2670
pnml2lts-mc( 0/ 4): unique transitions count: 51833
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2673
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1750
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2673 states 52269 transitions, fanout: 19.554
pnml2lts-mc( 0/ 4): Total exploration time 0.220 sec (0.220 sec minimum, 0.220 sec on average)
pnml2lts-mc( 0/ 4): States per second: 12150, Transitions per second: 237586
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.5MB, 34.7 B/state, compr.: 4.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 156 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.5MB (~256.0MB paged-in)
ltl formula name TriangularGrid-PT-4022-LTLFireability-11
ltl formula formula --ltl=/tmp/5559/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 184 places, 156 transitions and 624 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5559/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5559/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5559/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5559/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 186 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 185, there are 161 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~219!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1501
pnml2lts-mc( 0/ 4): unique states count: 2540
pnml2lts-mc( 0/ 4): unique transitions count: 38043
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1256
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2559
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1047
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2559 states 38579 transitions, fanout: 15.076
pnml2lts-mc( 0/ 4): Total exploration time 0.180 sec (0.180 sec minimum, 0.180 sec on average)
pnml2lts-mc( 0/ 4): States per second: 14217, Transitions per second: 214328
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.2MB, 35.3 B/state, compr.: 4.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 156 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.2MB (~256.0MB paged-in)
ltl formula name TriangularGrid-PT-4022-LTLFireability-14
ltl formula formula --ltl=/tmp/5559/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 184 places, 156 transitions and 624 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5559/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5559/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5559/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5559/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 185 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 185, there are 177 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~624 levels ~10000 states ~70416 transitions
pnml2lts-mc( 3/ 4): ~646 levels ~20000 states ~100764 transitions
pnml2lts-mc( 3/ 4): ~1163 levels ~40000 states ~163800 transitions
pnml2lts-mc( 3/ 4): ~6114 levels ~80000 states ~328400 transitions
pnml2lts-mc( 3/ 4): ~6121 levels ~160000 states ~612852 transitions
pnml2lts-mc( 3/ 4): ~6136 levels ~320000 states ~1280892 transitions
pnml2lts-mc( 3/ 4): ~26778 levels ~640000 states ~2791396 transitions
pnml2lts-mc( 3/ 4): ~70671 levels ~1280000 states ~5776612 transitions
pnml2lts-mc( 3/ 4): ~72439 levels ~2560000 states ~12154512 transitions
pnml2lts-mc( 3/ 4): ~77203 levels ~5120000 states ~26293900 transitions
pnml2lts-mc( 3/ 4): ~619571 levels ~10240000 states ~57575028 transitions
pnml2lts-mc( 3/ 4): ~624642 levels ~20480000 states ~116468792 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 108399
pnml2lts-mc( 0/ 4): unique states count: 33055495
pnml2lts-mc( 0/ 4): unique transitions count: 241890320
pnml2lts-mc( 0/ 4): - self-loop count: 1494
pnml2lts-mc( 0/ 4): - claim dead count: 76525620
pnml2lts-mc( 0/ 4): - claim found count: 130126280
pnml2lts-mc( 0/ 4): - claim success count: 33055498
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1758883
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33055498 states 241890467 transitions, fanout: 7.318
pnml2lts-mc( 0/ 4): Total exploration time 240.200 sec (240.170 sec minimum, 240.182 sec on average)
pnml2lts-mc( 0/ 4): States per second: 137617, Transitions per second: 1007038
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 277.0MB, 8.7 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/32.0%
pnml2lts-mc( 0/ 4): Stored 156 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 277.0MB (~256.0MB paged-in)
ltl formula name TriangularGrid-PT-4022-LTLFireability-15
ltl formula formula --ltl=/tmp/5559/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 184 places, 156 transitions and 624 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5559/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5559/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5559/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5559/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 186 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 185, there are 161 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~135!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 280
pnml2lts-mc( 0/ 4): unique states count: 1044
pnml2lts-mc( 0/ 4): unique transitions count: 28230
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1047
pnml2lts-mc( 0/ 4): - cum. max stack depth: 767
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1047 states 28522 transitions, fanout: 27.242
pnml2lts-mc( 0/ 4): Total exploration time 0.160 sec (0.160 sec minimum, 0.160 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6544, Transitions per second: 178262
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.0MB, 38.6 B/state, compr.: 5.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 156 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TriangularGrid-PT-4022"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is TriangularGrid-PT-4022, 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 r540-smll-171690573900252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-4022.tgz
mv TriangularGrid-PT-4022 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;