About the Execution of ITS-Tools for NQueens-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16246.432 | 3600000.00 | 6092534.00 | 302018.20 | FTFTFTFFFTFFTFF? | 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-162089127200053.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-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127200053
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K 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 85K 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.3K 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 17K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 25 07:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 07:19 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 349K 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-20-00
FORMULA_NAME NQueens-PT-20-01
FORMULA_NAME NQueens-PT-20-02
FORMULA_NAME NQueens-PT-20-03
FORMULA_NAME NQueens-PT-20-04
FORMULA_NAME NQueens-PT-20-05
FORMULA_NAME NQueens-PT-20-06
FORMULA_NAME NQueens-PT-20-07
FORMULA_NAME NQueens-PT-20-08
FORMULA_NAME NQueens-PT-20-09
FORMULA_NAME NQueens-PT-20-10
FORMULA_NAME NQueens-PT-20-11
FORMULA_NAME NQueens-PT-20-12
FORMULA_NAME NQueens-PT-20-13
FORMULA_NAME NQueens-PT-20-14
FORMULA_NAME NQueens-PT-20-15
=== Now, execution of the tool begins
BK_START 1620922514270
Running Version 0
[2021-05-13 16:15:15] [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:15:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 16:15:15] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2021-05-13 16:15:15] [INFO ] Transformed 520 places.
[2021-05-13 16:15:15] [INFO ] Transformed 400 transitions.
[2021-05-13 16:15:15] [INFO ] Parsed PT model containing 520 places and 400 transitions in 127 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 16:15:15] [INFO ] Initial state test concluded for 3 properties.
Reduce places removed 2 places and 0 transitions.
Support contains 77 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 400/400 transitions.
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 118 transition count 400
Applied a total of 400 rules in 19 ms. Remains 118 /518 variables (removed 400) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 118 cols
[2021-05-13 16:15:16] [INFO ] Invariants computation overflowed in 59 ms
[2021-05-13 16:15:16] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 400 rows 118 cols
[2021-05-13 16:15:16] [INFO ] Invariants computation overflowed in 51 ms
[2021-05-13 16:15:16] [INFO ] Implicit Places using invariants and state equation in 300 ms returned [40, 78, 79, 117]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 544 ms to find 4 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:16] [INFO ] Invariants computation overflowed in 34 ms
[2021-05-13 16:15:16] [INFO ] Dead Transitions using invariants and state equation in 197 ms returned []
Starting structural reductions, iteration 1 : 114/518 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:16] [INFO ] Invariants computation overflowed in 22 ms
[2021-05-13 16:15:16] [INFO ] Dead Transitions using invariants and state equation in 161 ms returned []
Finished structural reductions, in 2 iterations. Remains : 114/518 places, 400/400 transitions.
[2021-05-13 16:15:17] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-13 16:15:17] [INFO ] Flatten gal took : 74 ms
FORMULA NQueens-PT-20-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 16:15:17] [INFO ] Flatten gal took : 40 ms
[2021-05-13 16:15:17] [INFO ] Input system was already deterministic with 400 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 32 properties in 5 ms. (steps per millisecond=3 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&(X(G(p2))||p1))))], workingDir=/home/mcc/execution]
Support contains 11 out of 114 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:17] [INFO ] Invariants computation overflowed in 21 ms
[2021-05-13 16:15:17] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:17] [INFO ] Invariants computation overflowed in 24 ms
[2021-05-13 16:15:18] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:18] [INFO ] Invariants computation overflowed in 42 ms
[2021-05-13 16:15:18] [INFO ] Dead Transitions using invariants and state equation in 176 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : NQueens-PT-20-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s39 1) (GEQ s52 1) (GEQ s108 1)), p1:(OR (LT s17 1) (LT s24 1) (LT s71 1) (LT s97 1)), p2:(OR (LT s14 1) (LT s21 1) (LT s71 1) (LT s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 2 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-20-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-00 finished in 1388 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:18] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-13 16:15:18] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:18] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:15:19] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:19] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:15:19] [INFO ] Dead Transitions using invariants and state equation in 163 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NQueens-PT-20-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (LT s4 1) (LT s38 1) (LT s44 1) (LT s98 1)), p0:(AND (GEQ s0 1) (GEQ s24 1) (GEQ s54 1) (GEQ s80 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-20-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-02 finished in 866 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((F((G(p2)||p1))||p0))||F(p3)))], workingDir=/home/mcc/execution]
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 14 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:19] [INFO ] Invariants computation overflowed in 18 ms
[2021-05-13 16:15:19] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:19] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-13 16:15:20] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2021-05-13 16:15:20] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:20] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:15:20] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2))]
Running random walk in product with property : NQueens-PT-20-03 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p3:(OR (LT s14 1) (LT s27 1) (LT s65 1) (LT s97 1)), p0:(OR (LT s7 1) (LT s24 1) (LT s61 1) (LT s87 1)), p1:(OR (LT s7 1) (LT s24 1) (LT s61 1) (LT s87 1)), p2:(OR (LT s7 1) (LT s24 1) (LT s61 1) (LT s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22104 reset in 5297 ms.
Product exploration explored 100000 steps with 22127 reset in 5284 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 114 transition count 400
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p3)), (F (G p0)), (F (G p1)), (F (G p2)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Property proved to be true thanks to knowledge :(F (G p3))
FORMULA NQueens-PT-20-03 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-20-03 finished in 11579 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0) U (G((p1||X(p2))) U p3))))], workingDir=/home/mcc/execution]
Support contains 15 out of 114 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:31] [INFO ] Invariants computation overflowed in 18 ms
[2021-05-13 16:15:31] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:31] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:15:31] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:31] [INFO ] Invariants computation overflowed in 18 ms
[2021-05-13 16:15:31] [INFO ] Dead Transitions using invariants and state equation in 165 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 2223 ms :[(NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p3)]
Running random walk in product with property : NQueens-PT-20-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(NOT p3), acceptance={} source=7 dest: 5}, { cond=(NOT p3), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(OR (LT s10 1) (LT s30 1) (LT s58 1) (LT s96 1)), p1:(AND (GEQ s13 1) (GEQ s22 1) (GEQ s69 1) (GEQ s91 1)), p0:(AND (GEQ s4 1) (GEQ s26 1) (GEQ s56 1) (GEQ s86 1)), p2:(AND (GEQ s7 1) (GEQ s26 1) (GEQ s59 1) (GEQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], 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 7 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-20-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-04 finished in 2974 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:34] [INFO ] Invariants computation overflowed in 18 ms
[2021-05-13 16:15:34] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:34] [INFO ] Invariants computation overflowed in 20 ms
[2021-05-13 16:15:34] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2021-05-13 16:15:34] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:34] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-13 16:15:34] [INFO ] Dead Transitions using invariants and state equation in 154 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-20-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s10 1) (LT s34 1) (LT s54 1) (LT s100 1)), p1:(AND (GEQ s9 1) (GEQ s21 1) (GEQ s66 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5405 reset in 2664 ms.
Product exploration explored 100000 steps with 5408 reset in 2667 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 114 transition count 400
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G (NOT p1))), (NOT p0), p1]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA NQueens-PT-20-05 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-20-05 finished in 6274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0)||G((p1&&X(G((G(p3)||p2))))))))], workingDir=/home/mcc/execution]
Support contains 14 out of 114 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:40] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:15:40] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:40] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:15:41] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:41] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:15:41] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true]
Running random walk in product with property : NQueens-PT-20-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 p3), acceptance={} source=4 dest: 4}, { cond=(OR (NOT p1) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p2) p3), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(OR (NOT p1) (AND (NOT p2) (NOT p3))), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s31 1) (LT s49 1) (LT s89 1)), p1:(OR (AND (GEQ s7 1) (GEQ s29 1) (GEQ s56 1) (GEQ s92 1)) (LT s2 1) (LT s38 1) (LT s42 1) (LT s96 1)), p2:(OR (AND (GEQ s7 1) (GEQ s29 1) (GEQ s56 1) (GEQ s92 1)) (LT s2 1) (LT s38 1) (LT s42 1) (LT s96 1)), p3:(OR (LT s2 1) (LT s37 1) (LT s43 1) (LT s95 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 1 reset in 1 ms.
FORMULA NQueens-PT-20-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-06 finished in 987 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p1)||p0) U G(p2)))], workingDir=/home/mcc/execution]
Support contains 15 out of 114 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:41] [INFO ] Invariants computation overflowed in 20 ms
[2021-05-13 16:15:41] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:41] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:15:41] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2021-05-13 16:15:41] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:42] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-13 16:15:42] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 7512 ms :[(NOT p2), true, (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : NQueens-PT-20-07 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 p1) (AND p0 p1)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s2 1) (LT s33 1) (LT s47 1) (LT s91 1)), p0:(OR (AND (GEQ s14 1) (GEQ s22 1) (GEQ s70 1) (GEQ s92 1)) (AND (GEQ s3 1) (GEQ s27 1) (GEQ s54 1) (GEQ s86 1))), p1:(AND (GEQ s14 1) (GEQ s37 1) (GEQ s55 1) (GEQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 111 steps with 6 reset in 4 ms.
FORMULA NQueens-PT-20-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-07 finished in 8301 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (p1||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 7 out of 114 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:49] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:15:49] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:49] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:15:50] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:50] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:15:50] [INFO ] Dead Transitions using invariants and state equation in 197 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-20-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s2 1) (LT s34 1) (LT s46 1) (LT s92 1)) (OR (LT s1 1) (LT s33 1) (LT s46 1) (LT s90 1))), p0:(OR (LT s1 1) (LT s33 1) (LT s46 1) (LT s90 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-20-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-08 finished in 987 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 114 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:50] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-13 16:15:50] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:50] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-13 16:15:51] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:15:51] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-13 16:15:51] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-09 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 s15 1) (LT s23 1) (LT s70 1) (LT s94 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 16363 reset in 4567 ms.
Product exploration explored 100000 steps with 16349 reset in 4599 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 114 transition count 400
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : 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-20-09 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-20-09 finished in 13267 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(G(p0)) U G(p1)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 1 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:16:04] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:16:04] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:16:04] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:16:04] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:16:04] [INFO ] Invariants computation overflowed in 18 ms
[2021-05-13 16:16:04] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s37 1) (GEQ s47 1) (GEQ s99 1)), p0:(OR (LT s14 1) (LT s33 1) (LT s59 1) (LT s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 130 steps with 6 reset in 3 ms.
FORMULA NQueens-PT-20-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-10 finished in 849 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F((p0&&F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 1 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:16:04] [INFO ] Invariants computation overflowed in 18 ms
[2021-05-13 16:16:04] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:16:04] [INFO ] Invariants computation overflowed in 28 ms
[2021-05-13 16:16:05] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:16:05] [INFO ] Invariants computation overflowed in 21 ms
[2021-05-13 16:16:05] [INFO ] Dead Transitions using invariants and state equation in 162 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-20-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s16 1) (GEQ s36 1) (GEQ s58 1) (GEQ s108 1)), p0:(OR (LT s8 1) (LT s22 1) (LT s64 1) (LT s86 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, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 2 reset in 1 ms.
FORMULA NQueens-PT-20-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-11 finished in 868 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((X(F((p1||X((G(p2) U (G(p2)&&p3)))))) U G(p4))&&p0)))], workingDir=/home/mcc/execution]
Support contains 16 out of 114 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:16:05] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:16:05] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:16:05] [INFO ] Invariants computation overflowed in 18 ms
[2021-05-13 16:16:06] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:16:06] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:16:06] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p0) (NOT p4)), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (NOT p4), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p4))]
Running random walk in product with property : NQueens-PT-20-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p4)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p4), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p4)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p4) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p4 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p4), acceptance={} source=4 dest: 2}, { cond=p4, acceptance={} source=4 dest: 3}, { cond=(NOT p4), acceptance={0} source=4 dest: 4}, { cond=p4, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=5 dest: 7}], [{ cond=(OR (AND (NOT p4) (NOT p1) (NOT p3)) (AND (NOT p4) (NOT p1) (NOT p2))), acceptance={} source=6 dest: 5}, { cond=(OR (AND p4 (NOT p1) (NOT p3)) (AND p4 (NOT p1) (NOT p2))), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p4) (NOT p1) p3 p2), acceptance={} source=6 dest: 7}, { cond=(AND p4 (NOT p1) p3 p2), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p4) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p4 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p4) (NOT p1) p2), acceptance={} source=8 dest: 7}, { cond=(AND p4 (NOT p1) p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s39 1) (GEQ s47 1) (GEQ s103 1)), p4:(AND (GEQ s16 1) (GEQ s35 1) (GEQ s59 1) (GEQ s107 1)), p1:(AND (GEQ s18 1) (GEQ s38 1) (GEQ s58 1) (GEQ s112 1)), p3:(AND (GEQ s18 1) (GEQ s38 1) (GEQ s58 1) (GEQ s112 1)), p2:(OR (LT s9 1) (LT s25 1) (LT s62 1) (LT s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 1 reset in 1 ms.
FORMULA NQueens-PT-20-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-14 finished in 1118 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(F(!p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 114/114 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:16:06] [INFO ] Invariants computation overflowed in 18 ms
[2021-05-13 16:16:06] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:16:06] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:16:07] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2021-05-13 16:16:07] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 400 rows 114 cols
[2021-05-13 16:16:07] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-13 16:16:07] [INFO ] Dead Transitions using invariants and state equation in 169 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 400/400 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), p0, p0]
Running random walk in product with property : NQueens-PT-20-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s23 1) (GEQ s67 1) (GEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 11882 reset in 3944 ms.
Product exploration explored 100000 steps with 11939 reset in 3956 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 114 transition count 400
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), p0]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), p0, p0]
Product exploration explored 100000 steps with 11730 reset in 3958 ms.
Product exploration explored 100000 steps with 11752 reset in 3928 ms.
[2021-05-13 16:16:32] [INFO ] Flatten gal took : 55 ms
[2021-05-13 16:16:33] [INFO ] Flatten gal took : 68 ms
[2021-05-13 16:16:33] [INFO ] Time to serialize gal into /tmp/LTL16096484081233160355.gal : 10 ms
[2021-05-13 16:16:33] [INFO ] Time to serialize properties into /tmp/LTL18147362831770482822.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16096484081233160355.gal, -t, CGAL, -LTL, /tmp/LTL18147362831770482822.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16096484081233160355.gal -t CGAL -LTL /tmp/LTL18147362831770482822.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((((cX_12>=1)&&(cY_3>=1))&&(L_28>=1))&&(R_16>=1))"))&&(G(F("((((cX_12<1)||(cY_3<1))||(L_28<1))||(R_16<1))")))))
Formula 0 simplified : !(F"((((cX_12>=1)&&(cY_3>=1))&&(L_28>=1))&&(R_16>=1))" & GF"((((cX_12<1)||(cY_3<1))||(L_28<1))||(R_16<1))")
Detected timeout of ITS tools.
[2021-05-13 16:16:48] [INFO ] Flatten gal took : 55 ms
[2021-05-13 16:16:48] [INFO ] Applying decomposition
[2021-05-13 16:16:48] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6153875845259191840.txt, -o, /tmp/graph6153875845259191840.bin, -w, /tmp/graph6153875845259191840.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6153875845259191840.bin, -l, -1, -v, -w, /tmp/graph6153875845259191840.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 16:16:49] [INFO ] Decomposing Gal with order
[2021-05-13 16:16:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 16:16:49] [INFO ] Removed a total of 1482 redundant transitions.
[2021-05-13 16:16:49] [INFO ] Flatten gal took : 87 ms
[2021-05-13 16:16:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-13 16:16:49] [INFO ] Time to serialize gal into /tmp/LTL1580377042067281786.gal : 5 ms
[2021-05-13 16:16:49] [INFO ] Time to serialize properties into /tmp/LTL5677012390648399784.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1580377042067281786.gal, -t, CGAL, -LTL, /tmp/LTL5677012390648399784.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1580377042067281786.gal -t CGAL -LTL /tmp/LTL5677012390648399784.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("((((u12.cX_12>=1)&&(u23.cY_3>=1))&&(u67.L_28>=1))&&(u91.R_16>=1))"))&&(G(F("((((u12.cX_12<1)||(u23.cY_3<1))||(u67.L_28<1))||(u91.R_16<1))")))))
Formula 0 simplified : !(F"((((u12.cX_12>=1)&&(u23.cY_3>=1))&&(u67.L_28>=1))&&(u91.R_16>=1))" & GF"((((u12.cX_12<1)||(u23.cY_3<1))||(u67.L_28<1))||(u91.R_16<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7407227678898638598
[2021-05-13 16:17:05] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7407227678898638598
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7407227678898638598]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7407227678898638598] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7407227678898638598] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property NQueens-PT-20-15 finished in 60753 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3692452829265579307
[2021-05-13 16:17:07] [INFO ] Computing symmetric may disable matrix : 400 transitions.
[2021-05-13 16:17:07] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 16:17:07] [INFO ] Computing symmetric may enable matrix : 400 transitions.
[2021-05-13 16:17:07] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 16:17:07] [INFO ] Applying decomposition
[2021-05-13 16:17:07] [INFO ] Computing Do-Not-Accords matrix : 400 transitions.
[2021-05-13 16:17:07] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 16:17:07] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3692452829265579307
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3692452829265579307]
[2021-05-13 16:17:07] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12309630043688026205.txt, -o, /tmp/graph12309630043688026205.bin, -w, /tmp/graph12309630043688026205.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12309630043688026205.bin, -l, -1, -v, -w, /tmp/graph12309630043688026205.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 16:17:07] [INFO ] Decomposing Gal with order
[2021-05-13 16:17:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 16:17:07] [INFO ] Removed a total of 1482 redundant transitions.
[2021-05-13 16:17:07] [INFO ] Flatten gal took : 87 ms
[2021-05-13 16:17:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-13 16:17:07] [INFO ] Time to serialize gal into /tmp/LTLFireability4204118373362868644.gal : 2 ms
[2021-05-13 16:17:07] [INFO ] Time to serialize properties into /tmp/LTLFireability4500604328035041280.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability4204118373362868644.gal, -t, CGAL, -LTL, /tmp/LTLFireability4500604328035041280.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability4204118373362868644.gal -t CGAL -LTL /tmp/LTLFireability4500604328035041280.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("((((u12.cX_12>=1)&&(u23.cY_3>=1))&&(u67.L_28>=1))&&(u91.R_16>=1))"))&&(G(F(!("((((u12.cX_12>=1)&&(u23.cY_3>=1))&&(u67.L_28>=1))&&(u91.R_16>=1))"))))))
Formula 0 simplified : !(F"((((u12.cX_12>=1)&&(u23.cY_3>=1))&&(u67.L_28>=1))&&(u91.R_16>=1))" & GF!"((((u12.cX_12>=1)&&(u23.cY_3>=1))&&(u67.L_28>=1))&&(u91.R_16>=1))")
Compilation finished in 2619 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3692452829265579307]
Link finished in 56 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (<>((LTLAPp0==true))&&[](<>(!(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3692452829265579307]
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (<>((LTLAPp0==true))&&[](<>(!(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3692452829265579307]
Retrying LTSmin with larger timeout 2208 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (<>((LTLAPp0==true))&&[](<>(!(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3692452829265579307]
Detected timeout of ITS tools.
[2021-05-13 16:37:48] [INFO ] Flatten gal took : 307 ms
[2021-05-13 16:37:48] [INFO ] Time to serialize gal into /tmp/LTLFireability3574816660541394478.gal : 88 ms
[2021-05-13 16:37:48] [INFO ] Time to serialize properties into /tmp/LTLFireability9376164520937898775.ltl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability3574816660541394478.gal, -t, CGAL, -LTL, /tmp/LTLFireability9376164520937898775.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability3574816660541394478.gal -t CGAL -LTL /tmp/LTLFireability9376164520937898775.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((((cX_12>=1)&&(cY_3>=1))&&(L_28>=1))&&(R_16>=1))"))&&(G(F(!("((((cX_12>=1)&&(cY_3>=1))&&(L_28>=1))&&(R_16>=1))"))))))
Formula 0 simplified : !(F"((((cX_12>=1)&&(cY_3>=1))&&(L_28>=1))&&(R_16>=1))" & GF!"((((cX_12>=1)&&(cY_3>=1))&&(L_28>=1))&&(R_16>=1))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.220: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.220: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.220: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.221: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.221: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.223: Initializing POR dependencies: labels 401, guards 400
pins2lts-mc-linux64( 6/ 8), 0.228: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.234: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.247: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.581: LTL layer: formula: (<>((LTLAPp0==true))&&[](<>(!(LTLAPp0==true))))
pins2lts-mc-linux64( 1/ 8), 0.583: "(<>((LTLAPp0==true))&&[](<>(!(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.584: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.605: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.760: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.774: There are 403 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.774: State length is 115, there are 407 groups
pins2lts-mc-linux64( 0/ 8), 0.774: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.774: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.774: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.774: Visible groups: 64 / 407, labels: 1 / 403
pins2lts-mc-linux64( 0/ 8), 0.774: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.774: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 1.131: [Blue] ~19 levels ~960 states ~26544 transitions
pins2lts-mc-linux64( 7/ 8), 1.157: [Blue] ~19 levels ~1920 states ~27000 transitions
pins2lts-mc-linux64( 7/ 8), 1.207: [Blue] ~19 levels ~3840 states ~32320 transitions
pins2lts-mc-linux64( 5/ 8), 1.357: [Blue] ~20 levels ~7680 states ~50432 transitions
pins2lts-mc-linux64( 0/ 8), 1.668: [Blue] ~20 levels ~15360 states ~83128 transitions
pins2lts-mc-linux64( 5/ 8), 2.279: [Blue] ~20 levels ~30720 states ~143952 transitions
pins2lts-mc-linux64( 5/ 8), 3.624: [Blue] ~20 levels ~61440 states ~280296 transitions
pins2lts-mc-linux64( 5/ 8), 6.887: [Blue] ~20 levels ~122880 states ~581456 transitions
pins2lts-mc-linux64( 7/ 8), 12.927: [Blue] ~20 levels ~245760 states ~1131776 transitions
pins2lts-mc-linux64( 0/ 8), 26.153: [Blue] ~21 levels ~491520 states ~2438576 transitions
pins2lts-mc-linux64( 3/ 8), 54.614: [Blue] ~21 levels ~983040 states ~4972352 transitions
pins2lts-mc-linux64( 3/ 8), 113.799: [Blue] ~21 levels ~1966080 states ~10484472 transitions
pins2lts-mc-linux64( 6/ 8), 234.385: [Blue] ~21 levels ~3932160 states ~19299360 transitions
pins2lts-mc-linux64( 3/ 8), 487.666: [Blue] ~21 levels ~7864320 states ~45256912 transitions
pins2lts-mc-linux64( 7/ 8), 1012.910: [Blue] ~21 levels ~15728640 states ~93310616 transitions
pins2lts-mc-linux64( 2/ 8), 1200.606: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1207.037:
pins2lts-mc-linux64( 0/ 8), 1207.037: Explored 17849988 states 106227271 transitions, fanout: 5.951
pins2lts-mc-linux64( 0/ 8), 1207.039: Total exploration time 1200.010 sec (1199.790 sec minimum, 1199.861 sec on average)
pins2lts-mc-linux64( 0/ 8), 1207.039: States per second: 14875, Transitions per second: 88522
pins2lts-mc-linux64( 0/ 8), 1207.039:
pins2lts-mc-linux64( 0/ 8), 1207.039: State space has 17869352 states, 1114098 are accepting
pins2lts-mc-linux64( 0/ 8), 1207.039: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1207.039: blue states: 17849988 (99.89%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1207.039: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1207.039: all-red states: 1114098 (6.23%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1207.039:
pins2lts-mc-linux64( 0/ 8), 1207.039: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1207.040:
pins2lts-mc-linux64( 0/ 8), 1207.040: Queue width: 8B, total height: 168, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1207.040: Tree memory: 392.3MB, 23.0 B/state, compr.: 5.0%
pins2lts-mc-linux64( 0/ 8), 1207.040: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1207.041: Stored 456 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1207.043: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1207.043: Est. total memory use: 392.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (<>((LTLAPp0==true))&&[](<>(!(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3692452829265579307]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (<>((LTLAPp0==true))&&[](<>(!(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3692452829265579307]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-13 16:58:27] [INFO ] Flatten gal took : 199 ms
[2021-05-13 16:58:28] [INFO ] Input system was already deterministic with 400 transitions.
[2021-05-13 16:58:28] [INFO ] Transformed 114 places.
[2021-05-13 16:58:28] [INFO ] Transformed 400 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
java.lang.NullPointerException
at fr.lip6.move.gal.application.Application.computeOrderWithGreatSPN(Application.java:889)
at fr.lip6.move.gal.application.Application.runMultiITS(Application.java:835)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:515)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-13 16:58:28] [INFO ] Time to serialize gal into /tmp/LTLFireability3588176589072362470.gal : 10 ms
[2021-05-13 16:58:28] [INFO ] Time to serialize properties into /tmp/LTLFireability17613190132775818650.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability3588176589072362470.gal, -t, CGAL, -LTL, /tmp/LTLFireability17613190132775818650.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability3588176589072362470.gal -t CGAL -LTL /tmp/LTLFireability17613190132775818650.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("((((cX_12>=1)&&(cY_3>=1))&&(L_28>=1))&&(R_16>=1))"))&&(G(F(!("((((cX_12>=1)&&(cY_3>=1))&&(L_28>=1))&&(R_16>=1))"))))))
Formula 0 simplified : !(F"((((cX_12>=1)&&(cY_3>=1))&&(L_28>=1))&&(R_16>=1))" & GF!"((((cX_12>=1)&&(cY_3>=1))&&(L_28>=1))&&(R_16>=1))")
BK_TIME_CONFINEMENT_REACHED
--------------------
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-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is NQueens-PT-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089127200053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-20.tgz
mv NQueens-PT-20 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;