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-165271821500892.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-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821500892
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 7.4K Apr 30 00:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 00:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 00:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 30 00:06 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.4K May 9 08:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:18 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 30K 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-05-LTLFireability-00
FORMULA_NAME NQueens-PT-05-LTLFireability-01
FORMULA_NAME NQueens-PT-05-LTLFireability-02
FORMULA_NAME NQueens-PT-05-LTLFireability-03
FORMULA_NAME NQueens-PT-05-LTLFireability-04
FORMULA_NAME NQueens-PT-05-LTLFireability-05
FORMULA_NAME NQueens-PT-05-LTLFireability-06
FORMULA_NAME NQueens-PT-05-LTLFireability-07
FORMULA_NAME NQueens-PT-05-LTLFireability-08
FORMULA_NAME NQueens-PT-05-LTLFireability-09
FORMULA_NAME NQueens-PT-05-LTLFireability-10
FORMULA_NAME NQueens-PT-05-LTLFireability-11
FORMULA_NAME NQueens-PT-05-LTLFireability-12
FORMULA_NAME NQueens-PT-05-LTLFireability-13
FORMULA_NAME NQueens-PT-05-LTLFireability-14
FORMULA_NAME NQueens-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652897521711

Running Version 202205111006
[2022-05-18 18:12:02] [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:12:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 18:12:03] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2022-05-18 18:12:03] [INFO ] Transformed 55 places.
[2022-05-18 18:12:03] [INFO ] Transformed 25 transitions.
[2022-05-18 18:12:03] [INFO ] Parsed PT model containing 55 places and 25 transitions in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-05-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 25/25 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 28 transition count 25
Applied a total of 25 rules in 10 ms. Remains 28 /53 variables (removed 25) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 28 cols
[2022-05-18 18:12:03] [INFO ] Computed 7 place invariants in 9 ms
[2022-05-18 18:12:03] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 25 rows 28 cols
[2022-05-18 18:12:03] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-18 18:12:03] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 228 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/53 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 27/53 places, 25/25 transitions.
Support contains 26 out of 27 places after structural reductions.
[2022-05-18 18:12:03] [INFO ] Flatten gal took : 20 ms
[2022-05-18 18:12:03] [INFO ] Flatten gal took : 8 ms
[2022-05-18 18:12:03] [INFO ] Input system was already deterministic with 25 transitions.
Incomplete random walk after 10000 steps, including 1870 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10001 steps, including 212 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:03] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-18 18:12:03] [INFO ] After 42ms 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.
FORMULA NQueens-PT-05-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 27 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 25
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' '!(F(X((!(false U (X(p0)||p1))||F(p2)))))'
Support contains 10 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:04] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-18 18:12:04] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:04] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-18 18:12:04] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [17, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 115 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 25/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p0 (NOT p2))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (LT s2 1) (LT s7 1) (LT s13 1) (LT s21 1)), p1:(AND (GEQ s2 1) (GEQ s9 1) (GEQ s11 1) (GEQ s23 1)), p0:(AND (GEQ s0 1) (GEQ s5 1) (GEQ s13 1) (GEQ ...], 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]]
Product exploration explored 100000 steps with 41619 reset in 364 ms.
Product exploration explored 100000 steps with 41560 reset in 307 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 25
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 p2) p1 p0), (X (X (NOT (AND (NOT p2) p1 p0)))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 5 factoid took 333 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-05-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-01 finished in 1596 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:05] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-18 18:12:05] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:05] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-18 18:12:05] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [17, 18, 26]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 97 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s4 1) (GEQ s7 1) (GEQ s15 1) (GEQ s22 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 0 ms.
FORMULA NQueens-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-02 finished in 229 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(G(X(p1)))||G(p2)||p0))))'
Support contains 12 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 6 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:06] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-18 18:12:06] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:06] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-18 18:12:06] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [17, 18, 26]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 90 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 16 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(OR (LT s0 1) (LT s6 1) (LT s12 1) (LT s17 1)), p0:(OR (LT s3 1) (LT s7 1) (LT s14 1) (LT s21 1)), p1:(OR (LT s1 1) (LT s8 1) (LT s11 1) (LT s20 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 26031 reset in 337 ms.
Product exploration explored 100000 steps with 26001 reset in 267 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
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 p2) (NOT p0) (NOT p1)), (F (G p2)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1))))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 4 factoid took 407 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-05-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-03 finished in 1254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:07] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-18 18:12:07] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:07] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-18 18:12:07] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [17, 18, 26]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 115 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-05 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 (GEQ s3 1) (GEQ s7 1) (GEQ s14 1) (GEQ s21 1)), p1:(AND (GEQ s2 1) (GEQ s6 1) (GEQ s14 1) (GEQ s19 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 5 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-05 finished in 251 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(F(X(F(p2))))||p1))||p0)))'
Support contains 10 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:07] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-18 18:12:07] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:07] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-18 18:12:07] [INFO ] Implicit Places using invariants and state equation in 44 ms returned [17, 18, 26]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 82 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, 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=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s9 1) (LT s10 1) (LT s21 1)), p1:(OR (AND (GEQ s3 1) (GEQ s8 1) (GEQ s13 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s11 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 20063 reset in 272 ms.
Product exploration explored 100000 steps with 20043 reset in 224 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
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 (NOT p2)), true, (F (G p0)), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 5 factoid took 437 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-05-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-06 finished in 1216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((X(p1)&&p0)))))'
Support contains 8 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:08] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-18 18:12:08] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:08] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-18 18:12:08] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [18, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 128 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 25/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 39 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s9 1) (GEQ s10 1) (GEQ s22 1)), p1:(AND (GEQ s4 1) (GEQ s5 1) (GEQ s17 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-07 finished in 182 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((X((!p1 U G(p2)))||p0))))))'
Support contains 11 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:09] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-18 18:12:09] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:09] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-18 18:12:09] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [18, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 94 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 25/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={1} source=1 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s8 1) (LT s12 1) (LT s22 1)), p2:(AND (GEQ s4 1) (GEQ s5 1) (GEQ s17 1) (GEQ s21 1)), p1:(AND (GEQ s3 1) (GEQ s5 1) (GEQ s16 1) (GEQ ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 18772 reset in 225 ms.
Product exploration explored 100000 steps with 18745 reset in 259 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 25
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) p2 p1), true, (X (X (NOT (AND (NOT p0) p2)))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 6 factoid took 660 ms. Reduced automaton from 3 states, 12 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-05-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-08 finished in 1428 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(((X(p2)&&p1)||X(p2)))||p0))))'
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:10] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-18 18:12:10] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:10] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-18 18:12:10] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [17, 18, 26]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 91 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s7 1) (LT s15 1) (LT s22 1)), p2:(OR (LT s2 1) (LT s9 1) (LT s11 1) (LT s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23567 reset in 207 ms.
Product exploration explored 100000 steps with 23653 reset in 211 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
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) (NOT p2)), (F (G p0)), (F (G p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-05-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-09 finished in 851 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((X(p0) U !p1)))||G(p0))))'
Support contains 8 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:11] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-18 18:12:11] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:11] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-18 18:12:11] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [17, 18, 26]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 84 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 136 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, 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=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (LT s2 1) (LT s7 1) (LT s13 1) (LT s20 1)), p0:(AND (GEQ s4 1) (GEQ s8 1) (GEQ s14 1) (GEQ s23 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]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-11 finished in 233 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(p0))&&(G(X(G(p1)))||p1))))'
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:11] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-18 18:12:11] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:11] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-18 18:12:11] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [17, 18, 26]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 77 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 24/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s2 1) (GEQ s8 1) (GEQ s12 1) (GEQ s21 1)), p0:(AND (GEQ s3 1) (GEQ s9 1) (GEQ s12 1) (GEQ s23 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]]
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 1 ms.
FORMULA NQueens-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-12 finished in 227 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(G(p1))&&X(p2)&&!p1)))'
Support contains 10 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:11] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-18 18:12:11] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:11] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-18 18:12:11] [INFO ] Implicit Places using invariants and state equation in 42 ms returned [18, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 74 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 25/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, true, true, (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s4 1) (GEQ s7 1) (GEQ s15 1) (GEQ s23 1)), p0:(OR (LT s4 1) (LT s5 1) (LT s17 1) (LT s21 1)), p2:(AND (GEQ s1 1) (GEQ s5 1) (GEQ s14 1) (GEQ ...], 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 1 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-14 finished in 256 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U F((X(F(p0))&&F(p0)&&p1))))'
Support contains 8 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:11] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-18 18:12:12] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 25 rows 27 cols
[2022-05-18 18:12:12] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-18 18:12:12] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [17, 18]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 85 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 25/27 places, 25/25 transitions.
Stuttering acceptance computed with spot in 55 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s9 1) (GEQ s13 1) (GEQ s24 1)), p0:(AND (GEQ s3 1) (GEQ s7 1) (GEQ s14 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-15 finished in 151 ms.
All properties solved by simple procedures.
Total runtime 9204 ms.

BK_STOP 1652897532518

--------------------
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-05"
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-05, 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-165271821500892"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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