About the Execution of ITS-Tools for NQueens-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 321.903 | 12487.00 | 19648.00 | 503.30 | TTFFFFFTFFFFFFFF | 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-162089127100021.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-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127100021
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K 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.2K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 06:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 07:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 07:18 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 65K 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-08-00
FORMULA_NAME NQueens-PT-08-01
FORMULA_NAME NQueens-PT-08-02
FORMULA_NAME NQueens-PT-08-03
FORMULA_NAME NQueens-PT-08-04
FORMULA_NAME NQueens-PT-08-05
FORMULA_NAME NQueens-PT-08-06
FORMULA_NAME NQueens-PT-08-07
FORMULA_NAME NQueens-PT-08-08
FORMULA_NAME NQueens-PT-08-09
FORMULA_NAME NQueens-PT-08-10
FORMULA_NAME NQueens-PT-08-11
FORMULA_NAME NQueens-PT-08-12
FORMULA_NAME NQueens-PT-08-13
FORMULA_NAME NQueens-PT-08-14
FORMULA_NAME NQueens-PT-08-15
=== Now, execution of the tool begins
BK_START 1620916164275
Running Version 0
[2021-05-13 14:29:25] [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 14:29:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 14:29:25] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-13 14:29:25] [INFO ] Transformed 112 places.
[2021-05-13 14:29:25] [INFO ] Transformed 64 transitions.
[2021-05-13 14:29:25] [INFO ] Parsed PT model containing 112 places and 64 transitions in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 14:29:25] [INFO ] Initial state test concluded for 3 properties.
Reduce places removed 2 places and 0 transitions.
Support contains 41 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 46 transition count 64
Applied a total of 64 rules in 11 ms. Remains 46 /110 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 46 cols
[2021-05-13 14:29:26] [INFO ] Computed 7 place invariants in 20 ms
[2021-05-13 14:29:26] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 64 rows 46 cols
[2021-05-13 14:29:26] [INFO ] Computed 7 place invariants in 16 ms
[2021-05-13 14:29:26] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [30, 31, 45]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 232 ms to find 3 implicit places.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:26] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 14:29:26] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 43/110 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:26] [INFO ] Computed 4 place invariants in 6 ms
[2021-05-13 14:29:26] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 43/110 places, 64/64 transitions.
[2021-05-13 14:29:26] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-13 14:29:26] [INFO ] Flatten gal took : 32 ms
FORMULA NQueens-PT-08-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 14:29:26] [INFO ] Flatten gal took : 11 ms
[2021-05-13 14:29:26] [INFO ] Input system was already deterministic with 64 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 27 properties in 2 ms. (steps per millisecond=3 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0 U (G(p0)||(p0&&G(p1))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:26] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-13 14:29:26] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:26] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 14:29:26] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 152 ms to find 1 implicit places.
[2021-05-13 14:29:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:26] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-13 14:29:26] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 42/43 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2021-05-13 14:29:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:26] [INFO ] Computed 3 place invariants in 9 ms
[2021-05-13 14:29:26] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/43 places, 64/64 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-08-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s12 1) (LT s18 1) (LT s32 1)), p0:(OR (LT s1 1) (LT s13 1) (LT s18 1) (LT s34 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13150 reset in 607 ms.
Product exploration explored 100000 steps with 13169 reset in 580 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 42 transition count 64
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 p1)), (F (G p0)), (NOT p1), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA NQueens-PT-08-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-08-00 finished in 1779 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(p1)))], workingDir=/home/mcc/execution]
Support contains 8 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:28] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 14:29:28] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:28] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:28] [INFO ] Implicit Places using invariants and state equation in 85 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 132 ms to find 1 implicit places.
[2021-05-13 14:29:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:28] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:29:28] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 42/43 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2021-05-13 14:29:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:28] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:29:28] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/43 places, 64/64 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-08-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(OR (LT s5 1) (LT s8 1) (LT s27 1) (LT s33 1)), p0:(AND (GEQ s0 1) (GEQ s10 1) (GEQ s20 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 28570 reset in 705 ms.
Product exploration explored 100000 steps with 28714 reset in 693 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 42 transition count 64
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 p1)), (F (G (NOT p0))), (NOT p1), p0]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA NQueens-PT-08-01 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-08-01 finished in 1727 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((p0 U ((G(p2)&&p1)||G(p0)))||(p3&&X(p4))))))], workingDir=/home/mcc/execution]
Support contains 13 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:30] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:30] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:30] [INFO ] Computed 4 place invariants in 9 ms
[2021-05-13 14:29:30] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 95 ms to find 1 implicit places.
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:30] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-13 14:29:30] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 42/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:30] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:29:30] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/43 places, 64/64 transitions.
Stuttering acceptance computed with spot in 441 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), true, (NOT p2), (OR (AND p1 p2 (NOT p4)) (AND p3 (NOT p4)) (AND p0 (NOT p4))), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p0) (NOT p2) p3 (NOT p4)), (AND (NOT p0) (NOT p2) p3), (OR (AND (NOT p0) (NOT p1) p3 (NOT p4)) (AND (NOT p0) (NOT p2) p3 (NOT p4))), (OR (AND (NOT p2) p3 (NOT p4)) (AND p0 (NOT p2) (NOT p4)))]
Running random walk in product with property : NQueens-PT-08-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p3 (AND p1 p2) p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p1 p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p3 (NOT p1) (NOT p0)) (AND p3 (NOT p2) (NOT p0))), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=1 dest: 5}, { cond=(AND p3 p1 p2 p0), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p3) p1 p2 p0), acceptance={} source=1 dest: 7}, { cond=(OR (AND p3 (NOT p1) p0) (AND p3 (NOT p2) p0)), acceptance={} source=1 dest: 8}, { cond=(AND p3 p1 p2 (NOT p0)), acceptance={} source=1 dest: 9}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND p3 (NOT p4)) (AND p1 p2 (NOT p4)) (AND p0 (NOT p4))), acceptance={} source=4 dest: 2}], [{ cond=(OR (AND p3 (NOT p1) (NOT p0)) (AND p3 (NOT p2) (NOT p0))), acceptance={} source=5 dest: 2}, { cond=(AND p3 p1 p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(OR (AND p3 (NOT p1) p0) (AND p3 (NOT p2) p0)), acceptance={} source=5 dest: 5}, { cond=(AND p3 p1 p2 p0), acceptance={} source=5 dest: 7}], [{ cond=(AND p3 (NOT p2) (NOT p0) (NOT p4)), acceptance={} source=6 dest: 2}, { cond=(OR (AND p3 p2 (NOT p0) (NOT p4)) (AND (NOT p1) p2 (NOT p0) (NOT p4))), acceptance={} source=6 dest: 3}, { cond=(AND p3 (NOT p2) p0 (NOT p4)), acceptance={} source=6 dest: 5}, { cond=(OR (AND p3 p2 p0 (NOT p4)) (AND (NOT p1) p2 p0 (NOT p4))), acceptance={} source=6 dest: 7}], [{ cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(OR (AND p3 p2 (NOT p0)) (AND (NOT p1) p2 (NOT p0))), acceptance={} source=7 dest: 3}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=7 dest: 5}, { cond=(OR (AND p3 p2 p0) (AND (NOT p1) p2 p0)), acceptance={} source=7 dest: 7}], [{ cond=(OR (AND p3 (NOT p1) (NOT p0) (NOT p4)) (AND p3 (NOT p2) (NOT p0) (NOT p4))), acceptance={} source=8 dest: 2}, { cond=(AND p3 p1 p2 (NOT p0) (NOT p4)), acceptance={} source=8 dest: 3}, { cond=(OR (AND p3 (NOT p1) p0 (NOT p4)) (AND p3 (NOT p2) p0 (NOT p4))), acceptance={} source=8 dest: 5}, { cond=(AND p3 p1 p2 p0 (NOT p4)), acceptance={} source=8 dest: 7}], [{ cond=(OR (AND p3 (NOT p2) (NOT p4)) (AND (NOT p2) p0 (NOT p4))), acceptance={} source=9 dest: 2}, { cond=(OR (AND p3 p2 (NOT p4)) (AND (NOT p1) p2 (NOT p4)) (AND p2 p0 (NOT p4))), acceptance={} source=9 dest: 3}]], initial=0, aps=[p3:(OR (LT s6 1) (LT s15 1) (LT s21 1) (LT s41 1)), p1:(AND (GEQ s3 1) (GEQ s13 1) (GEQ s20 1) (GEQ s36 1)), p2:(AND (GEQ s2 1) (GEQ s13 1) (GEQ s19 1) (GEQ s35 1)), p0:(AND (GEQ s3 1) (GEQ s13 1) (GEQ s20 1) (GEQ s36 1)), p4:(OR (LT s6 1) (LT s9 1) (LT s27 1) (LT s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-08-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-02 finished in 642 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 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:30] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:30] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:30] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:30] [INFO ] Implicit Places using invariants and state equation in 76 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 114 ms to find 1 implicit places.
[2021-05-13 14:29:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:30] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:29:30] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 42/43 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2021-05-13 14:29:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:30] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:29:30] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/43 places, 64/64 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-08-04 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 s2 1) (GEQ s10 1) (GEQ s22 1) (GEQ s32 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 7 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-08-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-04 finished in 253 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:30] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:31] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:31] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 14:29:31] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 108 ms to find 1 implicit places.
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:31] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:29:31] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 42/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:31] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:29:31] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/43 places, 64/64 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-08-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s2 1) (GEQ s14 1) (GEQ s18 1) (GEQ s36 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, null][false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-08-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-05 finished in 254 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 7 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:31] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:31] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:31] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:31] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 104 ms to find 1 implicit places.
[2021-05-13 14:29:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:31] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:29:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 42/43 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2021-05-13 14:29:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:31] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:29:31] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/43 places, 64/64 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-08-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s8 1) (LT s24 1) (LT s30 1) (LT s12 1) (LT s20 1) (LT s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13149 reset in 479 ms.
Product exploration explored 100000 steps with 13157 reset in 494 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 42 transition count 64
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-08-07 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-08-07 finished in 1247 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:32] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 14:29:32] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:32] [INFO ] Computed 4 place invariants in 7 ms
[2021-05-13 14:29:32] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:32] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:32] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 43/43 places, 64/64 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NQueens-PT-08-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s11 1) (GEQ s25 1) (GEQ s37 1)), p1:(AND (GEQ s0 1) (GEQ s15 1) (GEQ s16 1) (GEQ s36 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 3 reset in 0 ms.
FORMULA NQueens-PT-08-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-08 finished in 219 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F((!p0||(p1 U p2)))&&X(p3)))))], workingDir=/home/mcc/execution]
Support contains 15 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:32] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:32] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:32] [INFO ] Computed 4 place invariants in 12 ms
[2021-05-13 14:29:32] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 95 ms to find 1 implicit places.
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:32] [INFO ] Computed 3 place invariants in 16 ms
[2021-05-13 14:29:32] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 42/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:32] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:29:32] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/43 places, 64/64 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p3) (AND p0 (NOT p2))), (OR (NOT p3) (AND p0 (NOT p2))), (NOT p3), (AND p0 (NOT p2))]
Running random walk in product with property : NQueens-PT-08-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s12 1) (LT s18 1) (LT s32 1)), p2:(AND (GEQ s2 1) (GEQ s13 1) (GEQ s19 1) (GEQ s35 1)), p3:(AND (OR (AND (GEQ s2 1) (GEQ s13 1) (GEQ s19 1) (GEQ s35 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s16 1) (GEQ s34 1))) (GEQ s1 1) (GEQ s10 1) (GEQ s21 1) (GEQ s31 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 2 reset in 1 ms.
FORMULA NQueens-PT-08-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-09 finished in 295 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U G((F(p1) U p2))))], workingDir=/home/mcc/execution]
Support contains 12 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:32] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:33] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:33] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 115 ms to find 1 implicit places.
[2021-05-13 14:29:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:33] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:29:33] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 42/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2021-05-13 14:29:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:33] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:29:33] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/43 places, 64/64 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NQueens-PT-08-10 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=6 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s13 1) (GEQ s17 1) (GEQ s33 1)), p2:(AND (GEQ s4 1) (GEQ s11 1) (GEQ s23 1) (GEQ s35 1)), p1:(AND (GEQ s1 1) (GEQ s15 1) (GEQ s16 1) (GEQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-08-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-10 finished in 456 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)||(G(p1)&&F(!p2))))))], workingDir=/home/mcc/execution]
Support contains 12 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:33] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:33] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 90 ms to find 1 implicit places.
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:33] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:29:33] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 42/43 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:33] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:29:33] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/43 places, 64/64 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0)]
Running random walk in product with property : NQueens-PT-08-11 automaton TGBA [mat=[[{ cond=(AND p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 5}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=3, aps=[p1:(OR (LT s3 1) (LT s10 1) (LT s23 1) (LT s33 1)), p2:(OR (LT s6 1) (LT s15 1) (LT s21 1) (LT s41 1)), p0:(AND (GEQ s4 1) (GEQ s8 1) (GEQ s26 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-08-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-11 finished in 379 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(!p0)||((F(p1) U p2)&&G(p3))))], workingDir=/home/mcc/execution]
Support contains 15 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:33] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 14:29:33] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:33] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 91 ms to find 1 implicit places.
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:33] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:29:33] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 42/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:33] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:29:33] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/43 places, 64/64 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (AND p0 (NOT p3)) (AND p0 (NOT p2))), p0, (AND (NOT p3) p0), (AND p0 (NOT p2)), (AND p2 (NOT p1) p0), true, (NOT p3), (NOT p1), (NOT p2)]
Running random walk in product with property : NQueens-PT-08-12 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) p0), acceptance={} source=2 dest: 5}, { cond=(AND p3 p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 8}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=8 dest: 7}, { cond=(NOT p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p3:(AND (GEQ s4 1) (GEQ s13 1) (GEQ s21 1) (GEQ s37 1)), p2:(AND (GEQ s6 1) (GEQ s12 1) (GEQ s24 1) (GEQ s38 1)), p1:(AND (GEQ s1 1) (GEQ s11 1) (GEQ s20 1) (GEQ s32 1)), p0:(OR (LT s6 1) (LT s9 1) (LT s27 1) (LT s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-08-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-12 finished in 407 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 7 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:34] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:34] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 93 ms to find 1 implicit places.
[2021-05-13 14:29:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:34] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:29:34] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 42/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2021-05-13 14:29:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:34] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:29:34] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/43 places, 64/64 transitions.
Stuttering acceptance computed with spot in 27 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : NQueens-PT-08-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s8 1) (LT s27 1) (LT s33 1)), p1:(AND (GEQ s5 1) (GEQ s13 1) (GEQ s22 1) (GEQ s38 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 7 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-08-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-13 finished in 215 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((G(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:34] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:34] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 104 ms to find 1 implicit places.
[2021-05-13 14:29:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:34] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:29:34] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 42/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2021-05-13 14:29:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:34] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:29:34] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/43 places, 64/64 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NQueens-PT-08-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s10 1) (GEQ s25 1) (GEQ s35 1)), p0:(AND (GEQ s2 1) (GEQ s14 1) (GEQ s18 1) (GEQ s36 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-08-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-14 finished in 267 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((!p0||F((F(p2)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 11 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:34] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 64 rows 43 cols
[2021-05-13 14:29:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:29:34] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 96 ms to find 1 implicit places.
[2021-05-13 14:29:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:34] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:29:34] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 42/43 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2021-05-13 14:29:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 42 cols
[2021-05-13 14:29:34] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:29:34] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 42/43 places, 64/64 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : NQueens-PT-08-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s15 1) (LT s21 1) (LT s41 1)), p1:(AND (GEQ s2 1) (GEQ s12 1) (GEQ s20 1) (GEQ s34 1)), p2:(AND (GEQ s2 1) (GEQ s12 1) (GEQ s20 1) (GEQ s34 1) (GEQ s0 1) (GEQ s9 1) (GEQ s21 1) (GEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-08-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-15 finished in 257 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620916176762
--------------------
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-08"
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-08, 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-162089127100021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-08.tgz
mv NQueens-PT-08 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 ;