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.r457-smll-167912649200348.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 ltsminxred
Input is Solitaire-PT-SqrNC5x5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649200348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.4K Feb 26 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 69K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679390170499

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Solitaire-PT-SqrNC5x5
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 09:16:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 09:16:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 09:16:13] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-21 09:16:13] [INFO ] Transformed 50 places.
[2023-03-21 09:16:13] [INFO ] Transformed 84 transitions.
[2023-03-21 09:16:13] [INFO ] Found NUPN structural information;
[2023-03-21 09:16:13] [INFO ] Parsed PT model containing 50 places and 84 transitions and 456 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 14 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 50 cols
[2023-03-21 09:16:14] [INFO ] Computed 25 place invariants in 11 ms
[2023-03-21 09:16:14] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-21 09:16:14] [INFO ] Invariant cache hit.
[2023-03-21 09:16:14] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-21 09:16:14] [INFO ] Invariant cache hit.
[2023-03-21 09:16:14] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 633 ms. Remains : 50/50 places, 84/84 transitions.
Support contains 36 out of 50 places after structural reductions.
[2023-03-21 09:16:15] [INFO ] Flatten gal took : 70 ms
[2023-03-21 09:16:15] [INFO ] Flatten gal took : 31 ms
[2023-03-21 09:16:15] [INFO ] Input system was already deterministic with 84 transitions.
Finished random walk after 665 steps, including 30 resets, run visited all 30 properties in 85 ms. (steps per millisecond=7 )
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-10 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' '!(X((p0&&(p1 U p2)&&X(F(p3)))))'
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:15] [INFO ] Invariant cache hit.
[2023-03-21 09:16:16] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-21 09:16:16] [INFO ] Invariant cache hit.
[2023-03-21 09:16:16] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-21 09:16:16] [INFO ] Invariant cache hit.
[2023-03-21 09:16:16] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 577 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s29 0) (EQ s35 0) (EQ s38 0) (AND (EQ s8 1) (EQ s14 1) (EQ s21 1))), p2:(AND (EQ s9 1) (EQ s23 1) (EQ s29 1)), p1:(AND (EQ s29 1) (EQ s35 1) (E...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-01 finished in 1217 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(((F(p2)||p1)&&p0))))'
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 20 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:17] [INFO ] Invariant cache hit.
[2023-03-21 09:16:17] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-21 09:16:17] [INFO ] Invariant cache hit.
[2023-03-21 09:16:17] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-21 09:16:17] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 09:16:17] [INFO ] Invariant cache hit.
[2023-03-21 09:16:17] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 428 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s17 1) (EQ s23 1) (EQ s26 1)), p1:(OR (EQ s16 0) (EQ s25 0) (EQ s44 0)), p2:(OR (EQ s17 0) (EQ s23 0) (EQ s26 0))], 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 24 steps with 0 reset in 2 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-05 finished in 579 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((X(((!p1 U (p2||G(!p1))) U ((!p3&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1)))))))||p0))))'
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:17] [INFO ] Invariant cache hit.
[2023-03-21 09:16:17] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-21 09:16:17] [INFO ] Invariant cache hit.
[2023-03-21 09:16:17] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-21 09:16:17] [INFO ] Invariant cache hit.
[2023-03-21 09:16:18] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p3) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s2 0) (EQ s7 0) (EQ s33 0) (EQ s36 0) (EQ s39 0)), p2:(AND (NOT (AND (EQ s2 1) (EQ s7 1))) (NOT (AND (EQ s33 1) (EQ s36 1) (EQ s39 1)))), p1:(A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4534 reset in 960 ms.
Product exploration explored 100000 steps with 4519 reset in 522 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))))]
False Knowledge obtained : [(X (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0))))), (X (AND p2 (NOT p3) p0)), (X (NOT (AND p2 (NOT p3) p0))), (X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X p0), (X (NOT p0)), (X (X (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0)))))), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 1126 ms. Reduced automaton from 3 states, 12 edges and 4 AP (stutter sensitive) to 3 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 450 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 09:16:21] [INFO ] Invariant cache hit.
[2023-03-21 09:16:21] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))))), (G (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0))))), (X (AND p2 (NOT p3) p0)), (X (NOT (AND p2 (NOT p3) p0))), (X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X p0), (X (NOT p0)), (X (X (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0)))))), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND p0 p2 (NOT p3))), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT p0)), (F (AND p0 (NOT p2) p1)), (F (AND p0 p2)), (F (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)) (AND p2 p3) (AND (NOT p1) p3))), (F (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))]
Knowledge based reduction with 5 factoid took 1633 ms. Reduced automaton from 3 states, 12 edges and 4 AP (stutter sensitive) to 3 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:23] [INFO ] Invariant cache hit.
[2023-03-21 09:16:23] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-21 09:16:23] [INFO ] Invariant cache hit.
[2023-03-21 09:16:23] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-21 09:16:23] [INFO ] Invariant cache hit.
[2023-03-21 09:16:24] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 495 ms. Remains : 50/50 places, 84/84 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND p0 (NOT p2) p1)))]
False Knowledge obtained : [(X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3))), (X (NOT (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3)))), (X (X (NOT (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 1057 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 192 steps, including 9 resets, run visited all 7 properties in 15 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND p0 (NOT p2) p1)))]
False Knowledge obtained : [(X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3))), (X (NOT (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3)))), (X (X (NOT (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (AND p0 p2 (NOT p3))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (OR (AND p0 (NOT p1) p3) (AND p0 p2 p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (AND p0 p2))]
Knowledge based reduction with 2 factoid took 1219 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4539 reset in 736 ms.
Product exploration explored 100000 steps with 4516 reset in 620 ms.
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:28] [INFO ] Invariant cache hit.
[2023-03-21 09:16:29] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-21 09:16:29] [INFO ] Invariant cache hit.
[2023-03-21 09:16:29] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-21 09:16:29] [INFO ] Invariant cache hit.
[2023-03-21 09:16:29] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 50/50 places, 84/84 transitions.
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-06 finished in 11808 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&&G(p1)))||G(p2)))'
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 8 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:29] [INFO ] Invariant cache hit.
[2023-03-21 09:16:29] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-21 09:16:29] [INFO ] Invariant cache hit.
[2023-03-21 09:16:29] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-21 09:16:29] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 09:16:29] [INFO ] Invariant cache hit.
[2023-03-21 09:16:29] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s24 0) (EQ s28 0) (EQ s35 0)), p2:(OR (AND (EQ s19 1) (EQ s26 1) (EQ s43 1)) (EQ s14 0) (EQ s21 0) (AND (EQ s24 1) (EQ s28 1) (EQ s35 1))), p1:...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 4516 reset in 514 ms.
Product exploration explored 100000 steps with 4533 reset in 546 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT p1)), (X p1), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
Knowledge based reduction with 5 factoid took 1418 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT p1)), (X p1), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 5 factoid took 1389 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 6 out of 50 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:34] [INFO ] Invariant cache hit.
[2023-03-21 09:16:34] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-21 09:16:34] [INFO ] Invariant cache hit.
[2023-03-21 09:16:34] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-21 09:16:34] [INFO ] Invariant cache hit.
[2023-03-21 09:16:34] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 50/50 places, 84/84 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 305 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 53 steps, including 2 resets, run visited all 3 properties in 5 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 396 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 4535 reset in 526 ms.
Product exploration explored 100000 steps with 4524 reset in 381 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 09:16:37] [INFO ] Invariant cache hit.
[2023-03-21 09:16:37] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 50/50 places, 84/84 transitions.
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:37] [INFO ] Invariant cache hit.
[2023-03-21 09:16:37] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-21 09:16:37] [INFO ] Invariant cache hit.
[2023-03-21 09:16:37] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-21 09:16:37] [INFO ] Invariant cache hit.
[2023-03-21 09:16:37] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 50/50 places, 84/84 transitions.
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-07 finished in 8276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:37] [INFO ] Invariant cache hit.
[2023-03-21 09:16:37] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-21 09:16:37] [INFO ] Invariant cache hit.
[2023-03-21 09:16:37] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-21 09:16:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 09:16:37] [INFO ] Invariant cache hit.
[2023-03-21 09:16:38] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 417 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s31 1) (EQ s35 1) (EQ s46 1)), p1:(AND (EQ s3 1) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-08 finished in 588 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(!(p0 U p1))||X(F((G(F(p0))&&p2))))))'
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:38] [INFO ] Invariant cache hit.
[2023-03-21 09:16:38] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-21 09:16:38] [INFO ] Invariant cache hit.
[2023-03-21 09:16:38] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2023-03-21 09:16:38] [INFO ] Invariant cache hit.
[2023-03-21 09:16:38] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 398 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(OR p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s28 1) (EQ s34 1)), p1:(AND (EQ s13 1) (EQ s21 1) (EQ s27 1)), p2:(AND (EQ s17 1) (EQ s23 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 42047 reset in 588 ms.
Product exploration explored 100000 steps with 42128 reset in 455 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 451 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Finished random walk after 708 steps, including 31 resets, run visited all 6 properties in 34 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND (NOT p2) p0 (NOT p1))), (F (OR p0 p1)), (F (AND (NOT p2) p1)), (F p0), (F (AND (NOT p0) p1)), (F (AND (NOT p2) p0))]
Knowledge based reduction with 2 factoid took 738 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 275 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:42] [INFO ] Invariant cache hit.
[2023-03-21 09:16:42] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-21 09:16:42] [INFO ] Invariant cache hit.
[2023-03-21 09:16:42] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-21 09:16:42] [INFO ] Invariant cache hit.
[2023-03-21 09:16:42] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 435 ms. Remains : 50/50 places, 84/84 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) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X p0), (X (NOT p0)), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 1 factoid took 482 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Finished random walk after 50 steps, including 2 resets, run visited all 6 properties in 4 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X p0), (X (NOT p0)), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (AND p0 (NOT p1) (NOT p2))), (F (OR p0 p1)), (F (AND p1 (NOT p2))), (F p0), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 1 factoid took 619 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 395 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 290 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 41869 reset in 402 ms.
Product exploration explored 100000 steps with 42076 reset in 434 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 224 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:46] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 09:16:46] [INFO ] Invariant cache hit.
[2023-03-21 09:16:46] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 50/50 places, 84/84 transitions.
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:46] [INFO ] Invariant cache hit.
[2023-03-21 09:16:46] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-21 09:16:46] [INFO ] Invariant cache hit.
[2023-03-21 09:16:46] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-21 09:16:46] [INFO ] Invariant cache hit.
[2023-03-21 09:16:46] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 50/50 places, 84/84 transitions.
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-09 finished in 8265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(F(p1)&&X(p2))))))'
Support contains 7 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:46] [INFO ] Invariant cache hit.
[2023-03-21 09:16:46] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-21 09:16:46] [INFO ] Invariant cache hit.
[2023-03-21 09:16:46] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-21 09:16:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 09:16:46] [INFO ] Invariant cache hit.
[2023-03-21 09:16:46] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s35 1) (EQ s38 1)), p1:(OR (EQ s33 0) (EQ s36 0) (EQ s39 0)), p2:(AND (EQ s34 1) (EQ s46 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]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-13 finished in 464 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(G((p0||X(G(p1)))))))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:47] [INFO ] Invariant cache hit.
[2023-03-21 09:16:47] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-21 09:16:47] [INFO ] Invariant cache hit.
[2023-03-21 09:16:47] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-21 09:16:47] [INFO ] Invariant cache hit.
[2023-03-21 09:16:47] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s19 0) (EQ s24 0)), p0:(AND (EQ s0 1) (EQ s6 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 29 steps with 1 reset in 1 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-14 finished in 447 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 7 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:47] [INFO ] Invariant cache hit.
[2023-03-21 09:16:47] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-21 09:16:47] [INFO ] Invariant cache hit.
[2023-03-21 09:16:47] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-21 09:16:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 09:16:47] [INFO ] Invariant cache hit.
[2023-03-21 09:16:47] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 303 ms. Remains : 50/50 places, 84/84 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s25 1) (EQ s28 1) (EQ s34 1)), p0:(AND (EQ s14 1) (EQ s21 1)), p2:(AND (EQ s17 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrNC5x5-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-15 finished in 483 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((X(((!p1 U (p2||G(!p1))) U ((!p3&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1)))))))||p0))))'
Found a Lengthening insensitive property : Solitaire-PT-SqrNC5x5-LTLFireability-06
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:48] [INFO ] Invariant cache hit.
[2023-03-21 09:16:48] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-21 09:16:48] [INFO ] Invariant cache hit.
[2023-03-21 09:16:48] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-21 09:16:48] [INFO ] Invariant cache hit.
[2023-03-21 09:16:48] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 264 ms. Remains : 50/50 places, 84/84 transitions.
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p3) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s2 0) (EQ s7 0) (EQ s33 0) (EQ s36 0) (EQ s39 0)), p2:(AND (NOT (AND (EQ s2 1) (EQ s7 1))) (NOT (AND (EQ s33 1) (EQ s36 1) (EQ s39 1)))), p1:(A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4535 reset in 379 ms.
Product exploration explored 100000 steps with 4532 reset in 407 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))))]
False Knowledge obtained : [(X (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0))))), (X (AND p2 (NOT p3) p0)), (X (NOT (AND p2 (NOT p3) p0))), (X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X p0), (X (NOT p0)), (X (X (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0)))))), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 960 ms. Reduced automaton from 3 states, 12 edges and 4 AP (stutter sensitive) to 3 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 456 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 09:16:50] [INFO ] Invariant cache hit.
[2023-03-21 09:16:50] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))))), (G (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0))))), (X (AND p2 (NOT p3) p0)), (X (NOT (AND p2 (NOT p3) p0))), (X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X p0), (X (NOT p0)), (X (X (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 p3) (AND p2 (NOT p0)) (AND (NOT p1) p3) (AND (NOT p1) (NOT p0)))))), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) p0)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (AND p0 p2 (NOT p3))), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT p0)), (F (AND p0 (NOT p2) p1)), (F (AND p0 p2)), (F (OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1)) (AND p2 p3) (AND (NOT p1) p3))), (F (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))]
Knowledge based reduction with 5 factoid took 1035 ms. Reduced automaton from 3 states, 12 edges and 4 AP (stutter sensitive) to 3 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:51] [INFO ] Invariant cache hit.
[2023-03-21 09:16:51] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-21 09:16:51] [INFO ] Invariant cache hit.
[2023-03-21 09:16:51] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-21 09:16:51] [INFO ] Invariant cache hit.
[2023-03-21 09:16:52] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 50/50 places, 84/84 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND p0 (NOT p2) p1)))]
False Knowledge obtained : [(X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3))), (X (NOT (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3)))), (X (X (NOT (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 644 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 77 steps, including 3 resets, run visited all 7 properties in 2 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND p0 (NOT p2) p1)))]
False Knowledge obtained : [(X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3))), (X (NOT (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3)))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3)))), (X (X (NOT (OR (AND p0 p2 p3) (AND p0 (NOT p1) p3))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (AND p0 p2 (NOT p3))), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (OR (AND p0 (NOT p1) p3) (AND p0 p2 p3))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (AND p0 p2))]
Knowledge based reduction with 2 factoid took 805 ms. Reduced automaton from 3 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4524 reset in 364 ms.
Product exploration explored 100000 steps with 4523 reset in 394 ms.
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:54] [INFO ] Invariant cache hit.
[2023-03-21 09:16:54] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-21 09:16:54] [INFO ] Invariant cache hit.
[2023-03-21 09:16:55] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-21 09:16:55] [INFO ] Invariant cache hit.
[2023-03-21 09:16:55] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 50/50 places, 84/84 transitions.
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-06 finished in 7267 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&&G(p1)))||G(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(!(p0 U p1))||X(F((G(F(p0))&&p2))))))'
Found a Shortening insensitive property : Solitaire-PT-SqrNC5x5-LTLFireability-09
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:55] [INFO ] Invariant cache hit.
[2023-03-21 09:16:55] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-21 09:16:55] [INFO ] Invariant cache hit.
[2023-03-21 09:16:55] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-21 09:16:55] [INFO ] Invariant cache hit.
[2023-03-21 09:16:55] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 243 ms. Remains : 50/50 places, 84/84 transitions.
Running random walk in product with property : Solitaire-PT-SqrNC5x5-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(OR p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s28 1) (EQ s34 1)), p1:(AND (EQ s13 1) (EQ s21 1) (EQ s27 1)), p2:(AND (EQ s17 1) (EQ s23 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 42141 reset in 268 ms.
Product exploration explored 100000 steps with 42156 reset in 293 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 393 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Finished random walk after 207 steps, including 9 resets, run visited all 6 properties in 5 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (OR p0 p1)), (X (NOT (OR p0 p1))), (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND (NOT p2) p0 (NOT p1))), (F (OR p0 p1)), (F (AND (NOT p2) p1)), (F p0), (F (AND (NOT p0) p1)), (F (AND (NOT p2) p0))]
Knowledge based reduction with 2 factoid took 495 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 193 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:16:57] [INFO ] Invariant cache hit.
[2023-03-21 09:16:58] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-21 09:16:58] [INFO ] Invariant cache hit.
[2023-03-21 09:16:58] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-21 09:16:58] [INFO ] Invariant cache hit.
[2023-03-21 09:16:58] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 50/50 places, 84/84 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) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X p0), (X (NOT p0)), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 1 factoid took 324 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Finished random walk after 973 steps, including 44 resets, run visited all 6 properties in 13 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X p0), (X (NOT p0)), (X (X (OR p0 p1))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (AND p0 (NOT p1) (NOT p2))), (F (OR p0 p1)), (F (AND p1 (NOT p2))), (F p0), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 1 factoid took 456 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 274 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 190 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 41963 reset in 246 ms.
Product exploration explored 100000 steps with 42107 reset in 264 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 182 ms :[(AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2))]
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:17:00] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 09:17:00] [INFO ] Invariant cache hit.
[2023-03-21 09:17:00] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 50/50 places, 84/84 transitions.
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-21 09:17:00] [INFO ] Invariant cache hit.
[2023-03-21 09:17:00] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-21 09:17:00] [INFO ] Invariant cache hit.
[2023-03-21 09:17:00] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-21 09:17:00] [INFO ] Invariant cache hit.
[2023-03-21 09:17:01] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 50/50 places, 84/84 transitions.
Treatment of property Solitaire-PT-SqrNC5x5-LTLFireability-09 finished in 5708 ms.
[2023-03-21 09:17:01] [INFO ] Flatten gal took : 14 ms
[2023-03-21 09:17:01] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-21 09:17:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 50 places, 84 transitions and 456 arcs took 2 ms.
Total runtime 47571 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2678/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2678/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2678/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Solitaire-PT-SqrNC5x5-LTLFireability-06
Could not compute solution for formula : Solitaire-PT-SqrNC5x5-LTLFireability-07
Could not compute solution for formula : Solitaire-PT-SqrNC5x5-LTLFireability-09

BK_STOP 1679390222836

--------------------
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
mcc2023
ltl formula name Solitaire-PT-SqrNC5x5-LTLFireability-06
ltl formula formula --ltl=/tmp/2678/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 50 places, 84 transitions and 456 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2678/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2678/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2678/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2678/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name Solitaire-PT-SqrNC5x5-LTLFireability-07
ltl formula formula --ltl=/tmp/2678/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 50 places, 84 transitions and 456 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2678/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2678/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2678/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2678/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name Solitaire-PT-SqrNC5x5-LTLFireability-09
ltl formula formula --ltl=/tmp/2678/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 50 places, 84 transitions and 456 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2678/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2678/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2678/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2678/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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="Solitaire-PT-SqrNC5x5"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Solitaire-PT-SqrNC5x5, 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 r457-smll-167912649200348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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