About the Execution of ITS-Tools for NQueens-PT-25
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 305.247 | 68544.00 | 75208.00 | 1996.60 | FTTFTFFFFTFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127200061.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NQueens-PT-25, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127200061
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 06:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 27 06:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 07:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 07:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 534K May 5 16:51 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-25-00
FORMULA_NAME NQueens-PT-25-01
FORMULA_NAME NQueens-PT-25-02
FORMULA_NAME NQueens-PT-25-03
FORMULA_NAME NQueens-PT-25-04
FORMULA_NAME NQueens-PT-25-05
FORMULA_NAME NQueens-PT-25-06
FORMULA_NAME NQueens-PT-25-07
FORMULA_NAME NQueens-PT-25-08
FORMULA_NAME NQueens-PT-25-09
FORMULA_NAME NQueens-PT-25-10
FORMULA_NAME NQueens-PT-25-11
FORMULA_NAME NQueens-PT-25-12
FORMULA_NAME NQueens-PT-25-13
FORMULA_NAME NQueens-PT-25-14
FORMULA_NAME NQueens-PT-25-15
=== Now, execution of the tool begins
BK_START 1620924322152
Running Version 0
[2021-05-13 16:45:23] [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]
[2021-05-13 16:45:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 16:45:23] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2021-05-13 16:45:23] [INFO ] Transformed 775 places.
[2021-05-13 16:45:23] [INFO ] Transformed 625 transitions.
[2021-05-13 16:45:23] [INFO ] Parsed PT model containing 775 places and 625 transitions in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 16:45:23] [INFO ] Initial state test concluded for 3 properties.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-25-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-25-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 773 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 773/773 places, 625/625 transitions.
Reduce places removed 625 places and 0 transitions.
Iterating post reduction 0 with 625 rules applied. Total rules applied 625 place count 148 transition count 625
Applied a total of 625 rules in 23 ms. Remains 148 /773 variables (removed 625) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 148 cols
[2021-05-13 16:45:24] [INFO ] Invariants computation overflowed in 97 ms
[2021-05-13 16:45:24] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 625 rows 148 cols
[2021-05-13 16:45:24] [INFO ] Invariants computation overflowed in 77 ms
[2021-05-13 16:45:24] [INFO ] Implicit Places using invariants and state equation in 508 ms returned [50, 98, 147]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 812 ms to find 3 implicit places.
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:45:24] [INFO ] Invariants computation overflowed in 53 ms
[2021-05-13 16:45:25] [INFO ] Dead Transitions using invariants and state equation in 281 ms returned []
Starting structural reductions, iteration 1 : 145/773 places, 625/625 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:45:25] [INFO ] Invariants computation overflowed in 45 ms
[2021-05-13 16:45:25] [INFO ] Dead Transitions using invariants and state equation in 241 ms returned []
Finished structural reductions, in 2 iterations. Remains : 145/773 places, 625/625 transitions.
[2021-05-13 16:45:25] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-13 16:45:25] [INFO ] Flatten gal took : 98 ms
FORMULA NQueens-PT-25-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-25-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-25-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 16:45:25] [INFO ] Flatten gal took : 67 ms
[2021-05-13 16:45:25] [INFO ] Input system was already deterministic with 625 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 20 properties in 4 ms. (steps per millisecond=4 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((G(F(p0))||(F(p0)&&F(G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 625/625 transitions.
Applied a total of 0 rules in 11 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:45:25] [INFO ] Invariants computation overflowed in 45 ms
[2021-05-13 16:45:26] [INFO ] Implicit Places using invariants in 188 ms returned []
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:45:26] [INFO ] Invariants computation overflowed in 44 ms
[2021-05-13 16:45:26] [INFO ] Implicit Places using invariants and state equation in 828 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1019 ms to find 1 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:45:26] [INFO ] Invariants computation overflowed in 43 ms
[2021-05-13 16:45:27] [INFO ] Dead Transitions using invariants and state equation in 235 ms returned []
Starting structural reductions, iteration 1 : 144/145 places, 625/625 transitions.
Applied a total of 0 rules in 18 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:45:27] [INFO ] Invariants computation overflowed in 44 ms
[2021-05-13 16:45:27] [INFO ] Dead Transitions using invariants and state equation in 252 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/145 places, 625/625 transitions.
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-25-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s18 1) (LT s40 1) (LT s76 1) (LT s129 1)), p1:(OR (LT s21 1) (LT s32 1) (LT s87 1) (LT s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5728 reset in 4938 ms.
Product exploration explored 100000 steps with 5706 reset in 4928 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
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 : [(F (G p0)), (F (G p1)), (NOT p0), (NOT p1)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA NQueens-PT-25-01 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-25-01 finished in 11861 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 625/625 transitions.
Applied a total of 0 rules in 13 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:45:37] [INFO ] Invariants computation overflowed in 41 ms
[2021-05-13 16:45:37] [INFO ] Implicit Places using invariants in 194 ms returned []
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:45:37] [INFO ] Invariants computation overflowed in 49 ms
[2021-05-13 16:45:38] [INFO ] Implicit Places using invariants and state equation in 881 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1081 ms to find 1 implicit places.
[2021-05-13 16:45:38] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:45:38] [INFO ] Invariants computation overflowed in 41 ms
[2021-05-13 16:45:39] [INFO ] Dead Transitions using invariants and state equation in 260 ms returned []
Starting structural reductions, iteration 1 : 144/145 places, 625/625 transitions.
Applied a total of 0 rules in 8 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
[2021-05-13 16:45:39] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:45:39] [INFO ] Invariants computation overflowed in 42 ms
[2021-05-13 16:45:39] [INFO ] Dead Transitions using invariants and state equation in 262 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/145 places, 625/625 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s44 1) (GEQ s64 1) (GEQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-25-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-03 finished in 1748 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((G(p0) U (F(p1) U p2)))))], workingDir=/home/mcc/execution]
Support contains 12 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 625/625 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:45:39] [INFO ] Invariants computation overflowed in 44 ms
[2021-05-13 16:45:39] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:45:39] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-13 16:45:40] [INFO ] Implicit Places using invariants and state equation in 826 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1030 ms to find 1 implicit places.
[2021-05-13 16:45:40] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:45:40] [INFO ] Invariants computation overflowed in 39 ms
[2021-05-13 16:45:40] [INFO ] Dead Transitions using invariants and state equation in 248 ms returned []
Starting structural reductions, iteration 1 : 144/145 places, 625/625 transitions.
Applied a total of 0 rules in 11 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
[2021-05-13 16:45:40] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:45:40] [INFO ] Invariants computation overflowed in 50 ms
[2021-05-13 16:45:41] [INFO ] Dead Transitions using invariants and state equation in 278 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/145 places, 625/625 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NQueens-PT-25-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 5}, { cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s23 1) (GEQ s42 1) (GEQ s79 1) (GEQ s136 1)), p0:(OR (LT s12 1) (LT s47 1) (LT s63 1) (LT s130 1)), p1:(AND (GEQ s9 1) (GEQ s40 1) (GEQ s67 1) (GEQ s120 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 438 steps with 18 reset in 21 ms.
FORMULA NQueens-PT-25-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-05 finished in 1809 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0)) U G((X(p1)&&(p2||G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 12 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 625/625 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:45:41] [INFO ] Invariants computation overflowed in 42 ms
[2021-05-13 16:45:41] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:45:41] [INFO ] Invariants computation overflowed in 41 ms
[2021-05-13 16:45:42] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:45:42] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-13 16:45:42] [INFO ] Dead Transitions using invariants and state equation in 238 ms returned []
Finished structural reductions, in 1 iterations. Remains : 145/145 places, 625/625 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-25-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR p2 p0), acceptance={0} source=1 dest: 1}, { cond=(OR p2 p0), acceptance={0, 1} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={1} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={1} source=4 dest: 4}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 p0), acceptance={1} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=5 dest: 5}, { cond=p0, acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=6 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s25 1) (GEQ s73 1) (GEQ s97 1)), p0:(AND (GEQ s8 1) (GEQ s43 1) (GEQ s63 1) (GEQ s123 1)), p1:(AND (GEQ s7 1) (GEQ s35 1) (GEQ s70 1) (GEQ s114 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 1 reset in 2 ms.
FORMULA NQueens-PT-25-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-07 finished in 1457 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 8 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 625/625 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:45:42] [INFO ] Invariants computation overflowed in 44 ms
[2021-05-13 16:45:42] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:45:42] [INFO ] Invariants computation overflowed in 42 ms
[2021-05-13 16:45:43] [INFO ] Implicit Places using invariants and state equation in 806 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 986 ms to find 1 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:45:43] [INFO ] Invariants computation overflowed in 45 ms
[2021-05-13 16:45:43] [INFO ] Dead Transitions using invariants and state equation in 236 ms returned []
Starting structural reductions, iteration 1 : 144/145 places, 625/625 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:45:43] [INFO ] Invariants computation overflowed in 38 ms
[2021-05-13 16:45:44] [INFO ] Dead Transitions using invariants and state equation in 238 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/145 places, 625/625 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-08 automaton TGBA [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 s13 1) (GEQ s49 1) (GEQ s62 1) (GEQ s133 1) (GEQ s12 1) (GEQ s44 1) (GEQ s66 1) (GEQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-25-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-08 finished in 1553 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 625/625 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:45:44] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-13 16:45:44] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:45:44] [INFO ] Invariants computation overflowed in 42 ms
[2021-05-13 16:45:45] [INFO ] Implicit Places using invariants and state equation in 866 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1058 ms to find 1 implicit places.
[2021-05-13 16:45:45] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:45:45] [INFO ] Invariants computation overflowed in 42 ms
[2021-05-13 16:45:45] [INFO ] Dead Transitions using invariants and state equation in 239 ms returned []
Starting structural reductions, iteration 1 : 144/145 places, 625/625 transitions.
Applied a total of 0 rules in 14 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
[2021-05-13 16:45:45] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:45:45] [INFO ] Invariants computation overflowed in 38 ms
[2021-05-13 16:45:45] [INFO ] Dead Transitions using invariants and state equation in 239 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/145 places, 625/625 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-25-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s40 1) (LT s65 1) (LT s118 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 14246 reset in 7579 ms.
Product exploration explored 100000 steps with 14149 reset in 7588 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
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 : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA NQueens-PT-25-09 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-25-09 finished in 16894 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((G(p0)||F(p1)) U G(p2))))], workingDir=/home/mcc/execution]
Support contains 14 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 625/625 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:46:01] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-13 16:46:01] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:46:01] [INFO ] Invariants computation overflowed in 42 ms
[2021-05-13 16:46:02] [INFO ] Implicit Places using invariants and state equation in 791 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 965 ms to find 1 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:46:02] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-13 16:46:02] [INFO ] Dead Transitions using invariants and state equation in 231 ms returned []
Starting structural reductions, iteration 1 : 144/145 places, 625/625 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:46:02] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-13 16:46:02] [INFO ] Dead Transitions using invariants and state equation in 228 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/145 places, 625/625 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : NQueens-PT-25-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s24 1) (LT s26 1) (LT s96 1) (LT s121 1) (LT s17 1) (LT s33 1) (LT s82 1)), p0:(OR (LT s5 1) (LT s40 1) (LT s63 1) (LT s116 1)), p1:(AND (GEQ s15 1) (GEQ s30 1) (GEQ s83 1) (GEQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 148 steps with 6 reset in 7 ms.
FORMULA NQueens-PT-25-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-10 finished in 1570 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 625/625 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:46:02] [INFO ] Invariants computation overflowed in 54 ms
[2021-05-13 16:46:02] [INFO ] Implicit Places using invariants in 194 ms returned []
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:46:02] [INFO ] Invariants computation overflowed in 39 ms
[2021-05-13 16:46:03] [INFO ] Implicit Places using invariants and state equation in 845 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1041 ms to find 1 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:46:03] [INFO ] Invariants computation overflowed in 38 ms
[2021-05-13 16:46:03] [INFO ] Dead Transitions using invariants and state equation in 235 ms returned []
Starting structural reductions, iteration 1 : 144/145 places, 625/625 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:46:04] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-13 16:46:04] [INFO ] Dead Transitions using invariants and state equation in 237 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/145 places, 625/625 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s20 1) (LT s28 1) (LT s90 1) (LT s119 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 13651 reset in 7464 ms.
Product exploration explored 100000 steps with 13625 reset in 7514 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
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 : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA NQueens-PT-25-12 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-25-12 finished in 16698 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(p1)))], workingDir=/home/mcc/execution]
Support contains 8 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 625/625 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:46:19] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-13 16:46:19] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:46:19] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-13 16:46:20] [INFO ] Implicit Places using invariants and state equation in 834 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1014 ms to find 1 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:46:20] [INFO ] Invariants computation overflowed in 38 ms
[2021-05-13 16:46:20] [INFO ] Dead Transitions using invariants and state equation in 228 ms returned []
Starting structural reductions, iteration 1 : 144/145 places, 625/625 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:46:20] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-13 16:46:20] [INFO ] Dead Transitions using invariants and state equation in 229 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/145 places, 625/625 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (LT s21 1) (LT s48 1) (LT s71 1) (LT s140 1)), p0:(AND (GEQ s20 1) (GEQ s31 1) (GEQ s87 1) (GEQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 4 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-25-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-13 finished in 1579 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 625/625 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:46:21] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-13 16:46:21] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:46:21] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-13 16:46:21] [INFO ] Implicit Places using invariants and state equation in 841 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1035 ms to find 1 implicit places.
[2021-05-13 16:46:22] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:46:22] [INFO ] Invariants computation overflowed in 43 ms
[2021-05-13 16:46:22] [INFO ] Dead Transitions using invariants and state equation in 260 ms returned []
Starting structural reductions, iteration 1 : 144/145 places, 625/625 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
[2021-05-13 16:46:22] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:46:22] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-13 16:46:22] [INFO ] Dead Transitions using invariants and state equation in 237 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/145 places, 625/625 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-25-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s32 1) (GEQ s68 1) (GEQ s105 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 23 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-25-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-14 finished in 1599 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 145 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 145/145 places, 625/625 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:46:22] [INFO ] Invariants computation overflowed in 42 ms
[2021-05-13 16:46:22] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 625 rows 145 cols
[2021-05-13 16:46:22] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-13 16:46:23] [INFO ] Implicit Places using invariants and state equation in 806 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 985 ms to find 1 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:46:23] [INFO ] Invariants computation overflowed in 38 ms
[2021-05-13 16:46:23] [INFO ] Dead Transitions using invariants and state equation in 224 ms returned []
Starting structural reductions, iteration 1 : 144/145 places, 625/625 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2021-05-13 16:46:23] [INFO ] Invariants computation overflowed in 38 ms
[2021-05-13 16:46:24] [INFO ] Dead Transitions using invariants and state equation in 228 ms returned []
Finished structural reductions, in 2 iterations. Remains : 144/145 places, 625/625 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NQueens-PT-25-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s17 1) (LT s32 1) (LT s83 1) (LT s120 1)), p1:(OR (LT s20 1) (LT s48 1) (LT s70 1) (LT s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-25-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-15 finished in 1539 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620924390696
--------------------
content from stderr:
+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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-25"
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-25, 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 r140-tall-162089127200061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-25.tgz
mv NQueens-PT-25 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 '
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 ;