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-171654372300233.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-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372300233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 03:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 12 03:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K 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 203K 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-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 1716682449532

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-15
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 00:14:11] [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:14:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:14:11] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-26 00:14:11] [INFO ] Transformed 315 places.
[2024-05-26 00:14:11] [INFO ] Transformed 225 transitions.
[2024-05-26 00:14:11] [INFO ] Found NUPN structural information;
[2024-05-26 00:14:11] [INFO ] Parsed PT model containing 315 places and 225 transitions and 1125 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-15-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-15-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-15-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 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 19 ms. Remains 88 /313 variables (removed 225) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 88 cols
[2024-05-26 00:14:11] [INFO ] Computed 7 invariants in 43 ms
[2024-05-26 00:14:12] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-26 00:14:12] [INFO ] Invariant cache hit.
[2024-05-26 00:14:46] [INFO ] Performed 58/88 implicitness test of which 2 returned IMPLICIT in 34 seconds.
[2024-05-26 00:14:50] [INFO ] Implicit Places using invariants and state equation in 38717 ms returned [30, 58, 59, 87]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 39083 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 14 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39116 ms. Remains : 84/313 places, 225/225 transitions.
Support contains 67 out of 84 places after structural reductions.
[2024-05-26 00:14:51] [INFO ] Flatten gal took : 51 ms
[2024-05-26 00:14:51] [INFO ] Flatten gal took : 24 ms
[2024-05-26 00:14:51] [INFO ] Input system was already deterministic with 225 transitions.
Finished random walk after 42 steps, including 3 resets, run visited all 33 properties in 31 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 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).
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((X(X(p0))||G(p1))))'
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 5 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:14:51] [INFO ] Invariants computation overflowed in 19 ms
[2024-05-26 00:14:51] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:14:51] [INFO ] Invariants computation overflowed in 12 ms
[2024-05-26 00:15:02] [INFO ] Implicit Places using invariants and state equation in 10550 ms returned []
Implicit Place search using SMT with State Equation took 10668 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:15:02] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-26 00:15:02] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10804 ms. Remains : 84/84 places, 225/225 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 317 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s26 1) (EQ s33 1) (EQ s68 1)), p0:(OR (EQ s1 0) (EQ s26 0) (EQ s33 0) (EQ s68 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 31 steps with 6 reset in 5 ms.
FORMULA NQueens-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-00 finished in 11185 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(F(((p0 U p1)&&G(F(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 3 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:15:02] [INFO ] Invariants computation overflowed in 19 ms
[2024-05-26 00:15:02] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:15:02] [INFO ] Invariants computation overflowed in 14 ms
[2024-05-26 00:15:09] [INFO ] Implicit Places using invariants and state equation in 6253 ms returned []
Implicit Place search using SMT with State Equation took 6389 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:15:09] [INFO ] Invariants computation overflowed in 15 ms
[2024-05-26 00:15:09] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6488 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s14 0) (EQ s22 0) (EQ s50 0) (EQ s77 0) (AND (EQ s8 1) (EQ s17 1) (EQ s49 1) (EQ s66 1))), p1:(AND (EQ s0 1) (EQ s21 1) (EQ s37 1) (EQ s62 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]]
Stuttering criterion allowed to conclude after 240 steps with 21 reset in 13 ms.
FORMULA NQueens-PT-15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-01 finished in 6711 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))'
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
[2024-05-26 00:15:09] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 00:15:09] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:15:09] [INFO ] Invariants computation overflowed in 9 ms
[2024-05-26 00:15:26] [INFO ] Implicit Places using invariants and state equation in 16675 ms returned []
Implicit Place search using SMT with State Equation took 16770 ms to find 0 implicit places.
[2024-05-26 00:15:26] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:15:26] [INFO ] Invariants computation overflowed in 11 ms
[2024-05-26 00:15:26] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16899 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s28 0) (EQ s38 0) (EQ s77 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19460 reset in 2301 ms.
Product exploration explored 100000 steps with 19577 reset in 2251 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 : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-04 finished in 21662 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(((!p1&&F((G(!p1)&&F(!p2))))||G((F(!p2)&&F(G(!p1))))||p0)))'
Support contains 12 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.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:15:31] [INFO ] Invariants computation overflowed in 13 ms
[2024-05-26 00:15:31] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:15:31] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 00:15:39] [INFO ] Implicit Places using invariants and state equation in 8289 ms returned []
Implicit Place search using SMT with State Equation took 8402 ms to find 0 implicit places.
[2024-05-26 00:15:39] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:15:39] [INFO ] Invariants computation overflowed in 13 ms
[2024-05-26 00:15:39] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8529 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p2)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s14 0) (EQ s18 0) (EQ s54 0) (EQ s73 0)), p1:(AND (EQ s13 1) (EQ s24 1) (EQ s47 1) (EQ s78 1)), p2:(AND (EQ s7 1) (EQ s22 1) (EQ s43 1) (EQ s70...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 22613 reset in 2364 ms.
Product exploration explored 100000 steps with 22660 reset in 2371 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 (NOT p0) p1 p2), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (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)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-06 finished in 13585 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(p0) U G(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 2 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:15:44] [INFO ] Invariants computation overflowed in 11 ms
[2024-05-26 00:15:44] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:15:44] [INFO ] Invariants computation overflowed in 7 ms
[2024-05-26 00:15:55] [INFO ] Implicit Places using invariants and state equation in 10130 ms returned []
Implicit Place search using SMT with State Equation took 10222 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:15:55] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 00:15:55] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10324 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s18 1) (EQ s51 1) (EQ s70 1)), p0:(AND (EQ s14 1) (EQ s25 1) (EQ s47 1) (EQ s80 1))], 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]]
Entered a terminal (fully accepting) state of product in 34 steps with 12 reset in 1 ms.
FORMULA NQueens-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-07 finished in 10492 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((F(p0)&&G(F((G(!p1)||(!p1&&F(!p2))))))))'
Support contains 11 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
[2024-05-26 00:15:55] [INFO ] Invariants computation overflowed in 12 ms
[2024-05-26 00:15:55] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:15:55] [INFO ] Invariants computation overflowed in 7 ms
[2024-05-26 00:16:02] [INFO ] Implicit Places using invariants and state equation in 6829 ms returned []
Implicit Place search using SMT with State Equation took 6923 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:16:02] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 00:16:02] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7014 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, (AND p1 p2), p1]
Running random walk in product with property : NQueens-PT-15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s20 0) (EQ s50 0) (EQ s73 0)), p1:(OR (AND (EQ s12 1) (EQ s20 1) (EQ s50 1) (EQ s73 1)) (AND (EQ s0 1) (EQ s20 1) (EQ s38 1) (EQ s61...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13413 reset in 1992 ms.
Product exploration explored 100000 steps with 13441 reset in 1973 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 (NOT p0) p1 p2), true, (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 11 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-08 finished in 11386 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(p1)))||G(p2)))'
Support contains 11 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.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:16:06] [INFO ] Invariants computation overflowed in 15 ms
[2024-05-26 00:16:06] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:16:06] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 00:16:11] [INFO ] Implicit Places using invariants and state equation in 5013 ms returned []
Implicit Place search using SMT with State Equation took 5112 ms to find 0 implicit places.
[2024-05-26 00:16:11] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:16:11] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 00:16:11] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5216 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-15-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s14 1) (EQ s24 1) (EQ s48 1) (EQ s79 1)), p0:(AND (EQ s12 1) (EQ s29 1) (EQ s41 1) (EQ s82 1)), p1:(OR (EQ s13 0) (EQ s25 0) (EQ s46 0) (EQ s7...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7210 reset in 1376 ms.
Product exploration explored 100000 steps with 7205 reset in 1394 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 (NOT p1)), (F (G (NOT p2))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (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 4 factoid took 15 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-09 finished in 8208 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(((!p0||X(F((!p1 U (p2||G(!p1)))))) U (G((!p0||X(F((!p1 U (p2||G(!p1)))))))||(!p0&&F(p3))))))'
Support contains 16 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
[2024-05-26 00:16:14] [INFO ] Invariants computation overflowed in 9 ms
[2024-05-26 00:16:14] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:16:14] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 00:16:25] [INFO ] Implicit Places using invariants and state equation in 10562 ms returned []
Implicit Place search using SMT with State Equation took 10652 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:16:25] [INFO ] Invariants computation overflowed in 10 ms
[2024-05-26 00:16:25] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10746 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND (NOT p2) p1), (AND (NOT p3) p0 (NOT p2) p1), (AND (NOT p3) (NOT p2) p1)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s28 1) (EQ s31 1) (EQ s70 1)), p3:(AND (EQ s6 1) (EQ s22 1) (EQ s42 1) (EQ s69 1)), p2:(AND (NOT (AND (EQ s4 1) (EQ s26 1) (EQ s36 1...], 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]]
Product exploration explored 100000 steps with 15243 reset in 1969 ms.
Product exploration explored 100000 steps with 15336 reset in 2005 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 p3 (NOT p2) p1), (F (G (NOT p0))), (F (G (NOT p3))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (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 5 factoid took 15 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-10 finished in 15074 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((X(X((X(G(p2))&&p1)))||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 2 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:16:29] [INFO ] Invariants computation overflowed in 12 ms
[2024-05-26 00:16:30] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:16:30] [INFO ] Invariants computation overflowed in 7 ms
[2024-05-26 00:16:48] [INFO ] Implicit Places using invariants and state equation in 18280 ms returned []
Implicit Place search using SMT with State Equation took 18364 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:16:48] [INFO ] Invariants computation overflowed in 15 ms
[2024-05-26 00:16:48] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18467 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NQueens-PT-15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s27 0) (EQ s44 0) (EQ s81 0)), p1:(AND (EQ s8 1) (EQ s18 1) (EQ s48 1) (EQ s67 1)), p2:(AND (EQ s6 1) (EQ s25 1) (EQ s39 1) (EQ s72 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19711 reset in 2228 ms.
Product exploration explored 100000 steps with 19724 reset in 2262 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 (NOT p0) p1 p2), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
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 4 factoid took 15 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-11 finished in 23236 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(F(p0))||(F(!p1) U ((X(!p0)&&F(!p1))||G(F(!p1))))))'
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 5 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:16:53] [INFO ] Invariants computation overflowed in 9 ms
[2024-05-26 00:16:53] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:16:53] [INFO ] Invariants computation overflowed in 7 ms
[2024-05-26 00:17:04] [INFO ] Implicit Places using invariants and state equation in 11024 ms returned []
Implicit Place search using SMT with State Equation took 11116 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:17:04] [INFO ] Invariants computation overflowed in 15 ms
[2024-05-26 00:17:04] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11216 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) p1), false, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s18 1) (EQ s46 1) (EQ s65 1)), p1:(AND (EQ s12 1) (EQ s24 1) (EQ s46 1) (EQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 20031 reset in 2230 ms.
Product exploration explored 100000 steps with 19901 reset in 2254 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), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-12 finished in 15985 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((X(p1)||p0))))'
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
[2024-05-26 00:17:09] [INFO ] Invariants computation overflowed in 10 ms
[2024-05-26 00:17:09] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:17:09] [INFO ] Invariants computation overflowed in 9 ms
[2024-05-26 00:17:18] [INFO ] Implicit Places using invariants and state equation in 9435 ms returned []
Implicit Place search using SMT with State Equation took 9536 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:17:18] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 00:17:18] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9631 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s3 1) (EQ s18 1) (EQ s43 1) (EQ s62 1)), p0:(OR (EQ s2 0) (EQ s28 0) (EQ s32 0) (EQ s71 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-13 finished in 9771 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((F(p0) U (p1||X(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 8 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:17:18] [INFO ] Invariants computation overflowed in 16 ms
[2024-05-26 00:17:19] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:17:19] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 00:17:36] [INFO ] Implicit Places using invariants and state equation in 17626 ms returned []
Implicit Place search using SMT with State Equation took 17726 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:17:36] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 00:17:36] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17824 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s6 1) (EQ s15 1) (EQ s49 1) (EQ s62 1)), p0:(AND (EQ s1 1) (EQ s24 1) (EQ s35 1) (EQ s66 1)), p2:(AND (EQ s9 1) (EQ s25 1) (EQ s42 1) (EQ s75 ...], 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]]
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 17997 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((X(X(p1))||p0))))'
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 2 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:17:36] [INFO ] Invariants computation overflowed in 14 ms
[2024-05-26 00:17:37] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:17:37] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 00:17:49] [INFO ] Implicit Places using invariants and state equation in 12556 ms returned []
Implicit Place search using SMT with State Equation took 12664 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 84 cols
[2024-05-26 00:17:49] [INFO ] Invariants computation overflowed in 13 ms
[2024-05-26 00:17:49] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12768 ms. Remains : 84/84 places, 225/225 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : NQueens-PT-15-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s18 0) (EQ s40 0) (EQ s59 0)), p1:(OR (EQ s5 0) (EQ s22 0) (EQ s41 0) (EQ s68 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 82 steps with 9 reset in 2 ms.
FORMULA NQueens-PT-15-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-15 finished in 12956 ms.
All properties solved by simple procedures.
Total runtime 218590 ms.

BK_STOP 1716682671126

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-15"
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-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 r263-tall-171654372300233"
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 ;