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

About the Execution of LoLa+red for HexagonalGrid-PT-226

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
376.071 104320.00 130490.00 1210.70 TFFFFFFFFTFFTFFF 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.r199-smll-167840345900388.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 HexagonalGrid-PT-226, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345900388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.0K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 112K Mar 5 18:22 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 HexagonalGrid-PT-226-LTLFireability-00
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-01
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-02
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-03
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-04
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-05
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-06
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-07
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-08
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-09
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-10
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-11
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-12
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-13
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-14
FORMULA_NAME HexagonalGrid-PT-226-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678527135983

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=HexagonalGrid-PT-226
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 09:32:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 09:32:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:32:19] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2023-03-11 09:32:19] [INFO ] Transformed 169 places.
[2023-03-11 09:32:19] [INFO ] Transformed 270 transitions.
[2023-03-11 09:32:19] [INFO ] Parsed PT model containing 169 places and 270 transitions and 1080 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA HexagonalGrid-PT-226-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-226-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-226-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-226-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-226-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 41 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
// Phase 1: matrix 270 rows 169 cols
[2023-03-11 09:32:19] [INFO ] Computed 68 place invariants in 21 ms
[2023-03-11 09:32:20] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-11 09:32:20] [INFO ] Invariant cache hit.
[2023-03-11 09:32:20] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2023-03-11 09:32:20] [INFO ] Invariant cache hit.
[2023-03-11 09:32:20] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1054 ms. Remains : 169/169 places, 270/270 transitions.
Support contains 37 out of 169 places after structural reductions.
[2023-03-11 09:32:21] [INFO ] Flatten gal took : 111 ms
[2023-03-11 09:32:21] [INFO ] Flatten gal took : 57 ms
[2023-03-11 09:32:21] [INFO ] Input system was already deterministic with 270 transitions.
Support contains 35 out of 169 places (down from 37) after GAL structural reductions.
Finished random walk after 584 steps, including 0 resets, run visited all 24 properties in 111 ms. (steps per millisecond=5 )
FORMULA HexagonalGrid-PT-226-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (X(F(!p2))&&p1))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 23 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:32:22] [INFO ] Invariant cache hit.
[2023-03-11 09:32:22] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-11 09:32:22] [INFO ] Invariant cache hit.
[2023-03-11 09:32:22] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2023-03-11 09:32:22] [INFO ] Invariant cache hit.
[2023-03-11 09:32:22] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 924 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), p2, true]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 2}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s48 1) (GEQ s55 1)), p0:(AND (GEQ s48 1) (GEQ s55 1)), p2:(AND (GEQ s34 1) (GEQ s91 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-03 finished in 1440 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((p0||(F(p1)&&G(p2))))))'
Support contains 8 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 20 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:32:23] [INFO ] Invariant cache hit.
[2023-03-11 09:32:23] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-11 09:32:23] [INFO ] Invariant cache hit.
[2023-03-11 09:32:23] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2023-03-11 09:32:23] [INFO ] Invariant cache hit.
[2023-03-11 09:32:24] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 936 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 314 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p2:(OR (LT s38 1) (LT s93 1)), p1:(AND (GEQ s45 1) (GEQ s123 1) (GEQ s46 1) (GEQ s115 1)), p0:(AND (GEQ s42 1) (GEQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 2 steps with 0 reset in 1 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-04 finished in 1273 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 U p2)&&p0))))'
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 24 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:32:24] [INFO ] Invariant cache hit.
[2023-03-11 09:32:24] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-11 09:32:24] [INFO ] Invariant cache hit.
[2023-03-11 09:32:25] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2023-03-11 09:32:25] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-11 09:32:25] [INFO ] Invariant cache hit.
[2023-03-11 09:32:25] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 721 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s46 1) (GEQ s124 1)), p0:(AND (GEQ s42 1) (GEQ s111 1)), p1:(AND (GEQ s43 1) (GEQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6664 steps with 2 reset in 113 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-06 finished in 956 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) U (p1||F(p2))))'
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 11 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:32:25] [INFO ] Invariant cache hit.
[2023-03-11 09:32:25] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-11 09:32:25] [INFO ] Invariant cache hit.
[2023-03-11 09:32:26] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2023-03-11 09:32:26] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-11 09:32:26] [INFO ] Invariant cache hit.
[2023-03-11 09:32:26] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 784 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s43 1) (GEQ s64 1)), p2:(AND (GEQ s43 1) (GEQ s57 1)), p0:(AND (GEQ s45 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 869 reset in 1232 ms.
Product exploration explored 100000 steps with 921 reset in 1352 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 p2) (NOT p0)), (X (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 543 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
Finished random walk after 117 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F p2)]
Knowledge based reduction with 2 factoid took 568 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 40 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p2)]
[2023-03-11 09:32:30] [INFO ] Invariant cache hit.
[2023-03-11 09:32:30] [INFO ] [Real]Absence check using 67 positive place invariants in 32 ms returned sat
[2023-03-11 09:32:30] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 09:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:32:30] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2023-03-11 09:32:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:32:31] [INFO ] [Nat]Absence check using 67 positive place invariants in 24 ms returned sat
[2023-03-11 09:32:31] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-11 09:32:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:32:31] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2023-03-11 09:32:31] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-11 09:32:31] [INFO ] Added : 58 causal constraints over 12 iterations in 324 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 169 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 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 11 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:32:31] [INFO ] Invariant cache hit.
[2023-03-11 09:32:31] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-11 09:32:31] [INFO ] Invariant cache hit.
[2023-03-11 09:32:32] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2023-03-11 09:32:32] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-11 09:32:32] [INFO ] Invariant cache hit.
[2023-03-11 09:32:32] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 689 ms. Remains : 169/169 places, 270/270 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 p2), (X (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 124 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 p2)]
Finished random walk after 160 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=40 )
Knowledge obtained : [(NOT p2), (X (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 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 34 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
[2023-03-11 09:32:32] [INFO ] Invariant cache hit.
[2023-03-11 09:32:32] [INFO ] [Real]Absence check using 67 positive place invariants in 29 ms returned sat
[2023-03-11 09:32:32] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 09:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:32:33] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-11 09:32:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:32:33] [INFO ] [Nat]Absence check using 67 positive place invariants in 26 ms returned sat
[2023-03-11 09:32:33] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-11 09:32:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:32:33] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2023-03-11 09:32:33] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-11 09:32:33] [INFO ] Added : 58 causal constraints over 12 iterations in 342 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 53 ms :[(NOT p2)]
Product exploration explored 100000 steps with 864 reset in 1044 ms.
Product exploration explored 100000 steps with 877 reset in 1116 ms.
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 13 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:32:36] [INFO ] Invariant cache hit.
[2023-03-11 09:32:36] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-11 09:32:36] [INFO ] Invariant cache hit.
[2023-03-11 09:32:36] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2023-03-11 09:32:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 09:32:36] [INFO ] Invariant cache hit.
[2023-03-11 09:32:36] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 711 ms. Remains : 169/169 places, 270/270 transitions.
Treatment of property HexagonalGrid-PT-226-LTLFireability-07 finished in 11225 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((F(p0) U !p1)))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:32:36] [INFO ] Invariant cache hit.
[2023-03-11 09:32:36] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-11 09:32:36] [INFO ] Invariant cache hit.
[2023-03-11 09:32:37] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-03-11 09:32:37] [INFO ] Invariant cache hit.
[2023-03-11 09:32:37] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 705 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 146 ms :[p1, p1, (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s44 1) (GEQ s74 1)), p0:(AND (GEQ s45 1) (GEQ s52 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 803 ms.
Product exploration explored 100000 steps with 50000 reset in 692 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))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HexagonalGrid-PT-226-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HexagonalGrid-PT-226-LTLFireability-09 finished in 2580 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((X(X(F(p0)))||(G(p2)&&p1))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:32:39] [INFO ] Invariant cache hit.
[2023-03-11 09:32:39] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-11 09:32:39] [INFO ] Invariant cache hit.
[2023-03-11 09:32:39] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2023-03-11 09:32:39] [INFO ] Invariant cache hit.
[2023-03-11 09:32:40] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 668 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s43 1) (GEQ s64 1)), p2:(AND (GEQ s43 1) (GEQ s64 1)), p0:(AND (GEQ s47 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1786 reset in 1067 ms.
Product exploration explored 100000 steps with 1804 reset in 1140 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 p2) (NOT p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))))]
Knowledge based reduction with 1 factoid took 387 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 5 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (AND p1 p2))]
Knowledge based reduction with 1 factoid took 475 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-11 09:32:44] [INFO ] Invariant cache hit.
[2023-03-11 09:32:44] [INFO ] [Real]Absence check using 67 positive place invariants in 32 ms returned sat
[2023-03-11 09:32:44] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-11 09:32:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:32:44] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2023-03-11 09:32:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:32:44] [INFO ] [Nat]Absence check using 67 positive place invariants in 30 ms returned sat
[2023-03-11 09:32:44] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 09:32:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:32:44] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2023-03-11 09:32:44] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-11 09:32:45] [INFO ] Added : 59 causal constraints over 12 iterations in 299 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-11 09:32:45] [INFO ] Invariant cache hit.
[2023-03-11 09:32:45] [INFO ] [Real]Absence check using 67 positive place invariants in 30 ms returned sat
[2023-03-11 09:32:45] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-11 09:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:32:45] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2023-03-11 09:32:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:32:45] [INFO ] [Nat]Absence check using 67 positive place invariants in 32 ms returned sat
[2023-03-11 09:32:45] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 09:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:32:46] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2023-03-11 09:32:46] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 27 ms.
[2023-03-11 09:32:46] [INFO ] Added : 59 causal constraints over 12 iterations in 317 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 4 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:32:46] [INFO ] Invariant cache hit.
[2023-03-11 09:32:46] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-11 09:32:46] [INFO ] Invariant cache hit.
[2023-03-11 09:32:46] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-11 09:32:46] [INFO ] Invariant cache hit.
[2023-03-11 09:32:47] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 169/169 places, 270/270 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
Knowledge based reduction with 1 factoid took 341 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 2 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (AND p1 p2))]
Knowledge based reduction with 1 factoid took 439 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-11 09:32:48] [INFO ] Invariant cache hit.
[2023-03-11 09:32:48] [INFO ] [Real]Absence check using 67 positive place invariants in 27 ms returned sat
[2023-03-11 09:32:48] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 09:32:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:32:48] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2023-03-11 09:32:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:32:49] [INFO ] [Nat]Absence check using 67 positive place invariants in 44 ms returned sat
[2023-03-11 09:32:49] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 09:32:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:32:49] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2023-03-11 09:32:49] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-11 09:32:49] [INFO ] Added : 59 causal constraints over 12 iterations in 249 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-11 09:32:49] [INFO ] Invariant cache hit.
[2023-03-11 09:32:49] [INFO ] [Real]Absence check using 67 positive place invariants in 27 ms returned sat
[2023-03-11 09:32:49] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 09:32:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:32:50] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2023-03-11 09:32:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:32:50] [INFO ] [Nat]Absence check using 67 positive place invariants in 29 ms returned sat
[2023-03-11 09:32:50] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 09:32:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:32:50] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2023-03-11 09:32:50] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-11 09:32:50] [INFO ] Added : 59 causal constraints over 12 iterations in 246 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1691 reset in 1087 ms.
Product exploration explored 100000 steps with 1676 reset in 1174 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 12 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:32:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 09:32:53] [INFO ] Invariant cache hit.
[2023-03-11 09:32:53] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 280 ms. Remains : 169/169 places, 270/270 transitions.
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:32:53] [INFO ] Invariant cache hit.
[2023-03-11 09:32:54] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-11 09:32:54] [INFO ] Invariant cache hit.
[2023-03-11 09:32:54] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-11 09:32:54] [INFO ] Invariant cache hit.
[2023-03-11 09:32:54] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 665 ms. Remains : 169/169 places, 270/270 transitions.
Treatment of property HexagonalGrid-PT-226-LTLFireability-10 finished in 15198 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((G(!p0)||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:32:54] [INFO ] Invariant cache hit.
[2023-03-11 09:32:54] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-11 09:32:54] [INFO ] Invariant cache hit.
[2023-03-11 09:32:55] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
[2023-03-11 09:32:55] [INFO ] Invariant cache hit.
[2023-03-11 09:32:55] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 990 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s45 1) (GEQ s59 1)), p2:(AND (GEQ s44 1) (GEQ s58 1)), p1:(AND (GEQ s24 1) (GEQ s84 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1559 reset in 1165 ms.
Product exploration explored 100000 steps with 1550 reset in 1240 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 804 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 579 steps, including 0 resets, run visited all 10 properties in 20 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (OR (AND p0 p2) (AND p1 p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 1084 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 134 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 7 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:00] [INFO ] Invariant cache hit.
[2023-03-11 09:33:00] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-11 09:33:00] [INFO ] Invariant cache hit.
[2023-03-11 09:33:01] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2023-03-11 09:33:01] [INFO ] Invariant cache hit.
[2023-03-11 09:33:01] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 626 ms. Remains : 169/169 places, 270/270 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)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
Knowledge based reduction with 6 factoid took 965 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 734 steps, including 0 resets, run visited all 10 properties in 36 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (OR (AND p0 p2) (AND p1 p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 1333 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 144 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 1562 reset in 1267 ms.
Product exploration explored 100000 steps with 1556 reset in 1513 ms.
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 3 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:07] [INFO ] Invariant cache hit.
[2023-03-11 09:33:07] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-11 09:33:07] [INFO ] Invariant cache hit.
[2023-03-11 09:33:07] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2023-03-11 09:33:07] [INFO ] Invariant cache hit.
[2023-03-11 09:33:07] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 793 ms. Remains : 169/169 places, 270/270 transitions.
Treatment of property HexagonalGrid-PT-226-LTLFireability-11 finished in 13323 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(F(p0)))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 4 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:07] [INFO ] Invariant cache hit.
[2023-03-11 09:33:08] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-11 09:33:08] [INFO ] Invariant cache hit.
[2023-03-11 09:33:08] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2023-03-11 09:33:08] [INFO ] Invariant cache hit.
[2023-03-11 09:33:08] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 715 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s87 1) (GEQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1868 reset in 1043 ms.
Product exploration explored 100000 steps with 1728 reset in 1110 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 119 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 34 ms :[(NOT p0)]
Finished random walk after 167 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=41 )
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 163 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 32 ms :[(NOT p0)]
[2023-03-11 09:33:11] [INFO ] Invariant cache hit.
[2023-03-11 09:33:11] [INFO ] [Real]Absence check using 67 positive place invariants in 27 ms returned sat
[2023-03-11 09:33:11] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 09:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:11] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2023-03-11 09:33:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:33:11] [INFO ] [Nat]Absence check using 67 positive place invariants in 30 ms returned sat
[2023-03-11 09:33:11] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 09:33:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:12] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2023-03-11 09:33:12] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-11 09:33:12] [INFO ] Added : 56 causal constraints over 12 iterations in 240 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 7 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:12] [INFO ] Invariant cache hit.
[2023-03-11 09:33:12] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-11 09:33:12] [INFO ] Invariant cache hit.
[2023-03-11 09:33:12] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2023-03-11 09:33:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 09:33:12] [INFO ] Invariant cache hit.
[2023-03-11 09:33:13] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 687 ms. Remains : 169/169 places, 270/270 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 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 32 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
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 143 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 p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-11 09:33:13] [INFO ] Invariant cache hit.
[2023-03-11 09:33:13] [INFO ] [Real]Absence check using 67 positive place invariants in 26 ms returned sat
[2023-03-11 09:33:13] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 09:33:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:13] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2023-03-11 09:33:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:33:13] [INFO ] [Nat]Absence check using 67 positive place invariants in 29 ms returned sat
[2023-03-11 09:33:13] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-11 09:33:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:14] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2023-03-11 09:33:14] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-11 09:33:14] [INFO ] Added : 56 causal constraints over 12 iterations in 233 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1716 reset in 1040 ms.
Product exploration explored 100000 steps with 1746 reset in 1115 ms.
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 7 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:16] [INFO ] Invariant cache hit.
[2023-03-11 09:33:16] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-11 09:33:16] [INFO ] Invariant cache hit.
[2023-03-11 09:33:17] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-11 09:33:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 09:33:17] [INFO ] Invariant cache hit.
[2023-03-11 09:33:17] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 675 ms. Remains : 169/169 places, 270/270 transitions.
Treatment of property HexagonalGrid-PT-226-LTLFireability-13 finished in 9316 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) U X(p1))&&X(G(p2))))'
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:17] [INFO ] Invariant cache hit.
[2023-03-11 09:33:17] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-11 09:33:17] [INFO ] Invariant cache hit.
[2023-03-11 09:33:17] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2023-03-11 09:33:17] [INFO ] Invariant cache hit.
[2023-03-11 09:33:17] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 680 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s43 1) (GEQ s64 1)), p2:(AND (GEQ s18 1) (GEQ s157 1)), p1:(AND (GEQ s47 1) (GEQ s75 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 112 steps with 3 reset in 1 ms.
FORMULA HexagonalGrid-PT-226-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-14 finished in 981 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 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:18] [INFO ] Invariant cache hit.
[2023-03-11 09:33:18] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-11 09:33:18] [INFO ] Invariant cache hit.
[2023-03-11 09:33:18] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-11 09:33:18] [INFO ] Invariant cache hit.
[2023-03-11 09:33:18] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 666 ms. Remains : 169/169 places, 270/270 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HexagonalGrid-PT-226-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 s43 1) (GEQ s116 1)), p1:(AND (GEQ s43 1) (GEQ s112 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 HexagonalGrid-PT-226-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-226-LTLFireability-15 finished in 768 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) U (p1||F(p2))))'
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((X(X(F(p0)))||(G(p2)&&p1))))'
Found a Shortening insensitive property : HexagonalGrid-PT-226-LTLFireability-10
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 6 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:19] [INFO ] Invariant cache hit.
[2023-03-11 09:33:19] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-11 09:33:19] [INFO ] Invariant cache hit.
[2023-03-11 09:33:19] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-11 09:33:19] [INFO ] Invariant cache hit.
[2023-03-11 09:33:20] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 668 ms. Remains : 169/169 places, 270/270 transitions.
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s43 1) (GEQ s64 1)), p2:(AND (GEQ s43 1) (GEQ s64 1)), p0:(AND (GEQ s47 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1765 reset in 1076 ms.
Product exploration explored 100000 steps with 1741 reset in 1149 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 p2) (NOT p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))))]
Knowledge based reduction with 1 factoid took 331 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 2 steps, including 0 resets, run visited all 6 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (AND p1 p2))]
Knowledge based reduction with 1 factoid took 556 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-11 09:33:23] [INFO ] Invariant cache hit.
[2023-03-11 09:33:23] [INFO ] [Real]Absence check using 67 positive place invariants in 39 ms returned sat
[2023-03-11 09:33:23] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 9 ms returned sat
[2023-03-11 09:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:24] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2023-03-11 09:33:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:33:24] [INFO ] [Nat]Absence check using 67 positive place invariants in 44 ms returned sat
[2023-03-11 09:33:24] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 09:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:24] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2023-03-11 09:33:24] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-11 09:33:25] [INFO ] Added : 59 causal constraints over 12 iterations in 316 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-11 09:33:25] [INFO ] Invariant cache hit.
[2023-03-11 09:33:25] [INFO ] [Real]Absence check using 67 positive place invariants in 29 ms returned sat
[2023-03-11 09:33:25] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 09:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:25] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2023-03-11 09:33:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:33:25] [INFO ] [Nat]Absence check using 67 positive place invariants in 31 ms returned sat
[2023-03-11 09:33:25] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 09:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:26] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2023-03-11 09:33:26] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-11 09:33:26] [INFO ] Added : 59 causal constraints over 12 iterations in 252 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:26] [INFO ] Invariant cache hit.
[2023-03-11 09:33:26] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-11 09:33:26] [INFO ] Invariant cache hit.
[2023-03-11 09:33:26] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-03-11 09:33:26] [INFO ] Invariant cache hit.
[2023-03-11 09:33:27] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 685 ms. Remains : 169/169 places, 270/270 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
Knowledge based reduction with 1 factoid took 452 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 21 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (AND p1 p2))]
Knowledge based reduction with 1 factoid took 712 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2023-03-11 09:33:28] [INFO ] Invariant cache hit.
[2023-03-11 09:33:28] [INFO ] [Real]Absence check using 67 positive place invariants in 27 ms returned sat
[2023-03-11 09:33:28] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 09:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:29] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2023-03-11 09:33:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:33:29] [INFO ] [Nat]Absence check using 67 positive place invariants in 28 ms returned sat
[2023-03-11 09:33:29] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 09:33:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:29] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2023-03-11 09:33:29] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-11 09:33:29] [INFO ] Added : 59 causal constraints over 12 iterations in 252 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-11 09:33:29] [INFO ] Invariant cache hit.
[2023-03-11 09:33:30] [INFO ] [Real]Absence check using 67 positive place invariants in 39 ms returned sat
[2023-03-11 09:33:30] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-11 09:33:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:30] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2023-03-11 09:33:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:33:30] [INFO ] [Nat]Absence check using 67 positive place invariants in 30 ms returned sat
[2023-03-11 09:33:30] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 09:33:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:30] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2023-03-11 09:33:30] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-11 09:33:31] [INFO ] Added : 59 causal constraints over 12 iterations in 282 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1702 reset in 1092 ms.
Product exploration explored 100000 steps with 1791 reset in 1169 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 6 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 09:33:33] [INFO ] Invariant cache hit.
[2023-03-11 09:33:34] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 169/169 places, 270/270 transitions.
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 6 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:34] [INFO ] Invariant cache hit.
[2023-03-11 09:33:34] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-11 09:33:34] [INFO ] Invariant cache hit.
[2023-03-11 09:33:34] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2023-03-11 09:33:34] [INFO ] Invariant cache hit.
[2023-03-11 09:33:34] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 654 ms. Remains : 169/169 places, 270/270 transitions.
Treatment of property HexagonalGrid-PT-226-LTLFireability-10 finished in 15708 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((G(!p0)||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Found a Shortening insensitive property : HexagonalGrid-PT-226-LTLFireability-11
Stuttering acceptance computed with spot in 155 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 5 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:35] [INFO ] Invariant cache hit.
[2023-03-11 09:33:35] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-11 09:33:35] [INFO ] Invariant cache hit.
[2023-03-11 09:33:35] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-11 09:33:35] [INFO ] Invariant cache hit.
[2023-03-11 09:33:35] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 784 ms. Remains : 169/169 places, 270/270 transitions.
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s45 1) (GEQ s59 1)), p2:(AND (GEQ s44 1) (GEQ s58 1)), p1:(AND (GEQ s24 1) (GEQ s84 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1558 reset in 1155 ms.
Product exploration explored 100000 steps with 1547 reset in 1224 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 1300 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 295 steps, including 0 resets, run visited all 10 properties in 24 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (OR (AND p0 p2) (AND p1 p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 1524 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 132 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:41] [INFO ] Invariant cache hit.
[2023-03-11 09:33:41] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-11 09:33:41] [INFO ] Invariant cache hit.
[2023-03-11 09:33:42] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2023-03-11 09:33:42] [INFO ] Invariant cache hit.
[2023-03-11 09:33:42] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 625 ms. Remains : 169/169 places, 270/270 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)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
Knowledge based reduction with 6 factoid took 968 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 1592 steps, including 0 resets, run visited all 10 properties in 77 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F (OR (AND p0 p2) (AND p1 p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 1839 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 111 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 112 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 1539 reset in 1160 ms.
Product exploration explored 100000 steps with 1521 reset in 1235 ms.
Support contains 6 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:48] [INFO ] Invariant cache hit.
[2023-03-11 09:33:48] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-11 09:33:48] [INFO ] Invariant cache hit.
[2023-03-11 09:33:48] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-11 09:33:48] [INFO ] Invariant cache hit.
[2023-03-11 09:33:48] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 798 ms. Remains : 169/169 places, 270/270 transitions.
Treatment of property HexagonalGrid-PT-226-LTLFireability-11 finished in 14085 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(F(p0)))'
Found a Shortening insensitive property : HexagonalGrid-PT-226-LTLFireability-13
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 4 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:49] [INFO ] Invariant cache hit.
[2023-03-11 09:33:49] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-11 09:33:49] [INFO ] Invariant cache hit.
[2023-03-11 09:33:49] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2023-03-11 09:33:49] [INFO ] Invariant cache hit.
[2023-03-11 09:33:49] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 741 ms. Remains : 169/169 places, 270/270 transitions.
Running random walk in product with property : HexagonalGrid-PT-226-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s87 1) (GEQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1636 reset in 1040 ms.
Product exploration explored 100000 steps with 1749 reset in 1132 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 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 49 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
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 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2023-03-11 09:33:52] [INFO ] Invariant cache hit.
[2023-03-11 09:33:52] [INFO ] [Real]Absence check using 67 positive place invariants in 38 ms returned sat
[2023-03-11 09:33:52] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 9 ms returned sat
[2023-03-11 09:33:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:53] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2023-03-11 09:33:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:33:53] [INFO ] [Nat]Absence check using 67 positive place invariants in 29 ms returned sat
[2023-03-11 09:33:53] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 09:33:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:53] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2023-03-11 09:33:53] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-11 09:33:53] [INFO ] Added : 56 causal constraints over 12 iterations in 231 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 6 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:53] [INFO ] Invariant cache hit.
[2023-03-11 09:33:53] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-11 09:33:53] [INFO ] Invariant cache hit.
[2023-03-11 09:33:54] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2023-03-11 09:33:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 09:33:54] [INFO ] Invariant cache hit.
[2023-03-11 09:33:54] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 843 ms. Remains : 169/169 places, 270/270 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 156 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 54 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
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 136 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 49 ms :[(NOT p0)]
[2023-03-11 09:33:54] [INFO ] Invariant cache hit.
[2023-03-11 09:33:55] [INFO ] [Real]Absence check using 67 positive place invariants in 27 ms returned sat
[2023-03-11 09:33:55] [INFO ] [Real]Absence check using 67 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 09:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:55] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2023-03-11 09:33:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:33:55] [INFO ] [Nat]Absence check using 67 positive place invariants in 29 ms returned sat
[2023-03-11 09:33:55] [INFO ] [Nat]Absence check using 67 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 09:33:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:33:55] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2023-03-11 09:33:55] [INFO ] Computed and/alt/rep : 228/228/228 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-11 09:33:55] [INFO ] Added : 56 causal constraints over 12 iterations in 231 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1710 reset in 1041 ms.
Product exploration explored 100000 steps with 1760 reset in 1132 ms.
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 270/270 transitions.
Applied a total of 0 rules in 6 ms. Remains 169 /169 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2023-03-11 09:33:58] [INFO ] Invariant cache hit.
[2023-03-11 09:33:58] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-11 09:33:58] [INFO ] Invariant cache hit.
[2023-03-11 09:33:58] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2023-03-11 09:33:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 09:33:58] [INFO ] Invariant cache hit.
[2023-03-11 09:33:58] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 685 ms. Remains : 169/169 places, 270/270 transitions.
Treatment of property HexagonalGrid-PT-226-LTLFireability-13 finished in 9913 ms.
[2023-03-11 09:33:58] [INFO ] Flatten gal took : 29 ms
[2023-03-11 09:33:58] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 09:33:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 169 places, 270 transitions and 1080 arcs took 4 ms.
Total runtime 99829 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT HexagonalGrid-PT-226
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA HexagonalGrid-PT-226-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-226-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-226-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HexagonalGrid-PT-226-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678527240303

--------------------
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: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 HexagonalGrid-PT-226-LTLFireability-10
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for HexagonalGrid-PT-226-LTLFireability-10
lola: result : false
lola: markings : 926
lola: fired transitions : 930
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 HexagonalGrid-PT-226-LTLFireability-11
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for HexagonalGrid-PT-226-LTLFireability-11
lola: result : false
lola: markings : 24985
lola: fired transitions : 25839
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 HexagonalGrid-PT-226-LTLFireability-13
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for HexagonalGrid-PT-226-LTLFireability-13
lola: result : false
lola: markings : 669
lola: fired transitions : 670
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 HexagonalGrid-PT-226-LTLFireability-07
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for HexagonalGrid-PT-226-LTLFireability-07
lola: result : false
lola: markings : 102
lola: fired transitions : 102
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HexagonalGrid-PT-226-LTLFireability-07: LTL false LTL model checker
HexagonalGrid-PT-226-LTLFireability-10: LTL false LTL model checker
HexagonalGrid-PT-226-LTLFireability-11: LTL false LTL model checker
HexagonalGrid-PT-226-LTLFireability-13: LTL false LTL model checker


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="HexagonalGrid-PT-226"
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 HexagonalGrid-PT-226, 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 r199-smll-167840345900388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HexagonalGrid-PT-226.tgz
mv HexagonalGrid-PT-226 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 ;