Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 03:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 03:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 03:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 349K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716682679883

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NQueens-PT-20
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 00:18:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 00:18:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:18:01] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-26 00:18:01] [INFO ] Transformed 520 places.
[2024-05-26 00:18:01] [INFO ] Transformed 400 transitions.
[2024-05-26 00:18:01] [INFO ] Found NUPN structural information;
[2024-05-26 00:18:01] [INFO ] Parsed PT model containing 520 places and 400 transitions and 2000 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-20-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 400/400 transitions.
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 118 transition count 400
Applied a total of 400 rules in 17 ms. Remains 118 /518 variables (removed 400) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 118 cols
[2024-05-26 00:18:01] [INFO ] Invariants computation overflowed in 57 ms
[2024-05-26 00:18:02] [INFO ] Implicit Places using invariants in 491 ms returned []
// Phase 1: matrix 400 rows 118 cols
[2024-05-26 00:18:02] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-26 00:18:30] [INFO ] Implicit Places using invariants and state equation in 28572 ms returned [40, 117]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 29098 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/518 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29119 ms. Remains : 116/518 places, 400/400 transitions.
Support contains 69 out of 116 places after structural reductions.
[2024-05-26 00:18:31] [INFO ] Flatten gal took : 70 ms
[2024-05-26 00:18:31] [INFO ] Flatten gal took : 37 ms
[2024-05-26 00:18:31] [INFO ] Input system was already deterministic with 400 transitions.
Support contains 66 out of 116 places (down from 69) after GAL structural reductions.
Finished random walk after 15 steps, including 0 resets, run visited all 30 properties in 222 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 116 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116 transition count 400
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(G(p1))||p0))||F(p2)))'
Support contains 8 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:18:31] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-26 00:18:31] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:18:31] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-26 00:19:10] [INFO ] Performed 115/116 implicitness test of which 2 returned IMPLICIT in 38 seconds.
[2024-05-26 00:19:10] [INFO ] Implicit Places using invariants and state equation in 38198 ms returned [77, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 38374 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/116 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38389 ms. Remains : 114/116 places, 400/400 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 255 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NQueens-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(OR (EQ s16 0) (EQ s34 0) (EQ s60 0) (EQ s106 0)), p0:(OR (EQ s17 0) (EQ s27 0) (EQ s68 0) (EQ s100 0)), p1:(OR (EQ s17 0) (EQ s27 0) (EQ s68 0) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 18096 reset in 4575 ms.
Product exploration explored 100000 steps with 18136 reset in 4534 ms.
Computed a total of 114 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 114 transition count 400
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (F (G p2)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-20-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-20-LTLFireability-00 finished in 48184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(G(((p3 U p4)&&p2)))))'
Support contains 15 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:19:19] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-26 00:19:20] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:19:20] [INFO ] Invariants computation overflowed in 17 ms
[2024-05-26 00:22:00] [INFO ] Performed 76/116 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2024-05-26 00:22:00] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2024-05-26 00:22:00] [INFO ] Implicit Places using invariants and state equation in 160052 ms returned []
Implicit Place search using SMT with State Equation took 160194 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:22:00] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-26 00:22:00] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160411 ms. Remains : 116/116 places, 400/400 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p4) (NOT p1) (NOT p2)), true, (NOT p1), (OR (NOT p4) (NOT p2)), (NOT p4)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={} source=3 dest: 1}, { cond=(OR (AND p2 p4) (AND p2 p3)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p4) p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p4) p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s14 1) (EQ s24 1) (EQ s68 1) (EQ s96 1)), p0:(AND (EQ s9 1) (EQ s32 1) (EQ s55 1) (EQ s99 1)), p2:(AND (EQ s17 1) (EQ s29 1) (EQ s66 1) (EQ s1...], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 3 ms.
FORMULA NQueens-PT-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-01 finished in 160700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 400/400 transitions.
Applied a total of 0 rules in 10 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:22:00] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-26 00:22:00] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:22:00] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-26 00:22:37] [INFO ] Performed 77/116 implicitness test of which 1 returned IMPLICIT in 36 seconds.
[2024-05-26 00:22:48] [INFO ] Implicit Places using invariants and state equation in 47458 ms returned [77, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 47609 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/116 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47622 ms. Remains : 114/116 places, 400/400 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s0 0) (EQ s33 0) (EQ s45 0) (EQ s89 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-03 finished in 47712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((X(X(p1))&&F((p2&&G(p3)))))))'
Support contains 16 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:22:48] [INFO ] Invariants computation overflowed in 20 ms
[2024-05-26 00:22:48] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:22:48] [INFO ] Invariants computation overflowed in 18 ms
[2024-05-26 00:23:39] [INFO ] Performed 77/116 implicitness test of which 1 returned IMPLICIT in 50 seconds.
[2024-05-26 00:24:14] [INFO ] Performed 115/116 implicitness test of which 2 returned IMPLICIT in 85 seconds.
[2024-05-26 00:24:14] [INFO ] Implicit Places using invariants and state equation in 85986 ms returned [77, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 86123 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/116 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86135 ms. Remains : 114/116 places, 400/400 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s17 0) (EQ s32 0) (EQ s63 0) (EQ s105 0)), p2:(OR (EQ s12 0) (EQ s21 0) (EQ s69 0) (EQ s89 0)), p3:(OR (EQ s7 0) (EQ s23 0) (EQ s62 0) (EQ s86 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 18046 reset in 4636 ms.
Product exploration explored 100000 steps with 18139 reset in 4677 ms.
Computed a total of 114 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 114 transition count 400
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) p1), (F (G p0)), (F (G p2)), (F (G p3)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p2 p3)), (X (NOT (AND (NOT p0) p2 p3))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2 p3))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-20-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-20-LTLFireability-05 finished in 96116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 8 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:24:24] [INFO ] Invariants computation overflowed in 19 ms
[2024-05-26 00:24:24] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:24:24] [INFO ] Invariants computation overflowed in 17 ms
[2024-05-26 00:25:06] [INFO ] Performed 77/116 implicitness test of which 1 returned IMPLICIT in 41 seconds.
[2024-05-26 00:25:07] [INFO ] Implicit Places using invariants and state equation in 43102 ms returned [77, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 43267 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/116 places, 400/400 transitions.
Applied a total of 0 rules in 11 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43287 ms. Remains : 114/116 places, 400/400 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s8 1) (EQ s36 1) (EQ s50 1) (EQ s100 1)), p0:(AND (EQ s19 1) (EQ s38 1) (EQ s59 1) (EQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-20-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-06 finished in 43399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p1))&&p0)))'
Support contains 8 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:25:07] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-26 00:25:08] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:25:08] [INFO ] Invariants computation overflowed in 21 ms
[2024-05-26 00:25:43] [INFO ] Performed 76/116 implicitness test of which 0 returned IMPLICIT in 35 seconds.
[2024-05-26 00:25:58] [INFO ] Implicit Places using invariants and state equation in 50953 ms returned [77, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 51105 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/116 places, 400/400 transitions.
Applied a total of 0 rules in 11 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 51121 ms. Remains : 114/116 places, 400/400 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s32 1) (EQ s62 1) (EQ s104 1)), p1:(AND (EQ s11 1) (EQ s20 1) (EQ s69 1) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-07 finished in 51249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G(p1)))))'
Support contains 8 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:25:59] [INFO ] Invariants computation overflowed in 18 ms
[2024-05-26 00:25:59] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:25:59] [INFO ] Invariants computation overflowed in 22 ms
[2024-05-26 00:26:31] [INFO ] Performed 77/116 implicitness test of which 1 returned IMPLICIT in 32 seconds.
[2024-05-26 00:26:52] [INFO ] Implicit Places using invariants and state equation in 53336 ms returned [77, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 53484 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/116 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53491 ms. Remains : 114/116 places, 400/400 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s0 0) (EQ s21 0) (EQ s57 0) (EQ s77 0)), p1:(OR (EQ s12 0) (EQ s31 0) (EQ s59 0) (EQ s99 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 15570 reset in 4585 ms.
Product exploration explored 100000 steps with 15718 reset in 4458 ms.
Computed a total of 114 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 114 transition count 400
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-20-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-20-LTLFireability-08 finished in 63016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p1))||G(p2)||p0))))'
Support contains 12 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:27:02] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-26 00:27:02] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:27:02] [INFO ] Invariants computation overflowed in 16 ms
[2024-05-26 00:27:18] [INFO ] Implicit Places using invariants and state equation in 15946 ms returned [77, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 16084 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/116 places, 400/400 transitions.
Applied a total of 0 rules in 1 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16088 ms. Remains : 114/116 places, 400/400 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : NQueens-PT-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s17 0) (EQ s28 0) (EQ s67 0) (EQ s101 0)), p2:(AND (EQ s8 1) (EQ s25 1) (EQ s61 1) (EQ s89 1)), p1:(OR (EQ s13 0) (EQ s36 0) (EQ s55 0) (EQ s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7100 reset in 2698 ms.
Product exploration explored 100000 steps with 7133 reset in 2713 ms.
Computed a total of 114 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 114 transition count 400
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (F (G p0)), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-20-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-20-LTLFireability-10 finished in 22039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 8 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:27:24] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-26 00:27:24] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:27:24] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-26 00:28:34] [INFO ] Performed 77/116 implicitness test of which 1 returned IMPLICIT in 69 seconds.
[2024-05-26 00:28:44] [INFO ] Implicit Places using invariants and state equation in 80486 ms returned [77, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 80630 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/116 places, 400/400 transitions.
Applied a total of 0 rules in 1 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80634 ms. Remains : 114/116 places, 400/400 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s32 1) (EQ s47 1) (EQ s89 1)), p1:(AND (EQ s5 1) (EQ s20 1) (EQ s63 1) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 4 reset in 1 ms.
FORMULA NQueens-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-11 finished in 80878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 8 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 400/400 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:28:45] [INFO ] Invariants computation overflowed in 21 ms
[2024-05-26 00:28:45] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:28:45] [INFO ] Invariants computation overflowed in 17 ms
[2024-05-26 00:29:24] [INFO ] Performed 115/116 implicitness test of which 2 returned IMPLICIT in 38 seconds.
[2024-05-26 00:29:24] [INFO ] Implicit Places using invariants and state equation in 39013 ms returned [77, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 39153 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/116 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39162 ms. Remains : 114/116 places, 400/400 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s14 1) (EQ s33 1) (EQ s59 1) (EQ s103 1)), p0:(AND (EQ s17 1) (EQ s27 1) (EQ s68 1) (EQ s100 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 1 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-12 finished in 39293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(!p1))))'
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:29:24] [INFO ] Invariants computation overflowed in 18 ms
[2024-05-26 00:29:24] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:29:24] [INFO ] Invariants computation overflowed in 20 ms
[2024-05-26 00:30:04] [INFO ] Performed 76/116 implicitness test of which 0 returned IMPLICIT in 39 seconds.
[2024-05-26 00:30:11] [INFO ] Implicit Places using invariants and state equation in 46960 ms returned []
Implicit Place search using SMT with State Equation took 47098 ms to find 0 implicit places.
[2024-05-26 00:30:11] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:30:11] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-26 00:30:11] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47296 ms. Remains : 116/116 places, 400/400 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : NQueens-PT-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s20 0) (EQ s77 0) (EQ s97 0)), p1:(AND (EQ s0 1) (EQ s20 1) (EQ s58 1) (EQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5403 reset in 2506 ms.
Product exploration explored 100000 steps with 5405 reset in 2543 ms.
Computed a total of 116 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116 transition count 400
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (OR (NOT p0) p1)), (X (NOT (OR (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-20-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-20-LTLFireability-13 finished in 52825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 8 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:30:17] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-26 00:30:17] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2024-05-26 00:30:17] [INFO ] Invariants computation overflowed in 17 ms
[2024-05-26 00:30:57] [INFO ] Performed 77/116 implicitness test of which 1 returned IMPLICIT in 39 seconds.
[2024-05-26 00:31:19] [INFO ] Implicit Places using invariants and state equation in 62678 ms returned [77, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 62826 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/116 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62834 ms. Remains : 114/116 places, 400/400 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s18 1) (EQ s30 1) (EQ s66 1) (EQ s104 1)), p1:(OR (AND (EQ s18 1) (EQ s30 1) (EQ s66 1) (EQ s104 1)) (AND (EQ s8 1) (EQ s31 1) (EQ s55 1) (EQ ...], 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 17 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-15 finished in 62931 ms.
All properties solved by simple procedures.
Total runtime 798727 ms.

BK_STOP 1716683481320

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NQueens-PT-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is NQueens-PT-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654372400238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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