About the Execution of LTSMin+red for TriangularGrid-PT-5046
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 491.563 | 2075424.00 | 2672655.00 | 6955.30 | FFFFFFFFFFFT?FFF | normal |
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-171690574000268.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-5046, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r540-smll-171690574000268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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 May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 06:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 13 06:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 06:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 06:06 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 185K 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-5046-LTLFireability-00
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-01
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-02
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-03
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-04
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-05
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-06
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-07
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-08
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-09
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-10
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-11
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-12
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-13
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-14
FORMULA_NAME TriangularGrid-PT-5046-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717270123007
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-5046
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:28:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 19:28:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:28:46] [INFO ] Load time of PNML (sax parser for PT used): 370 ms
[2024-06-01 19:28:46] [INFO ] Transformed 280 places.
[2024-06-01 19:28:46] [INFO ] Transformed 240 transitions.
[2024-06-01 19:28:46] [INFO ] Parsed PT model containing 280 places and 240 transitions and 960 arcs in 642 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA TriangularGrid-PT-5046-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 61 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
// Phase 1: matrix 240 rows 280 cols
[2024-06-01 19:28:46] [INFO ] Computed 116 invariants in 61 ms
[2024-06-01 19:28:47] [INFO ] Implicit Places using invariants in 985 ms returned []
[2024-06-01 19:28:47] [INFO ] Invariant cache hit.
[2024-06-01 19:28:48] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 19:28:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 14097 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22504 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 36823ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 36854ms
Finished structural reductions in LTL mode , in 1 iterations and 38871 ms. Remains : 280/280 places, 240/240 transitions.
Support contains 52 out of 280 places after structural reductions.
[2024-06-01 19:29:25] [INFO ] Flatten gal took : 68 ms
[2024-06-01 19:29:25] [INFO ] Flatten gal took : 42 ms
[2024-06-01 19:29:26] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 47 out of 280 places (down from 52) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 1521 steps (0 resets) in 448 ms. (3 steps per ms) remains 0/24 properties
FORMULA TriangularGrid-PT-5046-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(G(p0))&&F(p1))) U p0))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 50 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:29:26] [INFO ] Invariant cache hit.
[2024-06-01 19:29:27] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-06-01 19:29:27] [INFO ] Invariant cache hit.
[2024-06-01 19:29:27] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
[2024-06-01 19:29:27] [INFO ] Redundant transitions in 19 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:29:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13339 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20948 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 34385ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 34390ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35440 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 435 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-00
Stuttering criterion allowed to conclude after 5199 steps with 0 reset in 180 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-00 finished in 36187 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 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 45 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:30:02] [INFO ] Invariant cache hit.
[2024-06-01 19:30:03] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-06-01 19:30:03] [INFO ] Invariant cache hit.
[2024-06-01 19:30:04] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 1109 ms to find 0 implicit places.
[2024-06-01 19:30:04] [INFO ] Redundant transitions in 19 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:30:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13478 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 23178 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 36734ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 36738ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37921 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-01
Product exploration explored 100000 steps with 1048 reset in 1997 ms.
Product exploration explored 100000 steps with 1074 reset in 1930 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 196 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 570 steps (0 resets) in 22 ms. (24 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 264 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-06-01 19:30:45] [INFO ] Invariant cache hit.
[2024-06-01 19:30:46] [INFO ] [Real]Absence check using 115 positive place invariants in 75 ms returned sat
[2024-06-01 19:30:46] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 594 ms returned sat
[2024-06-01 19:30:47] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2024-06-01 19:30:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:30:47] [INFO ] [Nat]Absence check using 115 positive place invariants in 84 ms returned sat
[2024-06-01 19:30:47] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 61 ms returned sat
[2024-06-01 19:30:48] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2024-06-01 19:30:48] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 19:30:48] [INFO ] Added : 87 causal constraints over 18 iterations in 709 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 20 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:30:48] [INFO ] Invariant cache hit.
[2024-06-01 19:30:49] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-06-01 19:30:49] [INFO ] Invariant cache hit.
[2024-06-01 19:30:50] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
[2024-06-01 19:30:50] [INFO ] Redundant transitions in 7 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:30:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12678 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22906 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35684ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35689ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36963 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 232 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 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 131 steps (0 resets) in 10 ms. (11 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 250 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 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
[2024-06-01 19:31:26] [INFO ] Invariant cache hit.
[2024-06-01 19:31:27] [INFO ] [Real]Absence check using 115 positive place invariants in 81 ms returned sat
[2024-06-01 19:31:27] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 543 ms returned sat
[2024-06-01 19:31:27] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2024-06-01 19:31:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:31:28] [INFO ] [Nat]Absence check using 115 positive place invariants in 54 ms returned sat
[2024-06-01 19:31:28] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 62 ms returned sat
[2024-06-01 19:31:28] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2024-06-01 19:31:28] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 27 ms.
[2024-06-01 19:31:29] [INFO ] Added : 87 causal constraints over 18 iterations in 691 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1025 reset in 2257 ms.
Product exploration explored 100000 steps with 1033 reset in 2194 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 14 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:31:33] [INFO ] Invariant cache hit.
[2024-06-01 19:31:34] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-06-01 19:31:34] [INFO ] Invariant cache hit.
[2024-06-01 19:31:34] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
[2024-06-01 19:31:34] [INFO ] Redundant transitions in 5 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:31:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12693 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 23200 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35958ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35962ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36936 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-01 finished in 128012 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 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 18 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:32:10] [INFO ] Invariant cache hit.
[2024-06-01 19:32:11] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-06-01 19:32:11] [INFO ] Invariant cache hit.
[2024-06-01 19:32:11] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
[2024-06-01 19:32:11] [INFO ] Redundant transitions in 2 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:32:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12891 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22598 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35544ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35547ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36339 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-03
Product exploration explored 100000 steps with 340 reset in 2041 ms.
Product exploration explored 100000 steps with 359 reset in 1838 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 114 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)]
RANDOM walk for 267 steps (0 resets) in 11 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 128 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)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 11 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:32:51] [INFO ] Invariant cache hit.
[2024-06-01 19:32:52] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-06-01 19:32:52] [INFO ] Invariant cache hit.
[2024-06-01 19:32:52] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
[2024-06-01 19:32:52] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:32:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13242 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 23516 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 36796ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 36798ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37732 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1766 steps (0 resets) in 46 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 139 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 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 371 reset in 2236 ms.
Product exploration explored 100000 steps with 337 reset in 2048 ms.
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:33:34] [INFO ] Invariant cache hit.
[2024-06-01 19:33:34] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-06-01 19:33:34] [INFO ] Invariant cache hit.
[2024-06-01 19:33:35] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
[2024-06-01 19:33:35] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:33:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13551 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 21524 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35131ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35134ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36123 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-03 finished in 119664 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((p0||X((G(p2)&&p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:34:10] [INFO ] Invariant cache hit.
[2024-06-01 19:34:10] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-06-01 19:34:10] [INFO ] Invariant cache hit.
[2024-06-01 19:34:11] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 19:34:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13595 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22980 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 36634ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 36639ms
Finished structural reductions in LTL mode , in 1 iterations and 37670 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-04 finished in 37837 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&&F(p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:34:48] [INFO ] Invariant cache hit.
[2024-06-01 19:34:48] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-06-01 19:34:48] [INFO ] Invariant cache hit.
[2024-06-01 19:34:49] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 19:34:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13493 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 23604 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 37154ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 37157ms
Finished structural reductions in LTL mode , in 1 iterations and 38064 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-05
Product exploration explored 100000 steps with 598 reset in 2345 ms.
Product exploration explored 100000 steps with 578 reset in 1893 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 329 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 1346 steps (0 resets) in 56 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 601 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-01 19:35:32] [INFO ] Invariant cache hit.
[2024-06-01 19:35:33] [INFO ] [Real]Absence check using 115 positive place invariants in 80 ms returned sat
[2024-06-01 19:35:33] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 87 ms returned sat
[2024-06-01 19:35:33] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2024-06-01 19:35:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:35:34] [INFO ] [Nat]Absence check using 115 positive place invariants in 115 ms returned sat
[2024-06-01 19:35:34] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 38 ms returned sat
[2024-06-01 19:35:34] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2024-06-01 19:35:34] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-01 19:35:35] [INFO ] Added : 89 causal constraints over 18 iterations in 628 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 19:35:35] [INFO ] Invariant cache hit.
[2024-06-01 19:35:35] [INFO ] [Real]Absence check using 115 positive place invariants in 82 ms returned sat
[2024-06-01 19:35:35] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 68 ms returned sat
[2024-06-01 19:35:36] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2024-06-01 19:35:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:35:36] [INFO ] [Nat]Absence check using 115 positive place invariants in 106 ms returned sat
[2024-06-01 19:35:36] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 8 ms returned sat
[2024-06-01 19:35:37] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2024-06-01 19:35:37] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 27 ms.
[2024-06-01 19:35:37] [INFO ] Added : 88 causal constraints over 18 iterations in 650 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 14 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:35:37] [INFO ] Invariant cache hit.
[2024-06-01 19:35:38] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-06-01 19:35:38] [INFO ] Invariant cache hit.
[2024-06-01 19:35:39] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2024-06-01 19:35:39] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:35:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13658 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22151 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35862ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35865ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37012 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 373 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 640 steps (0 resets) in 27 ms. (22 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F p0), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 665 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-01 19:36:16] [INFO ] Invariant cache hit.
[2024-06-01 19:36:17] [INFO ] [Real]Absence check using 115 positive place invariants in 84 ms returned sat
[2024-06-01 19:36:17] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 86 ms returned sat
[2024-06-01 19:36:17] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2024-06-01 19:36:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:36:18] [INFO ] [Nat]Absence check using 115 positive place invariants in 72 ms returned sat
[2024-06-01 19:36:18] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 23 ms returned sat
[2024-06-01 19:36:18] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2024-06-01 19:36:18] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 18 ms.
[2024-06-01 19:36:19] [INFO ] Added : 89 causal constraints over 18 iterations in 475 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 19:36:19] [INFO ] Invariant cache hit.
[2024-06-01 19:36:19] [INFO ] [Real]Absence check using 115 positive place invariants in 82 ms returned sat
[2024-06-01 19:36:19] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 67 ms returned sat
[2024-06-01 19:36:19] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2024-06-01 19:36:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:36:20] [INFO ] [Nat]Absence check using 115 positive place invariants in 68 ms returned sat
[2024-06-01 19:36:20] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 5 ms returned sat
[2024-06-01 19:36:20] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2024-06-01 19:36:20] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 20 ms.
[2024-06-01 19:36:21] [INFO ] Added : 88 causal constraints over 18 iterations in 486 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 582 reset in 1920 ms.
Product exploration explored 100000 steps with 625 reset in 1810 ms.
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:36:25] [INFO ] Invariant cache hit.
[2024-06-01 19:36:25] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-06-01 19:36:25] [INFO ] Invariant cache hit.
[2024-06-01 19:36:25] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
[2024-06-01 19:36:25] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:36:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13237 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 23068 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 36357ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 36360ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37285 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-05 finished in 133903 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)))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:37:02] [INFO ] Invariant cache hit.
[2024-06-01 19:37:02] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-06-01 19:37:02] [INFO ] Invariant cache hit.
[2024-06-01 19:37:03] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 19:37:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13317 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 21407 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 34782ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 34785ms
Finished structural reductions in LTL mode , in 1 iterations and 35991 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-07
Product exploration explored 100000 steps with 1100 reset in 1658 ms.
Product exploration explored 100000 steps with 1073 reset in 1792 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 410 steps (0 resets) in 12 ms. (31 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 170 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2024-06-01 19:37:42] [INFO ] Invariant cache hit.
[2024-06-01 19:37:42] [INFO ] [Real]Absence check using 115 positive place invariants in 83 ms returned sat
[2024-06-01 19:37:43] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 181 ms returned sat
[2024-06-01 19:37:43] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2024-06-01 19:37:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:37:43] [INFO ] [Nat]Absence check using 115 positive place invariants in 53 ms returned sat
[2024-06-01 19:37:43] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 25 ms returned sat
[2024-06-01 19:37:44] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2024-06-01 19:37:44] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-01 19:37:44] [INFO ] Added : 89 causal constraints over 18 iterations in 669 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 12 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:37:45] [INFO ] Invariant cache hit.
[2024-06-01 19:37:45] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-06-01 19:37:45] [INFO ] Invariant cache hit.
[2024-06-01 19:37:46] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
[2024-06-01 19:37:46] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:37:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13529 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22092 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35685ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35688ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36920 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 150 steps (0 resets) in 8 ms. (16 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 188 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 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
[2024-06-01 19:38:22] [INFO ] Invariant cache hit.
[2024-06-01 19:38:22] [INFO ] [Real]Absence check using 115 positive place invariants in 83 ms returned sat
[2024-06-01 19:38:23] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 179 ms returned sat
[2024-06-01 19:38:23] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2024-06-01 19:38:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:38:24] [INFO ] [Nat]Absence check using 115 positive place invariants in 74 ms returned sat
[2024-06-01 19:38:24] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 36 ms returned sat
[2024-06-01 19:38:24] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2024-06-01 19:38:24] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-01 19:38:24] [INFO ] Added : 89 causal constraints over 18 iterations in 448 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1046 reset in 2237 ms.
Product exploration explored 100000 steps with 1086 reset in 2019 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 18 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:38:29] [INFO ] Invariant cache hit.
[2024-06-01 19:38:29] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-06-01 19:38:29] [INFO ] Invariant cache hit.
[2024-06-01 19:38:30] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
[2024-06-01 19:38:30] [INFO ] Redundant transitions in 0 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:38:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13351 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22552 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35940ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35942ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36916 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-07 finished in 123914 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(p0)||F(p1)))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 11 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:39:06] [INFO ] Invariant cache hit.
[2024-06-01 19:39:06] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-06-01 19:39:06] [INFO ] Invariant cache hit.
[2024-06-01 19:39:07] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
[2024-06-01 19:39:07] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:39:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13399 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22987 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 36436ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 36444ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37428 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-08
Product exploration explored 100000 steps with 1058 reset in 1891 ms.
Product exploration explored 100000 steps with 1032 reset in 1789 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 449 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 1244 steps (0 resets) in 62 ms. (19 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 738 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 11 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:39:49] [INFO ] Invariant cache hit.
[2024-06-01 19:39:49] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-06-01 19:39:49] [INFO ] Invariant cache hit.
[2024-06-01 19:39:50] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
[2024-06-01 19:39:50] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:39:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 9892 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22018 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 31968ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 31974ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33173 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 439 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 925 steps (0 resets) in 38 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 623 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1059 reset in 1947 ms.
Product exploration explored 100000 steps with 1080 reset in 2025 ms.
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:40:27] [INFO ] Invariant cache hit.
[2024-06-01 19:40:27] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-06-01 19:40:27] [INFO ] Invariant cache hit.
[2024-06-01 19:40:28] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2024-06-01 19:40:28] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:40:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13741 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 21738 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35514ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35516ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36189 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-08 finished in 117584 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&&(!p1 U p2)&&X(G(p1))))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:41:03] [INFO ] Invariant cache hit.
[2024-06-01 19:41:04] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-06-01 19:41:04] [INFO ] Invariant cache hit.
[2024-06-01 19:41:04] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 19:41:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12450 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 21062 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 33551ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 33555ms
Finished structural reductions in LTL mode , in 1 iterations and 34352 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-09
Product exploration explored 100000 steps with 108 reset in 2171 ms.
Product exploration explored 100000 steps with 110 reset in 1927 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 p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND p0 p2) (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (OR (NOT p0) (AND (NOT p2) p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (NOT 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 p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 1206 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 1795 steps (0 resets) in 83 ms. (21 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND p0 p2) (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (OR (NOT p0) (AND (NOT p2) p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (NOT 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 p1)), (X (X (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p0) (NOT p2))))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p1))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 1607 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
[2024-06-01 19:41:46] [INFO ] Invariant cache hit.
[2024-06-01 19:41:47] [INFO ] [Real]Absence check using 115 positive place invariants in 145 ms returned sat
[2024-06-01 19:41:47] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 19:41:47] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-06-01 19:41:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:41:47] [INFO ] [Nat]Absence check using 115 positive place invariants in 97 ms returned sat
[2024-06-01 19:41:47] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 19:41:48] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2024-06-01 19:41:48] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-01 19:41:49] [INFO ] Added : 88 causal constraints over 18 iterations in 647 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 11 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:41:49] [INFO ] Invariant cache hit.
[2024-06-01 19:41:49] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-06-01 19:41:49] [INFO ] Invariant cache hit.
[2024-06-01 19:41:50] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
[2024-06-01 19:41:50] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:41:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13345 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20884 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 34290ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 34293ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35491 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (NOT p0) (AND p1 (NOT p2)))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p0) (AND p1 (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND p1 (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 (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 1637 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 402 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 2003 steps (0 resets) in 119 ms. (16 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (NOT p0) (AND p1 (NOT p2)))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p0) (AND p1 (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND p1 (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 (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p0) (NOT p2))))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p1))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 2310 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
[2024-06-01 19:42:29] [INFO ] Invariant cache hit.
[2024-06-01 19:42:30] [INFO ] [Real]Absence check using 115 positive place invariants in 147 ms returned sat
[2024-06-01 19:42:30] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 19:42:30] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2024-06-01 19:42:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:42:31] [INFO ] [Nat]Absence check using 115 positive place invariants in 96 ms returned sat
[2024-06-01 19:42:31] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 19:42:31] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2024-06-01 19:42:31] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 19:42:32] [INFO ] Added : 88 causal constraints over 18 iterations in 456 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
Product exploration explored 100000 steps with 105 reset in 2606 ms.
Product exploration explored 100000 steps with 103 reset in 1943 ms.
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:42:36] [INFO ] Invariant cache hit.
[2024-06-01 19:42:37] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-06-01 19:42:37] [INFO ] Invariant cache hit.
[2024-06-01 19:42:37] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
[2024-06-01 19:42:37] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:42:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13383 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22162 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35600ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35603ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36575 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-09 finished in 129689 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(X(G(p0)))))'
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:43:13] [INFO ] Invariant cache hit.
[2024-06-01 19:43:13] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-06-01 19:43:13] [INFO ] Invariant cache hit.
[2024-06-01 19:43:14] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 19:43:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12700 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 23462 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 36219ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 36221ms
Finished structural reductions in LTL mode , in 1 iterations and 37025 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-10
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 2 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-10 finished in 37189 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)||(F(p1) U p2))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:43:50] [INFO ] Invariant cache hit.
[2024-06-01 19:43:51] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-06-01 19:43:51] [INFO ] Invariant cache hit.
[2024-06-01 19:43:51] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 19:43:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13709 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 23330 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 37098ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 37102ms
Finished structural reductions in LTL mode , in 1 iterations and 38295 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 1102 ms.
Product exploration explored 100000 steps with 50000 reset in 1007 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)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TriangularGrid-PT-5046-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TriangularGrid-PT-5046-LTLFireability-11 finished in 40582 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(F(p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:44:31] [INFO ] Invariant cache hit.
[2024-06-01 19:44:31] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-06-01 19:44:31] [INFO ] Invariant cache hit.
[2024-06-01 19:44:32] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
[2024-06-01 19:44:32] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:44:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13160 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 21735 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 34951ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 34954ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35900 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-12
Product exploration explored 100000 steps with 376 reset in 1957 ms.
Product exploration explored 100000 steps with 387 reset in 1921 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) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 675 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 658 steps (0 resets) in 32 ms. (19 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 664 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 11 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:45:12] [INFO ] Invariant cache hit.
[2024-06-01 19:45:13] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-06-01 19:45:13] [INFO ] Invariant cache hit.
[2024-06-01 19:45:14] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2024-06-01 19:45:14] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:45:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13456 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 23200 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 36709ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 36712ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37916 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 513 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 453 steps (0 resets) in 19 ms. (22 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 663 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 366 reset in 2098 ms.
Product exploration explored 100000 steps with 399 reset in 1882 ms.
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:45:56] [INFO ] Invariant cache hit.
[2024-06-01 19:45:56] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-06-01 19:45:56] [INFO ] Invariant cache hit.
[2024-06-01 19:45:57] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2024-06-01 19:45:57] [INFO ] Redundant transitions in 0 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:45:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13816 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 23330 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 37198ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 37202ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38081 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-12 finished in 123284 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 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:46:34] [INFO ] Invariant cache hit.
[2024-06-01 19:46:34] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-06-01 19:46:34] [INFO ] Invariant cache hit.
[2024-06-01 19:46:35] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2024-06-01 19:46:35] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:46:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13314 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22576 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35948ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35952ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36762 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-13
Stuttering criterion allowed to conclude after 9766 steps with 0 reset in 127 ms.
FORMULA TriangularGrid-PT-5046-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5046-LTLFireability-13 finished in 36939 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(p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:47:11] [INFO ] Invariant cache hit.
[2024-06-01 19:47:11] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-06-01 19:47:11] [INFO ] Invariant cache hit.
[2024-06-01 19:47:12] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 19:47:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13498 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22643 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 36199ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 36207ms
Finished structural reductions in LTL mode , in 1 iterations and 37222 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-14
Product exploration explored 100000 steps with 38352 reset in 1330 ms.
Product exploration explored 100000 steps with 39098 reset in 1189 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 364 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 919 steps (0 resets) in 32 ms. (27 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 655 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:47:52] [INFO ] Invariant cache hit.
[2024-06-01 19:47:53] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-06-01 19:47:53] [INFO ] Invariant cache hit.
[2024-06-01 19:47:53] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 19:47:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12349 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22058 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 34460ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 34463ms
Finished structural reductions in LTL mode , in 1 iterations and 35666 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 536 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 766 steps (0 resets) in 36 ms. (20 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 645 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 39446 reset in 1565 ms.
Product exploration explored 100000 steps with 37599 reset in 1205 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 27 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:48:33] [INFO ] Redundant transitions in 0 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:48:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12945 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 23809 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 36794ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 36796ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36832 ms. Remains : 280/280 places, 240/240 transitions.
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:49:09] [INFO ] Invariant cache hit.
[2024-06-01 19:49:10] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-06-01 19:49:10] [INFO ] Invariant cache hit.
[2024-06-01 19:49:10] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 19:49:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13298 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 23281 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 36626ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 36628ms
Finished structural reductions in LTL mode , in 1 iterations and 37517 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-14 finished in 155993 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((G(p0)||((p2 U p3)&&p1)))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:49:47] [INFO ] Invariant cache hit.
[2024-06-01 19:49:47] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-06-01 19:49:47] [INFO ] Invariant cache hit.
[2024-06-01 19:49:48] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2024-06-01 19:49:48] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:49:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13212 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22481 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35730ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35732ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36586 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-15
Product exploration explored 100000 steps with 242 reset in 1978 ms.
Product exploration explored 100000 steps with 232 reset in 1892 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND p0 (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2))))]
Knowledge based reduction with 10 factoid took 1282 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter insensitive) to 3 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 1629 ms. (24 steps per ms) remains 3/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 573 ms. (69 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 461 ms. (86 steps per ms) remains 3/3 properties
[2024-06-01 19:50:30] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 6/520 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 0/115 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/280 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 35ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (G (OR p0 p2 p3)), (G (OR p0 (NOT p2) p3 (NOT p1))), (G (OR p0 (NOT p2) p3))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND p0 (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (F (NOT (AND (OR (NOT p0) p2 p3) (OR (NOT p0) p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) p3 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (AND (OR p0 p2 p3) (OR p0 p1)))), (F (NOT p3)), (F p2), (F (NOT p1)), (F (NOT (OR (NOT p0) p2 p3)))]
Knowledge based reduction with 13 factoid took 1887 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 9 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:50:32] [INFO ] Invariant cache hit.
[2024-06-01 19:50:33] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-06-01 19:50:33] [INFO ] Invariant cache hit.
[2024-06-01 19:50:34] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
[2024-06-01 19:50:34] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:50:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12216 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 23470 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35763ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35766ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37039 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND p2 (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1))), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3) p1))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 971 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 1245 ms. (32 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 1/1 properties
[2024-06-01 19:51:11] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
After SMT solving in domain Real declared 6/520 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/115 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/280 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 20ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND p2 (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (G (OR p1 p2 p3 p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1))), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3) p1))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p3) p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p1)))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR (NOT p1) p2 p3) (OR p2 p3 (NOT p0))))), (F (NOT p0)), (F (NOT (AND (OR p1 (NOT p0)) (OR (NOT p1) p2 p3)))), (F p2), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT p3)), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p2) p3))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 1307 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 269 reset in 2295 ms.
Product exploration explored 100000 steps with 250 reset in 1864 ms.
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:51:17] [INFO ] Invariant cache hit.
[2024-06-01 19:51:18] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-01 19:51:18] [INFO ] Invariant cache hit.
[2024-06-01 19:51:18] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
[2024-06-01 19:51:18] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:51:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12948 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22956 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35959ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35963ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37048 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-15 finished in 127217 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)))'
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)))'
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&&F(p1)))))'
Found a Shortening insensitive property : TriangularGrid-PT-5046-LTLFireability-05
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:51:55] [INFO ] Invariant cache hit.
[2024-06-01 19:51:55] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-06-01 19:51:55] [INFO ] Invariant cache hit.
[2024-06-01 19:51:56] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 19:51:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13234 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22218 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35501ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35504ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 36464 ms. Remains : 280/280 places, 240/240 transitions.
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-05
Product exploration explored 100000 steps with 616 reset in 2105 ms.
Product exploration explored 100000 steps with 585 reset in 2059 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 396 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 998 steps (0 resets) in 53 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 586 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-01 19:52:37] [INFO ] Invariant cache hit.
[2024-06-01 19:52:38] [INFO ] [Real]Absence check using 115 positive place invariants in 72 ms returned sat
[2024-06-01 19:52:38] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 75 ms returned sat
[2024-06-01 19:52:38] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2024-06-01 19:52:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:52:38] [INFO ] [Nat]Absence check using 115 positive place invariants in 75 ms returned sat
[2024-06-01 19:52:38] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 23 ms returned sat
[2024-06-01 19:52:39] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2024-06-01 19:52:39] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-01 19:52:39] [INFO ] Added : 89 causal constraints over 18 iterations in 586 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 19:52:39] [INFO ] Invariant cache hit.
[2024-06-01 19:52:40] [INFO ] [Real]Absence check using 115 positive place invariants in 89 ms returned sat
[2024-06-01 19:52:40] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 68 ms returned sat
[2024-06-01 19:52:40] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2024-06-01 19:52:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:52:41] [INFO ] [Nat]Absence check using 115 positive place invariants in 98 ms returned sat
[2024-06-01 19:52:41] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 7 ms returned sat
[2024-06-01 19:52:41] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2024-06-01 19:52:41] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 27 ms.
[2024-06-01 19:52:42] [INFO ] Added : 88 causal constraints over 18 iterations in 628 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:52:42] [INFO ] Invariant cache hit.
[2024-06-01 19:52:42] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-06-01 19:52:42] [INFO ] Invariant cache hit.
[2024-06-01 19:52:43] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
[2024-06-01 19:52:43] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:52:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13644 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22602 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 36302ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 36305ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37476 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 472 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 757 steps (0 resets) in 33 ms. (22 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F p0), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 661 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2024-06-01 19:53:21] [INFO ] Invariant cache hit.
[2024-06-01 19:53:22] [INFO ] [Real]Absence check using 115 positive place invariants in 84 ms returned sat
[2024-06-01 19:53:22] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 87 ms returned sat
[2024-06-01 19:53:22] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2024-06-01 19:53:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:53:23] [INFO ] [Nat]Absence check using 115 positive place invariants in 113 ms returned sat
[2024-06-01 19:53:23] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 39 ms returned sat
[2024-06-01 19:53:23] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2024-06-01 19:53:23] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-01 19:53:24] [INFO ] Added : 89 causal constraints over 18 iterations in 605 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 19:53:24] [INFO ] Invariant cache hit.
[2024-06-01 19:53:24] [INFO ] [Real]Absence check using 115 positive place invariants in 82 ms returned sat
[2024-06-01 19:53:25] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 68 ms returned sat
[2024-06-01 19:53:25] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2024-06-01 19:53:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:53:25] [INFO ] [Nat]Absence check using 115 positive place invariants in 99 ms returned sat
[2024-06-01 19:53:25] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 8 ms returned sat
[2024-06-01 19:53:26] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2024-06-01 19:53:26] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 27 ms.
[2024-06-01 19:53:27] [INFO ] Added : 88 causal constraints over 18 iterations in 630 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 588 reset in 1926 ms.
Product exploration explored 100000 steps with 607 reset in 1898 ms.
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:53:31] [INFO ] Invariant cache hit.
[2024-06-01 19:53:31] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-06-01 19:53:31] [INFO ] Invariant cache hit.
[2024-06-01 19:53:32] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
[2024-06-01 19:53:32] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:53:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12960 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22366 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35358ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35359ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36376 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-05 finished in 132546 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)))'
Found a Shortening insensitive property : TriangularGrid-PT-5046-LTLFireability-07
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:54:07] [INFO ] Invariant cache hit.
[2024-06-01 19:54:08] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-06-01 19:54:08] [INFO ] Invariant cache hit.
[2024-06-01 19:54:08] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 19:54:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13558 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 21734 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35351ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35354ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 36498 ms. Remains : 280/280 places, 240/240 transitions.
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-07
Product exploration explored 100000 steps with 1113 reset in 1640 ms.
Product exploration explored 100000 steps with 1095 reset in 1805 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 441 steps (0 resets) in 14 ms. (29 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 182 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-06-01 19:54:48] [INFO ] Invariant cache hit.
[2024-06-01 19:54:48] [INFO ] [Real]Absence check using 115 positive place invariants in 81 ms returned sat
[2024-06-01 19:54:48] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 170 ms returned sat
[2024-06-01 19:54:49] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2024-06-01 19:54:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:54:49] [INFO ] [Nat]Absence check using 115 positive place invariants in 66 ms returned sat
[2024-06-01 19:54:49] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 32 ms returned sat
[2024-06-01 19:54:49] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2024-06-01 19:54:49] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 20 ms.
[2024-06-01 19:54:50] [INFO ] Added : 89 causal constraints over 18 iterations in 509 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:54:50] [INFO ] Invariant cache hit.
[2024-06-01 19:54:50] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-06-01 19:54:50] [INFO ] Invariant cache hit.
[2024-06-01 19:54:51] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2024-06-01 19:54:51] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:54:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12077 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 21964 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 34102ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 34105ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35048 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 223 steps (0 resets) in 7 ms. (27 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 206 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 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
[2024-06-01 19:55:26] [INFO ] Invariant cache hit.
[2024-06-01 19:55:26] [INFO ] [Real]Absence check using 115 positive place invariants in 78 ms returned sat
[2024-06-01 19:55:26] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 179 ms returned sat
[2024-06-01 19:55:27] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2024-06-01 19:55:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:55:27] [INFO ] [Nat]Absence check using 115 positive place invariants in 44 ms returned sat
[2024-06-01 19:55:27] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 31 ms returned sat
[2024-06-01 19:55:27] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2024-06-01 19:55:27] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-01 19:55:28] [INFO ] Added : 89 causal constraints over 18 iterations in 627 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1121 reset in 2125 ms.
Product exploration explored 100000 steps with 1139 reset in 1814 ms.
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:55:32] [INFO ] Invariant cache hit.
[2024-06-01 19:55:32] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-06-01 19:55:32] [INFO ] Invariant cache hit.
[2024-06-01 19:55:33] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2024-06-01 19:55:33] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:55:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12416 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 21385 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 33852ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 33855ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34670 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-07 finished in 119693 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(p0)||F(p1)))'
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&&(!p1 U p2)&&X(G(p1))))))'
Found a Shortening insensitive property : TriangularGrid-PT-5046-LTLFireability-09
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:56:07] [INFO ] Invariant cache hit.
[2024-06-01 19:56:08] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-06-01 19:56:08] [INFO ] Invariant cache hit.
[2024-06-01 19:56:09] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 19:56:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12106 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22960 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35122ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35124ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 36206 ms. Remains : 280/280 places, 240/240 transitions.
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-09
Product exploration explored 100000 steps with 99 reset in 1822 ms.
Product exploration explored 100000 steps with 111 reset in 1947 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 p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND p0 p2) (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (OR (NOT p0) (AND (NOT p2) p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (NOT 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 p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 1035 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 494 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 1724 steps (0 resets) in 65 ms. (26 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND p0 p2) (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (OR (NOT p0) (AND (NOT p2) p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p0 p2) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (NOT 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 p1)), (X (X (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p0) (NOT p2))))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p1))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 1604 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 391 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
[2024-06-01 19:56:51] [INFO ] Invariant cache hit.
[2024-06-01 19:56:52] [INFO ] [Real]Absence check using 115 positive place invariants in 150 ms returned sat
[2024-06-01 19:56:52] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 19:56:52] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2024-06-01 19:56:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:56:53] [INFO ] [Nat]Absence check using 115 positive place invariants in 91 ms returned sat
[2024-06-01 19:56:53] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 5 ms returned sat
[2024-06-01 19:56:53] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2024-06-01 19:56:53] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 19:56:54] [INFO ] Added : 88 causal constraints over 18 iterations in 585 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:56:54] [INFO ] Invariant cache hit.
[2024-06-01 19:56:54] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-06-01 19:56:54] [INFO ] Invariant cache hit.
[2024-06-01 19:56:55] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
[2024-06-01 19:56:55] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:56:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13037 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22765 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35855ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35858ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36984 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (NOT p0) (AND p1 (NOT p2)))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p0) (AND p1 (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND p1 (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 (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 1537 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 2213 steps (0 resets) in 81 ms. (26 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (NOT p0) (AND p1 (NOT p2)))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (NOT p0) (AND p1 (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND p1 (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 (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p0) (NOT p2))))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p1))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 2345 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
[2024-06-01 19:57:36] [INFO ] Invariant cache hit.
[2024-06-01 19:57:36] [INFO ] [Real]Absence check using 115 positive place invariants in 144 ms returned sat
[2024-06-01 19:57:37] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 4 ms returned sat
[2024-06-01 19:57:37] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2024-06-01 19:57:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 19:57:37] [INFO ] [Nat]Absence check using 115 positive place invariants in 70 ms returned sat
[2024-06-01 19:57:37] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 19:57:38] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2024-06-01 19:57:38] [INFO ] Computed and/alt/rep : 165/165/165 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-01 19:57:38] [INFO ] Added : 88 causal constraints over 18 iterations in 659 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) p2), false]
Product exploration explored 100000 steps with 111 reset in 2163 ms.
Product exploration explored 100000 steps with 110 reset in 2003 ms.
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:57:43] [INFO ] Invariant cache hit.
[2024-06-01 19:57:43] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-06-01 19:57:43] [INFO ] Invariant cache hit.
[2024-06-01 19:57:44] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
[2024-06-01 19:57:44] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:57:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 12849 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 22160 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35045ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35046ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36137 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-09 finished in 132081 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(F(p1)))))'
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(p1)))))'
Found a Shortening insensitive property : TriangularGrid-PT-5046-LTLFireability-14
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:58:19] [INFO ] Invariant cache hit.
[2024-06-01 19:58:20] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-06-01 19:58:20] [INFO ] Invariant cache hit.
[2024-06-01 19:58:21] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 19:58:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13485 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 21234 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 34774ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 34777ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 36054 ms. Remains : 280/280 places, 240/240 transitions.
Running random walk in product with property : TriangularGrid-PT-5046-LTLFireability-14
Product exploration explored 100000 steps with 39313 reset in 1062 ms.
Product exploration explored 100000 steps with 38184 reset in 1209 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 373 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1611 steps (0 resets) in 37 ms. (42 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 633 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:58:59] [INFO ] Invariant cache hit.
[2024-06-01 19:59:00] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-06-01 19:59:00] [INFO ] Invariant cache hit.
[2024-06-01 19:59:00] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 19:59:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13357 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 21983 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 35390ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 35397ms
Finished structural reductions in LTL mode , in 1 iterations and 36592 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 488 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1244 steps (0 resets) in 43 ms. (28 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 648 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 39159 reset in 1463 ms.
Product exploration explored 100000 steps with 39124 reset in 1177 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 19:59:40] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2024-06-01 19:59:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13096 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 24154 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 37285ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 37287ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37297 ms. Remains : 280/280 places, 240/240 transitions.
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-06-01 20:00:17] [INFO ] Invariant cache hit.
[2024-06-01 20:00:18] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-06-01 20:00:18] [INFO ] Invariant cache hit.
[2024-06-01 20:00:19] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-06-01 20:00:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 13117 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 23266 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 36448ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 36451ms
Finished structural reductions in LTL mode , in 1 iterations and 37546 ms. Remains : 280/280 places, 240/240 transitions.
Treatment of property TriangularGrid-PT-5046-LTLFireability-14 finished in 155766 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((G(p0)||((p2 U p3)&&p1)))))'
[2024-06-01 20:00:55] [INFO ] Flatten gal took : 23 ms
[2024-06-01 20:00:55] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 20:00:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 280 places, 240 transitions and 960 arcs took 8 ms.
Total runtime 1930098 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA TriangularGrid-PT-5046-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : TriangularGrid-PT-5046-LTLFireability-12
FORMULA TriangularGrid-PT-5046-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717272198431
--------------------
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-5046-LTLFireability-01
ltl formula formula --ltl=/tmp/5165/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 280 places, 240 transitions and 960 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5165/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5165/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5165/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5165/ltl_0_
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 282 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 281, there are 243 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 ~712!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 630
pnml2lts-mc( 0/ 4): unique states count: 3403
pnml2lts-mc( 0/ 4): unique transitions count: 150200
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: 3406
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2776
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3406 states 150654 transitions, fanout: 44.232
pnml2lts-mc( 0/ 4): Total exploration time 0.750 sec (0.750 sec minimum, 0.750 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4541, Transitions per second: 200872
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 5.6MB, 39.0 B/state, compr.: 3.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 242 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 5.6MB (~256.0MB paged-in)
ltl formula name TriangularGrid-PT-5046-LTLFireability-03
ltl formula formula --ltl=/tmp/5165/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 280 places, 240 transitions and 960 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.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5165/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5165/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5165/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5165/ltl_1_
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 282 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 281, there are 245 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): ~2376 levels ~10000 states ~231052 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~1837!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1804
pnml2lts-mc( 0/ 4): unique states count: 14311
pnml2lts-mc( 0/ 4): unique transitions count: 267208
pnml2lts-mc( 0/ 4): - self-loop count: 92
pnml2lts-mc( 0/ 4): - claim dead count: 4930
pnml2lts-mc( 0/ 4): - claim found count: 3696
pnml2lts-mc( 0/ 4): - claim success count: 14314
pnml2lts-mc( 0/ 4): - cum. max stack depth: 9256
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14314 states 267437 transitions, fanout: 18.684
pnml2lts-mc( 0/ 4): Total exploration time 0.870 sec (0.870 sec minimum, 0.870 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16453, Transitions per second: 307399
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 9.0MB, 36.4 B/state, compr.: 3.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/10.0%
pnml2lts-mc( 0/ 4): Stored 242 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 9.0MB (~256.0MB paged-in)
ltl formula name TriangularGrid-PT-5046-LTLFireability-05
ltl formula formula --ltl=/tmp/5165/ltl_2_
Warning: program compiled against libxml 210 using older 209
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 280 places, 240 transitions and 960 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( 1/ 4): LTL layer: formula: /tmp/5165/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5165/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5165/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5165/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 282 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 281, there are 248 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 ~222!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 15
pnml2lts-mc( 0/ 4): unique states count: 990
pnml2lts-mc( 0/ 4): unique transitions count: 70161
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: 993
pnml2lts-mc( 0/ 4): - cum. max stack depth: 978
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 993 states 70390 transitions, fanout: 70.886
pnml2lts-mc( 0/ 4): Total exploration time 0.360 sec (0.360 sec minimum, 0.360 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2758, Transitions per second: 195528
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.8MB, 41.9 B/state, compr.: 3.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 242 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.8MB (~256.0MB paged-in)
ltl formula name TriangularGrid-PT-5046-LTLFireability-07
ltl formula formula --ltl=/tmp/5165/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
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 280 places, 240 transitions and 960 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.050 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5165/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5165/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5165/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5165/ltl_3_
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 282 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 281, there are 242 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 ~521!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1277
pnml2lts-mc( 0/ 4): unique states count: 3401
pnml2lts-mc( 0/ 4): unique transitions count: 123012
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: 3404
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2127
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3404 states 123241 transitions, fanout: 36.205
pnml2lts-mc( 0/ 4): Total exploration time 0.550 sec (0.550 sec minimum, 0.550 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6189, Transitions per second: 224075
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 4.7MB, 40.5 B/state, compr.: 3.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 242 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 4.7MB (~256.0MB paged-in)
ltl formula name TriangularGrid-PT-5046-LTLFireability-08
ltl formula formula --ltl=/tmp/5165/ltl_4_
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 280 places, 240 transitions and 960 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/5165/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5165/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5165/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5165/ltl_4_
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 282 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 281, there are 252 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 ~982!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 983
pnml2lts-mc( 0/ 4): unique states count: 5082
pnml2lts-mc( 0/ 4): unique transitions count: 247811
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 293
pnml2lts-mc( 0/ 4): - claim found count: 245
pnml2lts-mc( 0/ 4): - claim success count: 5085
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4102
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5085 states 248040 transitions, fanout: 48.779
pnml2lts-mc( 0/ 4): Total exploration time 0.710 sec (0.710 sec minimum, 0.710 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7162, Transitions per second: 349352
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 6.4MB, 37.6 B/state, compr.: 3.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/7.0%
pnml2lts-mc( 0/ 4): Stored 242 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 6.4MB (~256.0MB paged-in)
ltl formula name TriangularGrid-PT-5046-LTLFireability-09
ltl formula formula --ltl=/tmp/5165/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 280 places, 240 transitions and 960 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.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5165/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5165/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5165/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5165/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 281 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 281, there are 282 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 ~391!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1529
pnml2lts-mc( 0/ 4): unique transitions count: 102526
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: 1533
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1533
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1533 states 102831 transitions, fanout: 67.078
pnml2lts-mc( 0/ 4): Total exploration time 0.420 sec (0.420 sec minimum, 0.420 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3650, Transitions per second: 244836
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.9MB, 40.7 B/state, compr.: 3.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 242 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.9MB (~256.0MB paged-in)
ltl formula name TriangularGrid-PT-5046-LTLFireability-12
ltl formula formula --ltl=/tmp/5165/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 280 places, 240 transitions and 960 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.050 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5165/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5165/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5165/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5165/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 281 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 281, there are 249 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): ~1852 levels ~10000 states ~218876 transitions
pnml2lts-mc( 2/ 4): ~2985 levels ~20000 states ~256536 transitions
pnml2lts-mc( 2/ 4): ~4267 levels ~40000 states ~342884 transitions
pnml2lts-mc( 2/ 4): ~11115 levels ~80000 states ~545276 transitions
pnml2lts-mc( 3/ 4): ~7832 levels ~160000 states ~784560 transitions
pnml2lts-mc( 3/ 4): ~8175 levels ~320000 states ~1421212 transitions
pnml2lts-mc( 3/ 4): ~8175 levels ~640000 states ~2973884 transitions
pnml2lts-mc( 3/ 4): ~48831 levels ~1280000 states ~6028868 transitions
pnml2lts-mc( 3/ 4): ~48831 levels ~2560000 states ~12295028 transitions
pnml2lts-mc( 3/ 4): ~49189 levels ~5120000 states ~26856764 transitions
pnml2lts-mc( 0/ 4): ~295209 levels ~10240000 states ~55982096 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 22628
pnml2lts-mc( 0/ 4): unique states count: 14713881
pnml2lts-mc( 0/ 4): unique transitions count: 89526211
pnml2lts-mc( 0/ 4): - self-loop count: 760
pnml2lts-mc( 0/ 4): - claim dead count: 19377227
pnml2lts-mc( 0/ 4): - claim found count: 53453578
pnml2lts-mc( 0/ 4): - claim success count: 14713884
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1750464
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14713884 states 89526437 transitions, fanout: 6.084
pnml2lts-mc( 0/ 4): Total exploration time 134.750 sec (134.720 sec minimum, 134.732 sec on average)
pnml2lts-mc( 0/ 4): States per second: 109194, Transitions per second: 664389
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 182.8MB, 12.3 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 46.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 242 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 182.8MB (~256.0MB paged-in)
ltl formula name TriangularGrid-PT-5046-LTLFireability-14
ltl formula formula --ltl=/tmp/5165/ltl_7_
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 280 places, 240 transitions and 960 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.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5165/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5165/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5165/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5165/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 281 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 281, there are 253 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 ~594!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 785
pnml2lts-mc( 0/ 4): unique states count: 3010
pnml2lts-mc( 0/ 4): unique transitions count: 132505
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 50
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 3023
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2231
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3023 states 132962 transitions, fanout: 43.983
pnml2lts-mc( 0/ 4): Total exploration time 0.610 sec (0.610 sec minimum, 0.610 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4956, Transitions per second: 217970
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 5.0MB, 39.4 B/state, compr.: 3.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 242 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 5.0MB (~256.0MB paged-in)
ltl formula name TriangularGrid-PT-5046-LTLFireability-15
ltl formula formula --ltl=/tmp/5165/ltl_8_
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 280 places, 240 transitions and 960 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( 1/ 4): LTL layer: formula: /tmp/5165/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5165/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5165/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5165/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 281 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 281, there are 389 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( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~800!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 16
pnml2lts-mc( 0/ 4): unique states count: 2904
pnml2lts-mc( 0/ 4): unique transitions count: 156478
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 141
pnml2lts-mc( 0/ 4): - claim success count: 2908
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2892
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2908 states 156784 transitions, fanout: 53.915
pnml2lts-mc( 0/ 4): Total exploration time 0.560 sec (0.560 sec minimum, 0.560 sec on average)
pnml2lts-mc( 0/ 4): States per second: 5193, Transitions per second: 279971
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 5.6MB, 37.7 B/state, compr.: 3.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 242 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 5.6MB (~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-5046"
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-5046, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r540-smll-171690574000268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-5046.tgz
mv TriangularGrid-PT-5046 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.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 '
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 ;