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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 6.9K Apr 30 00:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 30 00:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 00:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 00:13 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.8K May 9 08:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K 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 349K 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-20-LTLFireability-00
FORMULA_NAME NQueens-PT-20-LTLFireability-01
FORMULA_NAME NQueens-PT-20-LTLFireability-02
FORMULA_NAME NQueens-PT-20-LTLFireability-03
FORMULA_NAME NQueens-PT-20-LTLFireability-04
FORMULA_NAME NQueens-PT-20-LTLFireability-05
FORMULA_NAME NQueens-PT-20-LTLFireability-06
FORMULA_NAME NQueens-PT-20-LTLFireability-07
FORMULA_NAME NQueens-PT-20-LTLFireability-08
FORMULA_NAME NQueens-PT-20-LTLFireability-09
FORMULA_NAME NQueens-PT-20-LTLFireability-10
FORMULA_NAME NQueens-PT-20-LTLFireability-11
FORMULA_NAME NQueens-PT-20-LTLFireability-12
FORMULA_NAME NQueens-PT-20-LTLFireability-13
FORMULA_NAME NQueens-PT-20-LTLFireability-14
FORMULA_NAME NQueens-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652903436527

Running Version 202205111006
[2022-05-18 19:50:37] [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 19:50:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 19:50:37] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2022-05-18 19:50:37] [INFO ] Transformed 520 places.
[2022-05-18 19:50:37] [INFO ] Transformed 400 transitions.
[2022-05-18 19:50:37] [INFO ] Parsed PT model containing 520 places and 400 transitions in 219 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 3 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-20-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 400/400 transitions.
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 118 transition count 400
Applied a total of 400 rules in 18 ms. Remains 118 /518 variables (removed 400) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 118 cols
[2022-05-18 19:50:38] [INFO ] Invariants computation overflowed in 64 ms
[2022-05-18 19:50:38] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 400 rows 118 cols
[2022-05-18 19:50:38] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-18 19:50:38] [INFO ] Implicit Places using invariants and state equation in 287 ms returned [40, 78, 79, 117]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 580 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/518 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 114/518 places, 400/400 transitions.
Support contains 68 out of 114 places after structural reductions.
[2022-05-18 19:50:38] [INFO ] Flatten gal took : 92 ms
[2022-05-18 19:50:38] [INFO ] Flatten gal took : 41 ms
[2022-05-18 19:50:39] [INFO ] Input system was already deterministic with 400 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 29 properties in 21 ms. (steps per millisecond=0 )
Computed a total of 114 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 114 transition count 400
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' '!(G((F(p0) U X(G(F(X(G((G(p1)||p0)))))))))'
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 13 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:39] [INFO ] Invariants computation overflowed in 36 ms
[2022-05-18 19:50:39] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:39] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-18 19:50:40] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2022-05-18 19:50:40] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:40] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-18 19:50:40] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s14 1) (GEQ s32 1) (GEQ s60 1) (GEQ s102 1)), p0:(AND (GEQ s3 1) (GEQ s30 1) (GEQ s51 1) (GEQ s89 1))], nbAcceptance=2, 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 18 steps with 0 reset in 4 ms.
FORMULA NQueens-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-00 finished in 1239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 10 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:40] [INFO ] Invariants computation overflowed in 23 ms
[2022-05-18 19:50:40] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:40] [INFO ] Invariants computation overflowed in 25 ms
[2022-05-18 19:50:41] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:41] [INFO ] Invariants computation overflowed in 23 ms
[2022-05-18 19:50:41] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-01 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 s24 1) (GEQ s65 1) (GEQ s91 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 2 ms.
FORMULA NQueens-PT-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-01 finished in 874 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p1)&&p0) U (p2 U X((F(p2)||p3)))))'
Support contains 12 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 13 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:41] [INFO ] Invariants computation overflowed in 22 ms
[2022-05-18 19:50:41] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:41] [INFO ] Invariants computation overflowed in 21 ms
[2022-05-18 19:50:42] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:42] [INFO ] Invariants computation overflowed in 17 ms
[2022-05-18 19:50:42] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NQueens-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s16 1) (GEQ s28 1) (GEQ s66 1) (GEQ s100 1)), p0:(AND (GEQ s12 1) (GEQ s34 1) (GEQ s56 1) (GEQ s102 1)), p1:(AND (GEQ s12 1) (GEQ s34 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, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 300 steps with 142 reset in 35 ms.
FORMULA NQueens-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-02 finished in 1140 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:42] [INFO ] Invariants computation overflowed in 19 ms
[2022-05-18 19:50:42] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:42] [INFO ] Invariants computation overflowed in 18 ms
[2022-05-18 19:50:43] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:43] [INFO ] Invariants computation overflowed in 21 ms
[2022-05-18 19:50:43] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s36 1) (GEQ s44 1) (GEQ s94 1)), p0:(OR (LT s1 1) (LT s25 1) (LT s54 1) (LT s82 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 38 steps with 2 reset in 4 ms.
FORMULA NQueens-PT-20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-03 finished in 963 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))||F((F((!p1 U p2))&&p1))))'
Support contains 7 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:43] [INFO ] Invariants computation overflowed in 20 ms
[2022-05-18 19:50:43] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:43] [INFO ] Invariants computation overflowed in 18 ms
[2022-05-18 19:50:44] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:44] [INFO ] Invariants computation overflowed in 25 ms
[2022-05-18 19:50:44] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : NQueens-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(OR (LT s18 1) (LT s32 1) (LT s64 1) (LT s106 1)), p2:(AND (GEQ s18 1) (GEQ s32 1) (GEQ s64 1) (GEQ s106 1)), p1:(OR (LT s18 1) (LT s39 1) (LT s57 1) (...], 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 3 ms.
FORMULA NQueens-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-04 finished in 1083 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(!F(G(p0)))) U p1)))'
Support contains 14 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:44] [INFO ] Invariants computation overflowed in 24 ms
[2022-05-18 19:50:44] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:44] [INFO ] Invariants computation overflowed in 20 ms
[2022-05-18 19:50:45] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2022-05-18 19:50:45] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:45] [INFO ] Invariants computation overflowed in 23 ms
[2022-05-18 19:50:45] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), p0, p0, (NOT p1)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s16 1) (GEQ s31 1) (GEQ s63 1) (GEQ s103 1)), p0:(OR (AND (GEQ s16 1) (GEQ s35 1) (GEQ s59 1) (GEQ s107 1)) (AND (GEQ s15 1) (GEQ s34 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 970 steps with 65 reset in 36 ms.
FORMULA NQueens-PT-20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-06 finished in 1076 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!X(p0)||G(p1)||!p2) U (F(p2)&&p3))))'
Support contains 16 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:45] [INFO ] Invariants computation overflowed in 23 ms
[2022-05-18 19:50:45] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:45] [INFO ] Invariants computation overflowed in 22 ms
[2022-05-18 19:50:46] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:46] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-18 19:50:46] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), p0, (AND (NOT p1) p0), (NOT p2), true, (NOT p1)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=1 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}, { cond=(AND p1 p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s2 1) (GEQ s32 1) (GEQ s48 1) (GEQ s90 1)), p2:(AND (GEQ s1 1) (GEQ s20 1) (GEQ s59 1) (GEQ s77 1)), p1:(AND (GEQ s11 1) (GEQ s25 1) (GEQ s64...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 4 reset in 3 ms.
FORMULA NQueens-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-07 finished in 1109 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((X((p1 U X(p2)))&&F(!p1)))))'
Support contains 10 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:46] [INFO ] Invariants computation overflowed in 20 ms
[2022-05-18 19:50:47] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:47] [INFO ] Invariants computation overflowed in 21 ms
[2022-05-18 19:50:47] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:47] [INFO ] Invariants computation overflowed in 23 ms
[2022-05-18 19:50:47] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), p1, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 6}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (LT s18 1) (LT s24 1) (LT s72 1) (LT s98 1)), p1:(AND (GEQ s11 1) (GEQ s24 1) (GEQ s65 1) (GEQ s91 1)), p2:(AND (GEQ s1 1) (GEQ s34 1) (GEQ s45 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 1 ms.
FORMULA NQueens-PT-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-08 finished in 1161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(((p1 U G((G(p3)&&p2)))&&p0)))))'
Support contains 14 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:48] [INFO ] Invariants computation overflowed in 24 ms
[2022-05-18 19:50:48] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:48] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-18 19:50:48] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2022-05-18 19:50:48] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:48] [INFO ] Invariants computation overflowed in 17 ms
[2022-05-18 19:50:48] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p3) (NOT p2) (NOT p0)), (OR (NOT p3) (NOT p2) (NOT p0)), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : NQueens-PT-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1)) (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) p0 p1) (AND p0 (NOT p2) p1)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p0 p2 p1), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p3) p0 p1) (AND p0 (NOT p2) p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p3 p0 p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 1}, { cond=(AND p3 p2 p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p2) p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=3 dest: 1}, { cond=(AND p3 p0 p2 p1), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p3) p0 p1) (AND p0 (NOT p2) p1)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p3 (NOT p0) p2) (AND p3 p2 (NOT p1))), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s17 1) (GEQ s28 1) (GEQ s67 1) (GEQ s101 1)), p1:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s66 1) (GEQ s94 1)), p0:(AND (GEQ s17 1) (GEQ s21 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-10 finished in 988 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(G(p0))))))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:49] [INFO ] Invariants computation overflowed in 23 ms
[2022-05-18 19:50:49] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:49] [INFO ] Invariants computation overflowed in 20 ms
[2022-05-18 19:50:49] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2022-05-18 19:50:49] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:49] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-18 19:50:49] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s32 1) (GEQ s59 1) (GEQ s101 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 18 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-12 finished in 860 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:49] [INFO ] Invariants computation overflowed in 25 ms
[2022-05-18 19:50:50] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:50] [INFO ] Invariants computation overflowed in 25 ms
[2022-05-18 19:50:50] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2022-05-18 19:50:50] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:50] [INFO ] Invariants computation overflowed in 21 ms
[2022-05-18 19:50:50] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s24 1) (GEQ s70 1) (GEQ s96 1) (OR (LT s14 1) (LT s20 1) (LT s72 1) (LT s90 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-13 finished in 811 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:50] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-18 19:50:50] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:50] [INFO ] Invariants computation overflowed in 21 ms
[2022-05-18 19:50:51] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2022-05-18 19:50:51] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:50:51] [INFO ] Invariants computation overflowed in 22 ms
[2022-05-18 19:50:51] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s12 1) (LT s37 1) (LT s53 1) (LT s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15886 reset in 4224 ms.
Product exploration explored 100000 steps with 15785 reset in 4233 ms.
Computed a total of 114 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 114 transition count 400
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 : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-20-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-20-LTLFireability-14 finished in 9774 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(F(((X(p0) U G(p1))||p0))))&&!p0)))'
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:51:00] [INFO ] Invariants computation overflowed in 23 ms
[2022-05-18 19:51:00] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:51:00] [INFO ] Invariants computation overflowed in 22 ms
[2022-05-18 19:51:01] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2022-05-18 19:51:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2022-05-18 19:51:01] [INFO ] Invariants computation overflowed in 19 ms
[2022-05-18 19:51:01] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s38 1) (GEQ s59 1) (GEQ s113 1)), p1:(AND (GEQ s1 1) (GEQ s22 1) (GEQ s57 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-15 finished in 858 ms.
All properties solved by simple procedures.
Total runtime 23666 ms.

BK_STOP 1652903461742

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

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