Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 6.1K Apr 30 00:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 30 00:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 00:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 00:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 134K May 10 09:34 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 NQueens-PT-12-LTLFireability-00
FORMULA_NAME NQueens-PT-12-LTLFireability-01
FORMULA_NAME NQueens-PT-12-LTLFireability-02
FORMULA_NAME NQueens-PT-12-LTLFireability-03
FORMULA_NAME NQueens-PT-12-LTLFireability-04
FORMULA_NAME NQueens-PT-12-LTLFireability-05
FORMULA_NAME NQueens-PT-12-LTLFireability-06
FORMULA_NAME NQueens-PT-12-LTLFireability-07
FORMULA_NAME NQueens-PT-12-LTLFireability-08
FORMULA_NAME NQueens-PT-12-LTLFireability-09
FORMULA_NAME NQueens-PT-12-LTLFireability-10
FORMULA_NAME NQueens-PT-12-LTLFireability-11
FORMULA_NAME NQueens-PT-12-LTLFireability-12
FORMULA_NAME NQueens-PT-12-LTLFireability-13
FORMULA_NAME NQueens-PT-12-LTLFireability-14
FORMULA_NAME NQueens-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652899671625

Running Version 202205111006
[2022-05-18 18:47:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 18:47:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 18:47:52] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2022-05-18 18:47:52] [INFO ] Transformed 216 places.
[2022-05-18 18:47:52] [INFO ] Transformed 144 transitions.
[2022-05-18 18:47:52] [INFO ] Parsed PT model containing 216 places and 144 transitions in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-12-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 144/144 transitions.
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 70 transition count 144
Applied a total of 144 rules in 13 ms. Remains 70 /214 variables (removed 144) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 70 cols
[2022-05-18 18:47:53] [INFO ] Computed 7 place invariants in 20 ms
[2022-05-18 18:47:53] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 144 rows 70 cols
[2022-05-18 18:47:53] [INFO ] Computed 7 place invariants in 8 ms
[2022-05-18 18:47:53] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 335 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/214 places, 144/144 transitions.
Applied a total of 0 rules in 7 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 69/214 places, 144/144 transitions.
Support contains 55 out of 69 places after structural reductions.
[2022-05-18 18:47:53] [INFO ] Flatten gal took : 41 ms
[2022-05-18 18:47:53] [INFO ] Flatten gal took : 22 ms
[2022-05-18 18:47:53] [INFO ] Input system was already deterministic with 144 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 30 properties in 14 ms. (steps per millisecond=0 )
FORMULA NQueens-PT-12-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 69 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 69 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(X(p0))&&F(p1)) U G(p1))))'
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:47:54] [INFO ] Computed 6 place invariants in 8 ms
[2022-05-18 18:47:54] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:47:54] [INFO ] Computed 6 place invariants in 13 ms
[2022-05-18 18:47:54] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [45, 46, 68]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 320 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/69 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s13 1) (GEQ s41 1) (GEQ s53 1)), p0:(AND (GEQ s8 1) (GEQ s20 1) (GEQ s34 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 3 ms.
FORMULA NQueens-PT-12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-00 finished in 716 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||p1))))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 9 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:47:54] [INFO ] Computed 6 place invariants in 9 ms
[2022-05-18 18:47:54] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:47:54] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-18 18:47:55] [INFO ] Implicit Places using invariants and state equation in 180 ms returned [46, 68]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 274 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/69 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 67/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s12 1) (GEQ s45 1) (GEQ s56 1)), p1:(AND (GEQ s9 1) (GEQ s19 1) (GEQ s36 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-01 finished in 507 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F((G(p0)||X(G(p1)))))))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:47:55] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-18 18:47:55] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:47:55] [INFO ] Computed 6 place invariants in 8 ms
[2022-05-18 18:47:55] [INFO ] Implicit Places using invariants and state equation in 178 ms returned [45, 46, 68]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 257 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/69 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s8 1) (LT s20 1) (LT s34 1) (LT s60 1)) (OR (LT s11 1) (LT s19 1) (LT s38 1) (LT s62 1))), p1:(AND (GEQ s8 1) (GEQ s20 1) (GEQ s34 1) (GEQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8983 reset in 1126 ms.
Product exploration explored 100000 steps with 8980 reset in 1129 ms.
Computed a total of 66 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 336 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-12-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-02 finished in 2999 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||((X(p0) U p0)&&X(p0)))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:47:58] [INFO ] Computed 6 place invariants in 10 ms
[2022-05-18 18:47:58] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:47:58] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-18 18:47:58] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [45, 46, 68]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 280 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/69 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s11 1) (GEQ s13 1) (GEQ s44 1) (GEQ s56 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-03 finished in 375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(p0)||p1||(X(p3)&&p2)))))'
Support contains 11 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:47:58] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-18 18:47:58] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:47:58] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-18 18:47:59] [INFO ] Implicit Places using invariants and state equation in 178 ms returned [45, 46, 68]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 264 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/69 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s18 1) (GEQ s33 1) (GEQ s55 1)), p1:(AND (GEQ s2 1) (GEQ s12 1) (GEQ s36 1) (GEQ s46 1)), p2:(AND (GEQ s11 1) (GEQ s21 1) (GEQ s36...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 5 reset in 2 ms.
FORMULA NQueens-PT-12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-04 finished in 423 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((F(p0) U p0))&&p1)))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:47:59] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-18 18:47:59] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:47:59] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-18 18:47:59] [INFO ] Implicit Places using invariants and state equation in 171 ms returned [45, 46, 68]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 255 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/69 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s13 1) (GEQ s33 1) (GEQ s45 1)), p1:(OR (LT s9 1) (LT s18 1) (LT s37 1) (LT s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 29 steps with 6 reset in 3 ms.
FORMULA NQueens-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-05 finished in 362 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(p0)) U X(!((p1 U X(p2)) U p2))))))'
Support contains 12 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:47:59] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-18 18:47:59] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:47:59] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-18 18:47:59] [INFO ] Implicit Places using invariants and state equation in 163 ms returned [45, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 250 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 67/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 354 ms :[p2, (AND (NOT p0) p2), p2, (AND (NOT p0) p2), p2, (AND (NOT p0) p2), p2, (AND (NOT p0) p2)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 6}], [{ cond=(AND p2 p0), acceptance={0, 1, 3} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0, 1, 2, 3} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=p2, acceptance={0, 1, 2, 3} source=2 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0, 3} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 2, 3} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND p2 p0), acceptance={0, 1, 3} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0, 1, 2, 3} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={3} source=3 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={2, 3} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0, 2, 3} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 3}, { cond=p2, acceptance={0, 1, 2, 3} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={2, 3} source=4 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={0, 3} source=5 dest: 1}, { cond=(AND p2 p0), acceptance={0, 1, 3} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 2, 3} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0, 1, 2, 3} source=5 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={3} source=5 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={2, 3} source=5 dest: 5}, { cond=(AND p1 p2 p0), acceptance={1, 3} source=5 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2, 3} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={0, 2, 3} source=6 dest: 2}, { cond=p2, acceptance={0, 1, 2, 3} source=6 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={2, 3} source=6 dest: 6}, { cond=(AND p1 p2), acceptance={1, 2, 3} source=6 dest: 6}, { cond=(AND p1 p2), acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={0, 1, 3} source=7 dest: 1}, { cond=(NOT p0), acceptance={0, 1, 2, 3} source=7 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=7 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=7 dest: 7}, { cond=(AND p1 p2 p0), acceptance={1, 3} source=7 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={1, 2, 3} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s20 1) (GEQ s29 1) (GEQ s55 1)), p1:(AND (GEQ s11 1) (GEQ s23 1) (GEQ s34 1) (GEQ s66 1)), p0:(AND (GEQ s1 1) (GEQ s21 1) (GEQ s26...], nbAcceptance=4, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16468 reset in 1518 ms.
Product exploration explored 100000 steps with 16577 reset in 1496 ms.
Computed a total of 67 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1 p0), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p2)))
Knowledge based reduction with 4 factoid took 1396 ms. Reduced automaton from 8 states, 40 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-12-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-06 finished in 5169 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&G(p1)&&G(p0)))))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:48:04] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-18 18:48:04] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:48:04] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-18 18:48:04] [INFO ] Implicit Places using invariants and state equation in 166 ms returned [45, 68]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 247 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 67/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s0 1) (LT s12 1) (LT s34 1) (LT s45 1)), p1:(OR (LT s9 1) (LT s17 1) (LT s38 1) (LT s59 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-07 finished in 409 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((X((G(p2)&&p1)) U X(p2))&&p0))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:48:05] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-18 18:48:05] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:48:05] [INFO ] Computed 6 place invariants in 6 ms
[2022-05-18 18:48:05] [INFO ] Implicit Places using invariants and state equation in 179 ms returned [45, 46, 68]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 269 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/69 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s7 1) (GEQ s22 1) (GEQ s31 1) (GEQ s61 1)), p2:(AND (GEQ s7 1) (GEQ s22 1) (GEQ s31 1) (GEQ s61 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-08 finished in 457 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&X((p1 U X(p2)))&&!p1))))'
Support contains 12 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:48:05] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-18 18:48:05] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:48:05] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-18 18:48:05] [INFO ] Implicit Places using invariants and state equation in 165 ms returned [45, 46, 68]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 245 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/69 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2) p1), (OR (NOT p0) (NOT p2) p1)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 0}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (GEQ s0 1) (GEQ s13 1) (GEQ s33 1) (GEQ s45 1)), p0:(AND (GEQ s4 1) (GEQ s23 1) (GEQ s27 1) (GEQ s59 1)), p2:(AND (GEQ s2 1) (GEQ s14 1) (GEQ s34 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-09 finished in 477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:48:06] [INFO ] Computed 6 place invariants in 7 ms
[2022-05-18 18:48:06] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:48:06] [INFO ] Computed 6 place invariants in 8 ms
[2022-05-18 18:48:06] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [45, 46, 68]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 279 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/69 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s12 1) (GEQ s37 1) (GEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-10 finished in 376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(F(p0)))||G(p1))))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:48:06] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-18 18:48:06] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:48:06] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-18 18:48:06] [INFO ] Implicit Places using invariants and state equation in 168 ms returned [45, 46, 68]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 263 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/69 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s17 1) (LT s31 1) (LT s51 1)), p1:(AND (GEQ s9 1) (GEQ s23 1) (GEQ s32 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22239 reset in 1528 ms.
Product exploration explored 100000 steps with 22125 reset in 1538 ms.
Computed a total of 66 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-12-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-11 finished in 3765 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(X(p1))))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:48:10] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-18 18:48:10] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 144 rows 69 cols
[2022-05-18 18:48:10] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-18 18:48:10] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [45, 46, 68]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 292 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/69 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s11 1) (LT s22 1) (LT s35 1) (LT s65 1)), p1:(AND (GEQ s3 1) (GEQ s17 1) (GEQ s32 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 34 steps with 3 reset in 1 ms.
FORMULA NQueens-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-12 finished in 510 ms.
All properties solved by simple procedures.
Total runtime 17909 ms.

BK_STOP 1652899691093

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="NQueens-PT-12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is NQueens-PT-12, 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 r132-tall-165271821500916"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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