MCC'2022- Execution of r132-tall-165271821500924

About the Execution of ITS-Tools for NQueens-PT-15

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16217.220	3600000.00	3257008.00	572602.90	TFTFFFFTFFFFFFF?	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821500924.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NQueens-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821500924
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 8.9K Apr 30 00:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 30 00:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 30 00:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 30 00:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 203K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NQueens-PT-15-LTLFireability-00
FORMULA_NAME NQueens-PT-15-LTLFireability-01
FORMULA_NAME NQueens-PT-15-LTLFireability-02
FORMULA_NAME NQueens-PT-15-LTLFireability-03
FORMULA_NAME NQueens-PT-15-LTLFireability-04
FORMULA_NAME NQueens-PT-15-LTLFireability-05
FORMULA_NAME NQueens-PT-15-LTLFireability-06
FORMULA_NAME NQueens-PT-15-LTLFireability-07
FORMULA_NAME NQueens-PT-15-LTLFireability-08
FORMULA_NAME NQueens-PT-15-LTLFireability-09
FORMULA_NAME NQueens-PT-15-LTLFireability-10
FORMULA_NAME NQueens-PT-15-LTLFireability-11
FORMULA_NAME NQueens-PT-15-LTLFireability-12
FORMULA_NAME NQueens-PT-15-LTLFireability-13
FORMULA_NAME NQueens-PT-15-LTLFireability-14
FORMULA_NAME NQueens-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652901765716

Running Version 202205111006
[2022-05-18 19:22:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 19:22:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 19:22:47] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2022-05-18 19:22:47] [INFO ] Transformed 315 places.
[2022-05-18 19:22:47] [INFO ] Transformed 225 transitions.
[2022-05-18 19:22:47] [INFO ] Parsed PT model containing 315 places and 225 transitions in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-15-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 225/225 transitions.
Reduce places removed 225 places and 0 transitions.
Iterating post reduction 0 with 225 rules applied. Total rules applied 225 place count 88 transition count 225
Applied a total of 225 rules in 24 ms. Remains 88 /313 variables (removed 225) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 88 cols
[2022-05-18 19:22:47] [INFO ] Computed 7 place invariants in 43 ms
[2022-05-18 19:22:47] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 225 rows 88 cols
[2022-05-18 19:22:47] [INFO ] Computed 7 place invariants in 31 ms
[2022-05-18 19:22:47] [INFO ] Implicit Places using invariants and state equation in 218 ms returned [30, 58, 59, 87]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 535 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/313 places, 225/225 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 84/313 places, 225/225 transitions.
Support contains 64 out of 84 places after structural reductions.
[2022-05-18 19:22:47] [INFO ] Flatten gal took : 52 ms
[2022-05-18 19:22:47] [INFO ] Flatten gal took : 25 ms
[2022-05-18 19:22:48] [INFO ] Input system was already deterministic with 225 transitions.
Finished random walk after 44 steps, including 3 resets, run visited all 33 properties in 18 ms. (steps per millisecond=2 )
FORMULA NQueens-PT-15-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(X(F(p0)))||p1))))'
Support contains 8 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:48] [INFO ] Invariants computation overflowed in 17 ms
[2022-05-18 19:22:48] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:48] [INFO ] Invariants computation overflowed in 11 ms
[2022-05-18 19:22:48] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:48] [INFO ] Invariants computation overflowed in 20 ms
[2022-05-18 19:22:49] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 535 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (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=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s29 1) (GEQ s40 1) (GEQ s81 1)), p0:(OR (LT s13 1) (LT s20 1) (LT s51 1) (LT s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 8650 reset in 1737 ms.
Product exploration explored 100000 steps with 8633 reset in 1714 ms.
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 312 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-15-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-00 finished in 5098 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(X(p0)))&&(X(G(X(p1)))||p2))))'
Support contains 12 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:53] [INFO ] Invariants computation overflowed in 14 ms
[2022-05-18 19:22:53] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:53] [INFO ] Invariants computation overflowed in 12 ms
[2022-05-18 19:22:53] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:53] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:22:53] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 686 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p0), (NOT p1), true]
Running random walk in product with property : NQueens-PT-15-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s8 1) (GEQ s17 1) (GEQ s49 1) (GEQ s66 1)), p0:(AND (GEQ s1 1) (GEQ s18 1) (GEQ s41 1) (GEQ s60 1)), p1:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s46...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-01 finished in 1134 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G(!(F(p0)&&p1))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 10 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:54] [INFO ] Invariants computation overflowed in 16 ms
[2022-05-18 19:22:54] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:54] [INFO ] Invariants computation overflowed in 13 ms
[2022-05-18 19:22:55] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2022-05-18 19:22:55] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:55] [INFO ] Invariants computation overflowed in 9 ms
[2022-05-18 19:22:55] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND p1 p0), p0, (NOT p0), (AND p0 p1), true]
Running random walk in product with property : NQueens-PT-15-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s13 1) (GEQ s29 1) (GEQ s42 1) (GEQ s83 1)), p0:(AND (GEQ s13 1) (GEQ s29 1) (GEQ s42 1) (GEQ s83 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 90 steps with 21 reset in 5 ms.
FORMULA NQueens-PT-15-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-04 finished in 733 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:55] [INFO ] Invariants computation overflowed in 7 ms
[2022-05-18 19:22:55] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:55] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:22:55] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:55] [INFO ] Invariants computation overflowed in 21 ms
[2022-05-18 19:22:55] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s12 1) (GEQ s24 1) (GEQ s46 1) (GEQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-15-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-05 finished in 636 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U G((X((p0 U p1))||p2)))))'
Support contains 8 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:56] [INFO ] Invariants computation overflowed in 16 ms
[2022-05-18 19:22:56] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:56] [INFO ] Invariants computation overflowed in 10 ms
[2022-05-18 19:22:56] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:56] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:22:56] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s3 1) (GEQ s24 1) (GEQ s37 1) (GEQ s68 1)), p0:(AND (GEQ s10 1) (GEQ s22 1) (GEQ s46 1) (GEQ s73 1)), p1:(AND (GEQ s10 1) (GEQ s22 1) (GEQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-06 finished in 669 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(p0) U G(X(!F(X(X((X(X(p2))&&p1))))))))'
Support contains 8 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:56] [INFO ] Invariants computation overflowed in 9 ms
[2022-05-18 19:22:56] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:56] [INFO ] Invariants computation overflowed in 21 ms
[2022-05-18 19:22:57] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:22:57] [INFO ] Invariants computation overflowed in 10 ms
[2022-05-18 19:22:57] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 479 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p1 p2), (AND p0 p1 p2), (AND p1 p2), (AND p0 p2), (AND p1 p2), (AND p1 p2), (AND p0 p1 p2), (AND p0 p2), p0]
Running random walk in product with property : NQueens-PT-15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}, { cond=p1, acceptance={0} source=4 dest: 7}, { cond=p0, acceptance={} source=4 dest: 8}], [{ cond=p0, acceptance={} source=5 dest: 9}], [{ cond=(AND p0 p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=6 dest: 4}], [{ cond=p2, acceptance={} source=7 dest: 6}, { cond=(AND p1 p2), acceptance={0} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 p2), acceptance={} source=8 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=9 dest: 10}], [{ cond=p0, acceptance={0} source=10 dest: 10}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s20 1) (GEQ s39 1) (GEQ s62 1)), p1:(AND (GEQ s11 1) (GEQ s23 1) (GEQ s46 1) (GEQ s75 1)), p2:(AND (GEQ s11 1) (GEQ s23 1) (GEQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 18434 reset in 2348 ms.
Product exploration explored 100000 steps with 18309 reset in 2383 ms.
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 4 factoid took 491 ms. Reduced automaton from 11 states, 19 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-15-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-07 finished in 6287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((X(G(p1))&&p0) U G(p2)) U X(!X(p1))))'
Support contains 8 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:03] [INFO ] Invariants computation overflowed in 9 ms
[2022-05-18 19:23:03] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:03] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:23:03] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:03] [INFO ] Invariants computation overflowed in 13 ms
[2022-05-18 19:23:03] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 268 ms :[p1, true, p1, p1, p1, p1, (OR (NOT p2) p1), (NOT p2)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 1}, { cond=(AND p2 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=6 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 1}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s8 1) (GEQ s25 1) (GEQ s41 1) (GEQ s74 1)), p1:(AND (GEQ s1 1) (GEQ s23 1) (GEQ s36 1) (GEQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 1 reset in 0 ms.
FORMULA NQueens-PT-15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-08 finished in 730 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(X(F((X(p1)||p0))))&&F(p2)))))'
Support contains 8 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:03] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:23:03] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:03] [INFO ] Invariants computation overflowed in 12 ms
[2022-05-18 19:23:04] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:04] [INFO ] Invariants computation overflowed in 18 ms
[2022-05-18 19:23:04] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-15-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s22 1) (GEQ s42 1) (GEQ s69 1)), p0:(OR (LT s7 1) (LT s20 1) (LT s45 1) (LT s68 1)), p1:(OR (LT s7 1) (LT s20 1) (LT s45 1) (LT s6...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 166 steps with 33 reset in 10 ms.
FORMULA NQueens-PT-15-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-09 finished in 700 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:04] [INFO ] Invariants computation overflowed in 14 ms
[2022-05-18 19:23:04] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:04] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:23:04] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:04] [INFO ] Invariants computation overflowed in 9 ms
[2022-05-18 19:23:04] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s14 1) (GEQ s25 1) (GEQ s47 1) (GEQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 19 steps with 3 reset in 1 ms.
FORMULA NQueens-PT-15-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-10 finished in 521 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(X(p1))||p2))&&p0)))'
Support contains 12 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 9 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:04] [INFO ] Invariants computation overflowed in 7 ms
[2022-05-18 19:23:05] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:05] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:23:05] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:05] [INFO ] Invariants computation overflowed in 11 ms
[2022-05-18 19:23:05] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : NQueens-PT-15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(AND (GEQ s13 1) (GEQ s15 1) (GEQ s56 1) (GEQ s69 1)), p0:(AND (GEQ s12 1) (GEQ s29 1) (GEQ s41 1) (GEQ s82 1)), p1:(AND (GEQ s3 1) (GEQ s23 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 5 reset in 0 ms.
FORMULA NQueens-PT-15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-11 finished in 650 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(X(X(G(p0))))&&F(G(F(p1)))))))'
Support contains 8 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:05] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:23:05] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:05] [INFO ] Invariants computation overflowed in 13 ms
[2022-05-18 19:23:05] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2022-05-18 19:23:05] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:05] [INFO ] Invariants computation overflowed in 12 ms
[2022-05-18 19:23:06] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s10 1) (LT s27 1) (LT s41 1) (LT s78 1)), p1:(AND (GEQ s1 1) (GEQ s22 1) (GEQ s37 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-12 finished in 550 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((X(G(F(p0)))&&p1))))))'
Support contains 12 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:06] [INFO ] Invariants computation overflowed in 16 ms
[2022-05-18 19:23:06] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:06] [INFO ] Invariants computation overflowed in 15 ms
[2022-05-18 19:23:06] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:06] [INFO ] Invariants computation overflowed in 9 ms
[2022-05-18 19:23:06] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=p1, acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (LT s4 1) (LT s26 1) (LT s36 1) (LT s71 1) (AND (GEQ s13 1) (GEQ s21 1) (GEQ s50 1) (GEQ s75 1))), p0:(AND (GEQ s11 1) (GEQ s24 1) (GEQ s45 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-13 finished in 755 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:06] [INFO ] Invariants computation overflowed in 13 ms
[2022-05-18 19:23:07] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:07] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:23:07] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2022-05-18 19:23:07] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:07] [INFO ] Invariants computation overflowed in 14 ms
[2022-05-18 19:23:07] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s18 1) (GEQ s48 1) (GEQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-14 finished in 526 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)&&p1) U !(X(p0) U p0))||G(p2)))'
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:07] [INFO ] Invariants computation overflowed in 14 ms
[2022-05-18 19:23:07] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:07] [INFO ] Invariants computation overflowed in 12 ms
[2022-05-18 19:23:07] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:07] [INFO ] Invariants computation overflowed in 11 ms
[2022-05-18 19:23:07] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 272 ms :[(AND p0 (NOT p2)), (NOT p2), true, p0, p0, p0, (AND (NOT p2) p0), (AND p0 (NOT p2))]
Running random walk in product with property : NQueens-PT-15-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 6}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=0 dest: 7}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 3}], [{ cond=(AND p2 p0), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 2}], [{ cond=(AND p2 p0 p1), acceptance={} source=7 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=7 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s23 1) (GEQ s37 1) (GEQ s66 1)), p0:(AND (GEQ s2 1) (GEQ s28 1) (GEQ s32 1) (GEQ s71 1)), p1:(OR (AND (GEQ s2 1) (GEQ s23 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16605 reset in 2588 ms.
Product exploration explored 100000 steps with 16504 reset in 2604 ms.
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p2 p0 p1)), (X (NOT (AND p2 p0 p1))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 15 factoid took 3110 ms. Reduced automaton from 8 states, 24 edges and 3 AP to 8 states, 24 edges and 3 AP.
Stuttering acceptance computed with spot in 240 ms :[(NOT p2), (AND p0 (NOT p2)), true, p0, p0, p0, (AND (NOT p2) p0), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 720 resets, run finished after 596 ms. (steps per millisecond=16 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:17] [INFO ] Invariants computation overflowed in 13 ms
[2022-05-18 19:23:17] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (G (NOT (AND p2 (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND (NOT p2) (NOT p1) p0))), (G (NOT (AND (NOT p2) p1 (NOT p0)))), (G (NOT (AND p2 (NOT p1) p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p2 p0 p1)), (X (NOT (AND p2 p0 p1))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (AND p2 p1 (NOT p0))), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p1 p0)), (F (NOT (AND p2 p0))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (NOT p2)), (F (NOT (AND p2 p1 p0))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 20 factoid took 2830 ms. Reduced automaton from 8 states, 24 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 221 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, p0, p0, p0]
Stuttering acceptance computed with spot in 223 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, p0, p0, p0]
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:21] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:23:21] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:21] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:23:21] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:21] [INFO ] Invariants computation overflowed in 11 ms
[2022-05-18 19:23:21] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), true, (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X p1), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 709 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 213 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, p0, p0, p0]
Finished random walk after 45 steps, including 3 resets, run visited all 6 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p0 p2 p1), true, (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X p1), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 795 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 216 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, p0, p0, p0]
Stuttering acceptance computed with spot in 219 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, p0, p0, p0]
Stuttering acceptance computed with spot in 194 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, p0, p0, p0]
Product exploration explored 100000 steps with 16571 reset in 2388 ms.
Product exploration explored 100000 steps with 16555 reset in 2425 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 242 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, p0, p0, p0]
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2022-05-18 19:23:29] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:29] [INFO ] Invariants computation overflowed in 10 ms
[2022-05-18 19:23:29] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Product exploration explored 100000 steps with 16535 reset in 2585 ms.
Product exploration explored 100000 steps with 16470 reset in 2560 ms.
Built C files in :
/tmp/ltsmin17930399265053408054
[2022-05-18 19:23:34] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17930399265053408054
Running compilation step : cd /tmp/ltsmin17930399265053408054;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 746 ms.
Running link step : cd /tmp/ltsmin17930399265053408054;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17930399265053408054;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3075937535463084269.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:49] [INFO ] Invariants computation overflowed in 14 ms
[2022-05-18 19:23:49] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:49] [INFO ] Invariants computation overflowed in 9 ms
[2022-05-18 19:23:49] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:23:49] [INFO ] Invariants computation overflowed in 11 ms
[2022-05-18 19:23:50] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Built C files in :
/tmp/ltsmin10701358026537990948
[2022-05-18 19:23:50] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10701358026537990948
Running compilation step : cd /tmp/ltsmin10701358026537990948;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 407 ms.
Running link step : cd /tmp/ltsmin10701358026537990948;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10701358026537990948;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14604015828507077284.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 19:24:05] [INFO ] Flatten gal took : 21 ms
[2022-05-18 19:24:05] [INFO ] Flatten gal took : 19 ms
[2022-05-18 19:24:05] [INFO ] Time to serialize gal into /tmp/LTL4356375341287540026.gal : 4 ms
[2022-05-18 19:24:05] [INFO ] Time to serialize properties into /tmp/LTL7942515510619635240.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4356375341287540026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7942515510619635240.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4356375...266
Read 1 LTL properties
Checking formula 0 : !(((((F("(((cX_2>=1)&&(cY_13>=1))&&((L_3>=1)&&(R_16>=1)))"))&&("((((cX_2>=1)&&(cY_8>=1))&&((L_8>=1)&&(R_11>=1)))||(((cX_2>=1)&&(cY_13>...360
Formula 0 simplified : !((("((((cX_2>=1)&&(cY_8>=1))&&((L_8>=1)&&(R_11>=1)))||(((cX_2>=1)&&(cY_13>=1))&&((L_3>=1)&&(R_16>=1))))" & F"(((cX_2>=1)&&(cY_13>=1...348
Detected timeout of ITS tools.
[2022-05-18 19:24:20] [INFO ] Flatten gal took : 21 ms
[2022-05-18 19:24:20] [INFO ] Applying decomposition
[2022-05-18 19:24:20] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph423698224758021085.txt' '-o' '/tmp/graph423698224758021085.bin' '-w' '/tmp/graph423698224758021085.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph423698224758021085.bin' '-l' '-1' '-v' '-w' '/tmp/graph423698224758021085.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:24:20] [INFO ] Decomposing Gal with order
[2022-05-18 19:24:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:24:20] [INFO ] Removed a total of 812 redundant transitions.
[2022-05-18 19:24:20] [INFO ] Flatten gal took : 61 ms
[2022-05-18 19:24:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-18 19:24:20] [INFO ] Time to serialize gal into /tmp/LTL13443388074257494511.gal : 3 ms
[2022-05-18 19:24:20] [INFO ] Time to serialize properties into /tmp/LTL10832182338677874487.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13443388074257494511.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10832182338677874487.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1344338...247
Read 1 LTL properties
Checking formula 0 : !(((((F("(((u2.cX_2>=1)&&(u28.cY_13>=1))&&((u32.L_3>=1)&&(u71.R_16>=1)))"))&&("((((u2.cX_2>=1)&&(u23.cY_8>=1))&&((u37.L_8>=1)&&(u66.R_...450
Formula 0 simplified : !((("((((u2.cX_2>=1)&&(u23.cY_8>=1))&&((u37.L_8>=1)&&(u66.R_11>=1)))||(((u2.cX_2>=1)&&(u28.cY_13>=1))&&((u32.L_3>=1)&&(u71.R_16>=1))...438
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2195113004689678542
[2022-05-18 19:24:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2195113004689678542
Running compilation step : cd /tmp/ltsmin2195113004689678542;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 382 ms.
Running link step : cd /tmp/ltsmin2195113004689678542;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2195113004689678542;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((<>((LTLAPp0==true))&&(LTLAPp1==true)) U !(X((LTLAPp0==true)) U (LTLAPp0==true)))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NQueens-PT-15-LTLFireability-15 finished in 103242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)&&p1) U !(X(p0) U p0))||G(p2)))'
Found a CL insensitive property : NQueens-PT-15-LTLFireability-15
Stuttering acceptance computed with spot in 281 ms :[(AND p0 (NOT p2)), (NOT p2), true, p0, p0, p0, (AND (NOT p2) p0), (AND p0 (NOT p2))]
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:24:51] [INFO ] Invariants computation overflowed in 13 ms
[2022-05-18 19:24:51] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:24:51] [INFO ] Invariants computation overflowed in 10 ms
[2022-05-18 19:24:51] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:24:51] [INFO ] Invariants computation overflowed in 14 ms
[2022-05-18 19:24:51] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Running random walk in product with property : NQueens-PT-15-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 6}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=0 dest: 7}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 3}], [{ cond=(AND p2 p0), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 2}], [{ cond=(AND p2 p0 p1), acceptance={} source=7 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=7 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s23 1) (GEQ s37 1) (GEQ s66 1)), p0:(AND (GEQ s2 1) (GEQ s28 1) (GEQ s32 1) (GEQ s71 1)), p1:(OR (AND (GEQ s2 1) (GEQ s23 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16538 reset in 2459 ms.
Product exploration explored 100000 steps with 16461 reset in 2479 ms.
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p2 p0 p1)), (X (NOT (AND p2 p0 p1))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 15 factoid took 1269 ms. Reduced automaton from 8 states, 24 edges and 3 AP to 8 states, 24 edges and 3 AP.
Stuttering acceptance computed with spot in 275 ms :[(NOT p2), (AND p0 (NOT p2)), true, p0, p0, p0, (AND (NOT p2) p0), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 721 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:24:58] [INFO ] Invariants computation overflowed in 17 ms
[2022-05-18 19:24:58] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (G (NOT (AND p2 (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND (NOT p2) (NOT p1) p0))), (G (NOT (AND (NOT p2) p1 (NOT p0)))), (G (NOT (AND p2 (NOT p1) p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p2 p0 p1)), (X (NOT (AND p2 p0 p1))), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 (NOT p0) p1)), (X (NOT (AND p2 (NOT p0) p1))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (AND p2 p1 (NOT p0))), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p1 p0)), (F (NOT (AND p2 p0))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (NOT p2)), (F (NOT (AND p2 p1 p0))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 20 factoid took 2355 ms. Reduced automaton from 8 states, 24 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 218 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, p0, p0, p0]
Stuttering acceptance computed with spot in 182 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, p0, p0, p0]
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:25:01] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:25:01] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:25:01] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:25:01] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:25:01] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:25:02] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), true, (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X p1), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 713 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 210 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, p0, p0, p0]
Finished random walk after 31 steps, including 2 resets, run visited all 6 properties in 4 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 p2 p1), true, (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X p1), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 702 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 1164 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, p0, p0, p0]
Stuttering acceptance computed with spot in 194 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, p0, p0, p0]
Stuttering acceptance computed with spot in 184 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, p0, p0, p0]
Product exploration explored 100000 steps with 16498 reset in 2396 ms.
Product exploration explored 100000 steps with 16459 reset in 2418 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 192 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, p0, p0, p0]
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2022-05-18 19:25:10] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:25:10] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:25:10] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Product exploration explored 100000 steps with 16491 reset in 2579 ms.
Product exploration explored 100000 steps with 16439 reset in 2604 ms.
Built C files in :
/tmp/ltsmin12000881533050641584
[2022-05-18 19:25:15] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12000881533050641584
Running compilation step : cd /tmp/ltsmin12000881533050641584;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 405 ms.
Running link step : cd /tmp/ltsmin12000881533050641584;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12000881533050641584;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12323997945791931376.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 225/225 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:25:30] [INFO ] Invariants computation overflowed in 20 ms
[2022-05-18 19:25:31] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:25:31] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:25:31] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2022-05-18 19:25:31] [INFO ] Invariants computation overflowed in 8 ms
[2022-05-18 19:25:31] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 225/225 transitions.
Built C files in :
/tmp/ltsmin7058378978105317582
[2022-05-18 19:25:31] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7058378978105317582
Running compilation step : cd /tmp/ltsmin7058378978105317582;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 392 ms.
Running link step : cd /tmp/ltsmin7058378978105317582;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7058378978105317582;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11625097229297390068.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 19:25:46] [INFO ] Flatten gal took : 16 ms
[2022-05-18 19:25:46] [INFO ] Flatten gal took : 16 ms
[2022-05-18 19:25:46] [INFO ] Time to serialize gal into /tmp/LTL9290106787034730025.gal : 2 ms
[2022-05-18 19:25:46] [INFO ] Time to serialize properties into /tmp/LTL10955038546975454749.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9290106787034730025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10955038546975454749.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9290106...267
Read 1 LTL properties
Checking formula 0 : !(((((F("(((cX_2>=1)&&(cY_13>=1))&&((L_3>=1)&&(R_16>=1)))"))&&("((((cX_2>=1)&&(cY_8>=1))&&((L_8>=1)&&(R_11>=1)))||(((cX_2>=1)&&(cY_13>...360
Formula 0 simplified : !((("((((cX_2>=1)&&(cY_8>=1))&&((L_8>=1)&&(R_11>=1)))||(((cX_2>=1)&&(cY_13>=1))&&((L_3>=1)&&(R_16>=1))))" & F"(((cX_2>=1)&&(cY_13>=1...348
Detected timeout of ITS tools.
[2022-05-18 19:26:01] [INFO ] Flatten gal took : 15 ms
[2022-05-18 19:26:01] [INFO ] Applying decomposition
[2022-05-18 19:26:01] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15594343114241195683.txt' '-o' '/tmp/graph15594343114241195683.bin' '-w' '/tmp/graph15594343114241195683.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15594343114241195683.bin' '-l' '-1' '-v' '-w' '/tmp/graph15594343114241195683.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:26:01] [INFO ] Decomposing Gal with order
[2022-05-18 19:26:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:26:01] [INFO ] Removed a total of 812 redundant transitions.
[2022-05-18 19:26:01] [INFO ] Flatten gal took : 27 ms
[2022-05-18 19:26:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-18 19:26:01] [INFO ] Time to serialize gal into /tmp/LTL5614578640464136973.gal : 2 ms
[2022-05-18 19:26:01] [INFO ] Time to serialize properties into /tmp/LTL357998109537567045.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5614578640464136973.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL357998109537567045.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5614578...244
Read 1 LTL properties
Checking formula 0 : !(((((F("(((u2.cX_2>=1)&&(u28.cY_13>=1))&&((u32.L_3>=1)&&(u71.R_16>=1)))"))&&("((((u2.cX_2>=1)&&(u23.cY_8>=1))&&((u37.L_8>=1)&&(u66.R_...450
Formula 0 simplified : !((("((((u2.cX_2>=1)&&(u23.cY_8>=1))&&((u37.L_8>=1)&&(u66.R_11>=1)))||(((u2.cX_2>=1)&&(u28.cY_13>=1))&&((u32.L_3>=1)&&(u71.R_16>=1))...438
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4006402730083094308
[2022-05-18 19:26:16] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4006402730083094308
Running compilation step : cd /tmp/ltsmin4006402730083094308;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 392 ms.
Running link step : cd /tmp/ltsmin4006402730083094308;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4006402730083094308;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((<>((LTLAPp0==true))&&(LTLAPp1==true)) U !(X((LTLAPp0==true)) U (LTLAPp0==true)))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NQueens-PT-15-LTLFireability-15 finished in 101169 ms.
[2022-05-18 19:26:31] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17441338000369067487
[2022-05-18 19:26:31] [INFO ] Computing symmetric may disable matrix : 225 transitions.
[2022-05-18 19:26:31] [INFO ] Applying decomposition
[2022-05-18 19:26:31] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:26:31] [INFO ] Computing symmetric may enable matrix : 225 transitions.
[2022-05-18 19:26:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:26:31] [INFO ] Flatten gal took : 13 ms
[2022-05-18 19:26:31] [INFO ] Computing Do-Not-Accords matrix : 225 transitions.
[2022-05-18 19:26:31] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:26:31] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17441338000369067487
Running compilation step : cd /tmp/ltsmin17441338000369067487;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14597394326263713024.txt' '-o' '/tmp/graph14597394326263713024.bin' '-w' '/tmp/graph14597394326263713024.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14597394326263713024.bin' '-l' '-1' '-v' '-w' '/tmp/graph14597394326263713024.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:26:31] [INFO ] Decomposing Gal with order
[2022-05-18 19:26:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:26:31] [INFO ] Removed a total of 812 redundant transitions.
[2022-05-18 19:26:31] [INFO ] Flatten gal took : 20 ms
[2022-05-18 19:26:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-18 19:26:31] [INFO ] Time to serialize gal into /tmp/LTLFireability16581288286093584892.gal : 2 ms
[2022-05-18 19:26:31] [INFO ] Time to serialize properties into /tmp/LTLFireability11967625018045980962.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16581288286093584892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11967625018045980962.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !(((((F("(((u2.cX_2>=1)&&(u28.cY_13>=1))&&((u32.L_3>=1)&&(u71.R_16>=1)))"))&&("((((u2.cX_2>=1)&&(u23.cY_8>=1))&&((u37.L_8>=1)&&(u66.R_...450
Formula 0 simplified : !((("((((u2.cX_2>=1)&&(u23.cY_8>=1))&&((u37.L_8>=1)&&(u66.R_11>=1)))||(((u2.cX_2>=1)&&(u28.cY_13>=1))&&((u32.L_3>=1)&&(u71.R_16>=1))...438
Compilation finished in 519 ms.
Running link step : cd /tmp/ltsmin17441338000369067487;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin17441338000369067487;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((<>((LTLAPp0==true))&&(LTLAPp1==true)) U !(X((LTLAPp0==true)) U (LTLAPp0==true)))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: LTL layer: formula: (((<>((LTLAPp0==true))&&(LTLAPp1==true)) U !(X((LTLAPp0==true)) U (LTLAPp0==true)))||[]((LTLAPp2==true)))
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: "(((<>((LTLAPp0==true))&&(LTLAPp1==true)) U !(X((LTLAPp0==true)) U (LTLAPp0==true)))||[]((LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.067: DFS-FIFO for weak LTL, using special progress label 229
pins2lts-mc-linux64( 0/ 8), 0.067: There are 230 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.067: State length is 85, there are 249 groups
pins2lts-mc-linux64( 0/ 8), 0.067: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.067: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.067: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.067: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 1.776: ~13 levels ~960 states ~12912 transitions
pins2lts-mc-linux64( 6/ 8), 2.064: ~13 levels ~1920 states ~16040 transitions
pins2lts-mc-linux64( 6/ 8), 2.112: ~13 levels ~3840 states ~23400 transitions
pins2lts-mc-linux64( 4/ 8), 2.815: ~14 levels ~7680 states ~43312 transitions
pins2lts-mc-linux64( 4/ 8), 3.103: ~15 levels ~15360 states ~76328 transitions
pins2lts-mc-linux64( 4/ 8), 4.535: ~15 levels ~30720 states ~148304 transitions
pins2lts-mc-linux64( 1/ 8), 5.845: ~14 levels ~61440 states ~283000 transitions
pins2lts-mc-linux64( 1/ 8), 7.537: ~14 levels ~122880 states ~621912 transitions
pins2lts-mc-linux64( 1/ 8), 12.756: ~14 levels ~245760 states ~1263080 transitions
pins2lts-mc-linux64( 1/ 8), 19.357: ~14 levels ~491520 states ~2573936 transitions
pins2lts-mc-linux64( 1/ 8), 22.163: ~15 levels ~983040 states ~5493112 transitions
pins2lts-mc-linux64( 1/ 8), 28.672: ~15 levels ~1966080 states ~12390816 transitions
pins2lts-mc-linux64( 1/ 8), 43.946: ~15 levels ~3932160 states ~25042632 transitions
pins2lts-mc-linux64( 6/ 8), 76.680: ~15 levels ~7864320 states ~49987880 transitions
pins2lts-mc-linux64( 5/ 8), 98.695: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 98.775:
pins2lts-mc-linux64( 0/ 8), 98.775: mean standard work distribution: 3.5% (states) 2.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 98.775:
pins2lts-mc-linux64( 0/ 8), 98.775: Explored 10081248 states 69227930 transitions, fanout: 6.867
pins2lts-mc-linux64( 0/ 8), 98.775: Total exploration time 98.690 sec (98.630 sec minimum, 98.649 sec on average)
pins2lts-mc-linux64( 0/ 8), 98.775: States per second: 102151, Transitions per second: 701468
pins2lts-mc-linux64( 0/ 8), 98.775:
pins2lts-mc-linux64( 0/ 8), 98.775: Progress states detected: 14920268
pins2lts-mc-linux64( 0/ 8), 98.775: Redundant explorations: -59.6846
pins2lts-mc-linux64( 0/ 8), 98.775:
pins2lts-mc-linux64( 0/ 8), 98.775: Queue width: 8B, total height: 14922148, memory: 113.85MB
pins2lts-mc-linux64( 0/ 8), 98.775: Tree memory: 446.8MB, 18.7 B/state, compr.: 5.5%
pins2lts-mc-linux64( 0/ 8), 98.775: Tree fill ratio (roots/leafs): 18.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 98.775: Stored 225 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 98.775: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 98.775: Est. total memory use: 560.6MB (~1137.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17441338000369067487;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((<>((LTLAPp0==true))&&(LTLAPp1==true)) U !(X((LTLAPp0==true)) U (LTLAPp0==true)))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17441338000369067487;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((<>((LTLAPp0==true))&&(LTLAPp1==true)) U !(X((LTLAPp0==true)) U (LTLAPp0==true)))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-18 19:47:57] [INFO ] Flatten gal took : 169 ms
[2022-05-18 19:47:58] [INFO ] Time to serialize gal into /tmp/LTLFireability10427550309090454683.gal : 68 ms
[2022-05-18 19:47:58] [INFO ] Time to serialize properties into /tmp/LTLFireability14023085695950250996.ltl : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10427550309090454683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14023085695950250996.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...290
Read 1 LTL properties
Checking formula 0 : !(((((F("(((cX_2>=1)&&(cY_13>=1))&&((L_3>=1)&&(R_16>=1)))"))&&("((((cX_2>=1)&&(cY_8>=1))&&((L_8>=1)&&(R_11>=1)))||(((cX_2>=1)&&(cY_13>...360
Formula 0 simplified : !((("((((cX_2>=1)&&(cY_8>=1))&&((L_8>=1)&&(R_11>=1)))||(((cX_2>=1)&&(cY_13>=1))&&((L_3>=1)&&(R_16>=1))))" & F"(((cX_2>=1)&&(cY_13>=1...348
Detected timeout of ITS tools.
[2022-05-18 20:09:37] [INFO ] Flatten gal took : 260 ms
[2022-05-18 20:09:38] [INFO ] Input system was already deterministic with 225 transitions.
[2022-05-18 20:09:38] [INFO ] Transformed 84 places.
[2022-05-18 20:09:38] [INFO ] Transformed 225 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
java.lang.NullPointerException
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.computeOrderWithGreatSPN(MultiOrderRunner.java:57)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:135)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:737)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 20:09:38] [INFO ] Time to serialize gal into /tmp/LTLFireability10157904193794509391.gal : 20 ms
[2022-05-18 20:09:38] [INFO ] Time to serialize properties into /tmp/LTLFireability15577025898823058787.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10157904193794509391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15577025898823058787.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((((F("(((cX_2>=1)&&(cY_13>=1))&&((L_3>=1)&&(R_16>=1)))"))&&("((((cX_2>=1)&&(cY_8>=1))&&((L_8>=1)&&(R_11>=1)))||(((cX_2>=1)&&(cY_13>...360
Formula 0 simplified : !((("((((cX_2>=1)&&(cY_8>=1))&&((L_8>=1)&&(R_11>=1)))||(((cX_2>=1)&&(cY_13>=1))&&((L_3>=1)&&(R_16>=1))))" & F"(((cX_2>=1)&&(cY_13>=1...348

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NQueens-PT-15"
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-15, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271821500924"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-15.tgz
mv NQueens-PT-15 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;