fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r487-tall-167912703500740
Last Updated
May 14, 2023

About the Execution of LoLa+red for TriangularGrid-PT-3026

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
433.976 50991.00 68035.00 628.80 FFFFFFFFFTFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r487-tall-167912703500740.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is TriangularGrid-PT-3026, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912703500740
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.7K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 01:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 17:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 26 01:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 70K Mar 5 18:23 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-3026-LTLFireability-00
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-01
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-02
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-03
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-04
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-05
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-06
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-07
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-08
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-09
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-10
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-11
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-12
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-13
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-14
FORMULA_NAME TriangularGrid-PT-3026-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679222430091

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TriangularGrid-PT-3026
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 10:40:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 10:40:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 10:40:31] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-19 10:40:31] [INFO ] Transformed 108 places.
[2023-03-19 10:40:31] [INFO ] Transformed 90 transitions.
[2023-03-19 10:40:31] [INFO ] Parsed PT model containing 108 places and 90 transitions and 360 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA TriangularGrid-PT-3026-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-3026-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-3026-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-3026-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 11 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 108 cols
[2023-03-19 10:40:32] [INFO ] Computed 46 place invariants in 14 ms
[2023-03-19 10:40:32] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-19 10:40:32] [INFO ] Invariant cache hit.
[2023-03-19 10:40:32] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-19 10:40:32] [INFO ] Invariant cache hit.
[2023-03-19 10:40:32] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 409 ms. Remains : 108/108 places, 90/90 transitions.
Support contains 42 out of 108 places after structural reductions.
[2023-03-19 10:40:32] [INFO ] Flatten gal took : 28 ms
[2023-03-19 10:40:32] [INFO ] Flatten gal took : 12 ms
[2023-03-19 10:40:32] [INFO ] Input system was already deterministic with 90 transitions.
Finished random walk after 166 steps, including 0 resets, run visited all 25 properties in 42 ms. (steps per millisecond=3 )
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(X(p1))) U (!p1&&X(F(p1)))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:40:33] [INFO ] Invariant cache hit.
[2023-03-19 10:40:33] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-19 10:40:33] [INFO ] Invariant cache hit.
[2023-03-19 10:40:33] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-19 10:40:33] [INFO ] Invariant cache hit.
[2023-03-19 10:40:33] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 387 ms :[true, (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s30 1) (GEQ s44 1)), p0:(AND (GEQ s29 1) (GEQ s74 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1573 reset in 604 ms.
Product exploration explored 100000 steps with 1572 reset in 542 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)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), true]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 248 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), true]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 4 factoid took 274 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
[2023-03-19 10:40:35] [INFO ] Invariant cache hit.
[2023-03-19 10:40:35] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2023-03-19 10:40:35] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-19 10:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:35] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-19 10:40:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 10:40:35] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-19 10:40:35] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 10:40:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:35] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-19 10:40:35] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-19 10:40:36] [INFO ] Added : 34 causal constraints over 7 iterations in 107 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 14 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:40:36] [INFO ] Invariant cache hit.
[2023-03-19 10:40:36] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-19 10:40:36] [INFO ] Invariant cache hit.
[2023-03-19 10:40:36] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-19 10:40:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 10:40:36] [INFO ] Invariant cache hit.
[2023-03-19 10:40:36] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 402 ms. Remains : 108/108 places, 90/90 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 p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Finished random walk after 38 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
[2023-03-19 10:40:36] [INFO ] Invariant cache hit.
[2023-03-19 10:40:36] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-19 10:40:36] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-19 10:40:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:36] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-19 10:40:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 10:40:36] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-19 10:40:36] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 10:40:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:37] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-19 10:40:37] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-19 10:40:37] [INFO ] Added : 34 causal constraints over 7 iterations in 86 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1532 reset in 470 ms.
Product exploration explored 100000 steps with 1522 reset in 518 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:40:38] [INFO ] Invariant cache hit.
[2023-03-19 10:40:38] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-19 10:40:38] [INFO ] Invariant cache hit.
[2023-03-19 10:40:38] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-19 10:40:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 10:40:38] [INFO ] Invariant cache hit.
[2023-03-19 10:40:38] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 372 ms. Remains : 108/108 places, 90/90 transitions.
Treatment of property TriangularGrid-PT-3026-LTLFireability-01 finished in 5509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:40:38] [INFO ] Invariant cache hit.
[2023-03-19 10:40:38] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-19 10:40:38] [INFO ] Invariant cache hit.
[2023-03-19 10:40:38] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-19 10:40:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 10:40:38] [INFO ] Invariant cache hit.
[2023-03-19 10:40:38] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 229 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s34 1) (GEQ s86 1)), p0:(AND (GEQ s28 1) (GEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2850 reset in 465 ms.
Product exploration explored 100000 steps with 2832 reset in 489 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 p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (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 (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 232 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 135 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (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 (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 287 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 10:40:40] [INFO ] Invariant cache hit.
[2023-03-19 10:40:40] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-19 10:40:40] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:40:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:40] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-19 10:40:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 10:40:40] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-19 10:40:40] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:40:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:40] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-19 10:40:40] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-19 10:40:40] [INFO ] Added : 35 causal constraints over 7 iterations in 75 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:40:40] [INFO ] Invariant cache hit.
[2023-03-19 10:40:41] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-19 10:40:41] [INFO ] Invariant cache hit.
[2023-03-19 10:40:41] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-19 10:40:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 10:40:41] [INFO ] Invariant cache hit.
[2023-03-19 10:40:41] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 108/108 places, 90/90 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 214 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 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 99 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 257 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 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 10:40:41] [INFO ] Invariant cache hit.
[2023-03-19 10:40:42] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-19 10:40:42] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:42] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-19 10:40:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 10:40:42] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-19 10:40:42] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:40:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:42] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-19 10:40:42] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-19 10:40:42] [INFO ] Added : 35 causal constraints over 7 iterations in 61 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2773 reset in 472 ms.
Product exploration explored 100000 steps with 2720 reset in 518 ms.
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:40:43] [INFO ] Invariant cache hit.
[2023-03-19 10:40:43] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 10:40:43] [INFO ] Invariant cache hit.
[2023-03-19 10:40:43] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-19 10:40:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 10:40:43] [INFO ] Invariant cache hit.
[2023-03-19 10:40:43] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 237 ms. Remains : 108/108 places, 90/90 transitions.
Treatment of property TriangularGrid-PT-3026-LTLFireability-02 finished in 4965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G(p1))) U G((F(p2)||G(p0)))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:40:43] [INFO ] Invariant cache hit.
[2023-03-19 10:40:43] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 10:40:43] [INFO ] Invariant cache hit.
[2023-03-19 10:40:43] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-19 10:40:43] [INFO ] Invariant cache hit.
[2023-03-19 10:40:43] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 493 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={1} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={1} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=8 dest: 6}, { cond=(OR p0 p1), acceptance={} source=8 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s28 1) (GEQ s49 1)), p0:(AND (GEQ s32 1) (GEQ s76 1)), p1:(AND (GEQ s16 1) (GEQ s64 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3708 reset in 526 ms.
Product exploration explored 100000 steps with 3797 reset in 494 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 1168 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 412 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Finished random walk after 43 steps, including 0 resets, run visited all 14 properties in 7 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F p2), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (OR p0 p1))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 2 factoid took 1469 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 417 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Stuttering acceptance computed with spot in 420 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
[2023-03-19 10:40:49] [INFO ] Invariant cache hit.
[2023-03-19 10:40:49] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-19 10:40:49] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:40:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:49] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-19 10:40:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 10:40:49] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-19 10:40:49] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:40:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:49] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-19 10:40:49] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-19 10:40:49] [INFO ] Added : 32 causal constraints over 7 iterations in 64 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:40:49] [INFO ] Invariant cache hit.
[2023-03-19 10:40:49] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-19 10:40:49] [INFO ] Invariant cache hit.
[2023-03-19 10:40:49] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-19 10:40:49] [INFO ] Invariant cache hit.
[2023-03-19 10:40:49] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 108/108 places, 90/90 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 1090 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Finished random walk after 129 steps, including 0 resets, run visited all 14 properties in 8 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p2), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (OR p0 p1))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 2 factoid took 1368 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Stuttering acceptance computed with spot in 378 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
[2023-03-19 10:40:53] [INFO ] Invariant cache hit.
[2023-03-19 10:40:53] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-19 10:40:53] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:40:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:53] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-19 10:40:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 10:40:53] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-19 10:40:53] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:40:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:53] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-19 10:40:53] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-19 10:40:53] [INFO ] Added : 32 causal constraints over 7 iterations in 57 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 424 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Product exploration explored 100000 steps with 3633 reset in 450 ms.
Product exploration explored 100000 steps with 3686 reset in 485 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:40:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 10:40:55] [INFO ] Invariant cache hit.
[2023-03-19 10:40:55] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 108/108 places, 90/90 transitions.
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:40:55] [INFO ] Invariant cache hit.
[2023-03-19 10:40:55] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-19 10:40:55] [INFO ] Invariant cache hit.
[2023-03-19 10:40:55] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-19 10:40:55] [INFO ] Invariant cache hit.
[2023-03-19 10:40:55] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 108/108 places, 90/90 transitions.
Treatment of property TriangularGrid-PT-3026-LTLFireability-03 finished in 12230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:40:55] [INFO ] Invariant cache hit.
[2023-03-19 10:40:55] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-19 10:40:55] [INFO ] Invariant cache hit.
[2023-03-19 10:40:56] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-19 10:40:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 10:40:56] [INFO ] Invariant cache hit.
[2023-03-19 10:40:56] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 359 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (LT s32 1) (LT s81 1)) (OR (LT s13 1) (LT s99 1))), p0:(OR (LT s4 1) (LT s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3041 reset in 483 ms.
Product exploration explored 100000 steps with 3077 reset in 504 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)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 243 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-19 10:40:57] [INFO ] Invariant cache hit.
[2023-03-19 10:40:57] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-19 10:40:57] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 10:40:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:57] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-19 10:40:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 10:40:57] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-19 10:40:57] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:40:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:57] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-19 10:40:57] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-19 10:40:57] [INFO ] Added : 34 causal constraints over 7 iterations in 74 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:40:58] [INFO ] Invariant cache hit.
[2023-03-19 10:40:58] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-19 10:40:58] [INFO ] Invariant cache hit.
[2023-03-19 10:40:58] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-19 10:40:58] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 10:40:58] [INFO ] Invariant cache hit.
[2023-03-19 10:40:58] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 257 ms. Remains : 108/108 places, 90/90 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 252 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 101 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-19 10:40:58] [INFO ] Invariant cache hit.
[2023-03-19 10:40:58] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-19 10:40:58] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 10:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:58] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-19 10:40:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 10:40:59] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-19 10:40:59] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:40:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 10:40:59] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-19 10:40:59] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-19 10:40:59] [INFO ] Added : 34 causal constraints over 7 iterations in 64 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3055 reset in 480 ms.
Product exploration explored 100000 steps with 2997 reset in 513 ms.
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:41:00] [INFO ] Invariant cache hit.
[2023-03-19 10:41:00] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-19 10:41:00] [INFO ] Invariant cache hit.
[2023-03-19 10:41:00] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-19 10:41:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 10:41:00] [INFO ] Invariant cache hit.
[2023-03-19 10:41:00] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 231 ms. Remains : 108/108 places, 90/90 transitions.
Treatment of property TriangularGrid-PT-3026-LTLFireability-04 finished in 4654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:41:00] [INFO ] Invariant cache hit.
[2023-03-19 10:41:00] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-19 10:41:00] [INFO ] Invariant cache hit.
[2023-03-19 10:41:00] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-19 10:41:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 10:41:00] [INFO ] Invariant cache hit.
[2023-03-19 10:41:00] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 232 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 28 reset in 410 ms.
Stack based approach found an accepted trace after 19776 steps with 6 reset with depth 2581 and stack size 2581 in 94 ms.
FORMULA TriangularGrid-PT-3026-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property TriangularGrid-PT-3026-LTLFireability-05 finished in 778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(!p1))&&p0) U (!p2||X(p3))))'
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:41:01] [INFO ] Invariant cache hit.
[2023-03-19 10:41:01] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-19 10:41:01] [INFO ] Invariant cache hit.
[2023-03-19 10:41:01] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-19 10:41:01] [INFO ] Invariant cache hit.
[2023-03-19 10:41:01] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 215 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND p2 (NOT p3)), (NOT p3), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), true, p1]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s33 1) (LT s46 1)), p0:(AND (GEQ s28 1) (GEQ s43 1)), p3:(AND (GEQ s32 1) (GEQ s76 1)), p1:(AND (GEQ s55 1) (GEQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-3026-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3026-LTLFireability-06 finished in 420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:41:01] [INFO ] Invariant cache hit.
[2023-03-19 10:41:01] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-19 10:41:01] [INFO ] Invariant cache hit.
[2023-03-19 10:41:01] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-19 10:41:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 10:41:01] [INFO ] Invariant cache hit.
[2023-03-19 10:41:01] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s71 1) (GEQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3070 reset in 435 ms.
Product exploration explored 100000 steps with 3027 reset in 483 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 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 69 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=69 )
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 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2023-03-19 10:41:03] [INFO ] Invariant cache hit.
[2023-03-19 10:41:03] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2023-03-19 10:41:03] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 10:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:41:03] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-19 10:41:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 10:41:03] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2023-03-19 10:41:03] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:41:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 10:41:03] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-19 10:41:03] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-19 10:41:03] [INFO ] Added : 34 causal constraints over 7 iterations in 70 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:41:03] [INFO ] Invariant cache hit.
[2023-03-19 10:41:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-19 10:41:03] [INFO ] Invariant cache hit.
[2023-03-19 10:41:03] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-19 10:41:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 10:41:03] [INFO ] Invariant cache hit.
[2023-03-19 10:41:03] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 108/108 places, 90/90 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 176 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
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 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-19 10:41:04] [INFO ] Invariant cache hit.
[2023-03-19 10:41:04] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2023-03-19 10:41:04] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-19 10:41:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:41:04] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-19 10:41:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 10:41:04] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-19 10:41:04] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 10:41:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 10:41:04] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-19 10:41:04] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-19 10:41:04] [INFO ] Added : 34 causal constraints over 7 iterations in 59 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3077 reset in 434 ms.
Product exploration explored 100000 steps with 3034 reset in 464 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:41:05] [INFO ] Invariant cache hit.
[2023-03-19 10:41:05] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-19 10:41:05] [INFO ] Invariant cache hit.
[2023-03-19 10:41:05] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-19 10:41:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 10:41:05] [INFO ] Invariant cache hit.
[2023-03-19 10:41:05] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 108/108 places, 90/90 transitions.
Treatment of property TriangularGrid-PT-3026-LTLFireability-07 finished in 4039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G((F(p1)&&(p2 U p3)))))'
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 0 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:41:05] [INFO ] Invariant cache hit.
[2023-03-19 10:41:05] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-19 10:41:05] [INFO ] Invariant cache hit.
[2023-03-19 10:41:05] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-19 10:41:05] [INFO ] Invariant cache hit.
[2023-03-19 10:41:05] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (NOT p3), (OR (NOT p3) (NOT p1))]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p3 p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(OR (AND p3 p0) (AND p2 p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) p2 (NOT p0))), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(OR (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 5}, { cond=(OR p3 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s31 1) (GEQ s39 1)), p2:(AND (GEQ s32 1) (GEQ s76 1)), p0:(AND (GEQ s9 1) (GEQ s96 1)), p1:(AND (GEQ s29 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA TriangularGrid-PT-3026-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3026-LTLFireability-08 finished in 502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1 U p2)&&G(p3))))'
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:41:06] [INFO ] Invariant cache hit.
[2023-03-19 10:41:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-19 10:41:06] [INFO ] Invariant cache hit.
[2023-03-19 10:41:06] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-19 10:41:06] [INFO ] Invariant cache hit.
[2023-03-19 10:41:06] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p3), (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2) (NOT p0)), (OR (NOT p3) (NOT p2) (NOT p0)), true]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 p3), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p3)), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p2 p3), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1)) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p3:(OR (LT s23 1) (LT s67 1) (LT s54 1) (LT s72 1)), p2:(AND (GEQ s3 1) (GEQ s92 1)), p1:(AND (GEQ s31 1) (GEQ s51 1)), p0:(OR (LT s23 1) (LT s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-3026-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3026-LTLFireability-10 finished in 395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0||X(G(p1)))) U G(!p0)))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:41:06] [INFO ] Invariant cache hit.
[2023-03-19 10:41:06] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-19 10:41:06] [INFO ] Invariant cache hit.
[2023-03-19 10:41:06] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-19 10:41:06] [INFO ] Invariant cache hit.
[2023-03-19 10:41:06] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 106 ms :[p0, (AND p0 (NOT p1)), (NOT p1), true]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s99 1)), p1:(AND (GEQ s35 1) (GEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-3026-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3026-LTLFireability-12 finished in 329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((X((!p1 U (p2||G(!p1))))&&p0))))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:41:06] [INFO ] Invariant cache hit.
[2023-03-19 10:41:06] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-19 10:41:06] [INFO ] Invariant cache hit.
[2023-03-19 10:41:07] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-19 10:41:07] [INFO ] Invariant cache hit.
[2023-03-19 10:41:07] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (OR (LT s29 1) (LT s84 1)) (OR (LT s5 1) (LT s58 1))), p2:(AND (NOT (AND (GEQ s30 1) (GEQ s44 1))) (NOT (AND (GEQ s29 1) (GEQ s84 1)))), p1:(AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-3026-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3026-LTLFireability-13 finished in 430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 0 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:41:07] [INFO ] Invariant cache hit.
[2023-03-19 10:41:07] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-19 10:41:07] [INFO ] Invariant cache hit.
[2023-03-19 10:41:07] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-19 10:41:07] [INFO ] Invariant cache hit.
[2023-03-19 10:41:07] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 108/108 places, 90/90 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s31 1) (GEQ s39 1)), p1:(AND (GEQ s35 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TriangularGrid-PT-3026-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-3026-LTLFireability-15 finished in 280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(X(p1))) U (!p1&&X(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G(p1))) U G((F(p2)||G(p0)))))'
Found a Lengthening insensitive property : TriangularGrid-PT-3026-LTLFireability-03
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 11 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:41:08] [INFO ] Invariant cache hit.
[2023-03-19 10:41:08] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-19 10:41:08] [INFO ] Invariant cache hit.
[2023-03-19 10:41:08] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-19 10:41:08] [INFO ] Invariant cache hit.
[2023-03-19 10:41:08] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 211 ms. Remains : 108/108 places, 90/90 transitions.
Running random walk in product with property : TriangularGrid-PT-3026-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={1} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={1} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=8 dest: 6}, { cond=(OR p0 p1), acceptance={} source=8 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s28 1) (GEQ s49 1)), p0:(AND (GEQ s32 1) (GEQ s76 1)), p1:(AND (GEQ s16 1) (GEQ s64 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3655 reset in 448 ms.
Product exploration explored 100000 steps with 3610 reset in 485 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 1120 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Finished random walk after 225 steps, including 0 resets, run visited all 14 properties in 18 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F p2), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (OR p0 p1))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 2 factoid took 1477 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 394 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
[2023-03-19 10:41:13] [INFO ] Invariant cache hit.
[2023-03-19 10:41:13] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-19 10:41:13] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 10:41:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:41:13] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-19 10:41:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 10:41:13] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-19 10:41:13] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:41:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 10:41:13] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-19 10:41:13] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-19 10:41:13] [INFO ] Added : 32 causal constraints over 7 iterations in 61 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:41:13] [INFO ] Invariant cache hit.
[2023-03-19 10:41:13] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-19 10:41:13] [INFO ] Invariant cache hit.
[2023-03-19 10:41:13] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-19 10:41:13] [INFO ] Invariant cache hit.
[2023-03-19 10:41:13] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 209 ms. Remains : 108/108 places, 90/90 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 1145 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Finished random walk after 140 steps, including 0 resets, run visited all 14 properties in 12 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p2), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (OR p0 p1))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 2 factoid took 1506 ms. Reduced automaton from 10 states, 31 edges and 3 AP (stutter sensitive) to 10 states, 31 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Stuttering acceptance computed with spot in 402 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
[2023-03-19 10:41:17] [INFO ] Invariant cache hit.
[2023-03-19 10:41:17] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-19 10:41:17] [INFO ] [Real]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:41:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 10:41:17] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-19 10:41:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 10:41:17] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-19 10:41:17] [INFO ] [Nat]Absence check using 45 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 10:41:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 10:41:17] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-19 10:41:17] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-19 10:41:17] [INFO ] Added : 32 causal constraints over 7 iterations in 69 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Product exploration explored 100000 steps with 3635 reset in 450 ms.
Product exploration explored 100000 steps with 3813 reset in 481 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 397 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1), false]
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:41:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 10:41:19] [INFO ] Invariant cache hit.
[2023-03-19 10:41:19] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 108/108 places, 90/90 transitions.
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 90/90 transitions.
Applied a total of 0 rules in 0 ms. Remains 108 /108 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-19 10:41:19] [INFO ] Invariant cache hit.
[2023-03-19 10:41:19] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-19 10:41:19] [INFO ] Invariant cache hit.
[2023-03-19 10:41:19] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-19 10:41:19] [INFO ] Invariant cache hit.
[2023-03-19 10:41:19] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 108/108 places, 90/90 transitions.
Treatment of property TriangularGrid-PT-3026-LTLFireability-03 finished in 12096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2023-03-19 10:41:20] [INFO ] Flatten gal took : 10 ms
[2023-03-19 10:41:20] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-19 10:41:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 90 transitions and 360 arcs took 2 ms.
Total runtime 48431 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT TriangularGrid-PT-3026
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA TriangularGrid-PT-3026-LTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TriangularGrid-PT-3026-LTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TriangularGrid-PT-3026-LTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TriangularGrid-PT-3026-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TriangularGrid-PT-3026-LTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679222481082

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 TriangularGrid-PT-3026-LTLFireability-02
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 4 (type EXCL) for TriangularGrid-PT-3026-LTLFireability-02
lola: result : false
lola: markings : 239
lola: fired transitions : 239
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 TriangularGrid-PT-3026-LTLFireability-03
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for TriangularGrid-PT-3026-LTLFireability-03
lola: result : false
lola: markings : 131
lola: fired transitions : 131
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 TriangularGrid-PT-3026-LTLFireability-01
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for TriangularGrid-PT-3026-LTLFireability-01
lola: result : false
lola: markings : 127
lola: fired transitions : 127
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 15 (type EXCL) for 12 TriangularGrid-PT-3026-LTLFireability-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 15 (type EXCL) for TriangularGrid-PT-3026-LTLFireability-07
lola: result : true
lola: markings : 356
lola: fired transitions : 356
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 TriangularGrid-PT-3026-LTLFireability-04
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for TriangularGrid-PT-3026-LTLFireability-04
lola: result : false
lola: markings : 291
lola: fired transitions : 294
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
TriangularGrid-PT-3026-LTLFireability-01: LTL false LTL model checker
TriangularGrid-PT-3026-LTLFireability-02: LTL false LTL model checker
TriangularGrid-PT-3026-LTLFireability-03: LTL false LTL model checker
TriangularGrid-PT-3026-LTLFireability-04: LTL false LTL model checker
TriangularGrid-PT-3026-LTLFireability-07: F false state space / EG


Time elapsed: 0 secs. Pages in use: 1

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-3026"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is TriangularGrid-PT-3026, 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 r487-tall-167912703500740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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