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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.5K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 12 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 12 03:19 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 65K 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-08-LTLFireability-00
FORMULA_NAME NQueens-PT-08-LTLFireability-01
FORMULA_NAME NQueens-PT-08-LTLFireability-02
FORMULA_NAME NQueens-PT-08-LTLFireability-03
FORMULA_NAME NQueens-PT-08-LTLFireability-04
FORMULA_NAME NQueens-PT-08-LTLFireability-05
FORMULA_NAME NQueens-PT-08-LTLFireability-06
FORMULA_NAME NQueens-PT-08-LTLFireability-07
FORMULA_NAME NQueens-PT-08-LTLFireability-08
FORMULA_NAME NQueens-PT-08-LTLFireability-09
FORMULA_NAME NQueens-PT-08-LTLFireability-10
FORMULA_NAME NQueens-PT-08-LTLFireability-11
FORMULA_NAME NQueens-PT-08-LTLFireability-12
FORMULA_NAME NQueens-PT-08-LTLFireability-13
FORMULA_NAME NQueens-PT-08-LTLFireability-14
FORMULA_NAME NQueens-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716682129802

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-08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 00:08:51] [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:08:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:08:51] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2024-05-26 00:08:51] [INFO ] Transformed 112 places.
[2024-05-26 00:08:51] [INFO ] Transformed 64 transitions.
[2024-05-26 00:08:51] [INFO ] Found NUPN structural information;
[2024-05-26 00:08:51] [INFO ] Parsed PT model containing 112 places and 64 transitions and 320 arcs in 109 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 5 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 46 transition count 64
Applied a total of 64 rules in 11 ms. Remains 46 /110 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 46 cols
[2024-05-26 00:08:51] [INFO ] Computed 7 invariants in 16 ms
[2024-05-26 00:08:51] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-26 00:08:51] [INFO ] Invariant cache hit.
[2024-05-26 00:08:51] [INFO ] Implicit Places using invariants and state equation in 172 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 355 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/110 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 370 ms. Remains : 45/110 places, 64/64 transitions.
Support contains 39 out of 45 places after structural reductions.
[2024-05-26 00:08:52] [INFO ] Flatten gal took : 26 ms
[2024-05-26 00:08:52] [INFO ] Flatten gal took : 11 ms
[2024-05-26 00:08:52] [INFO ] Input system was already deterministic with 64 transitions.
Support contains 38 out of 45 places (down from 39) after GAL structural reductions.
Finished random walk after 5 steps, including 0 resets, run visited all 25 properties in 7 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
FORMULA NQueens-PT-08-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 45 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 45 transition count 64
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(((p0 U p1)&&F(p2)&&G(p3))))'
Support contains 14 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 45 cols
[2024-05-26 00:08:52] [INFO ] Computed 6 invariants in 5 ms
[2024-05-26 00:08:52] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-26 00:08:52] [INFO ] Invariant cache hit.
[2024-05-26 00:08:53] [INFO ] Implicit Places using invariants and state equation in 375 ms returned [29, 30, 44]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 480 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/45 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 483 ms. Remains : 42/45 places, 64/64 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 394 ms :[(NOT p3), (OR (NOT p3) (NOT p2)), (OR (NOT p1) (NOT p3)), true, (OR (NOT p3) (NOT p2) (NOT p1)), (OR (NOT p3) (NOT p2) (NOT p1))]
Running random walk in product with property : NQueens-PT-08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 p3), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={0} source=1 dest: 1}, { cond=(NOT p3), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 p3), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p2 p3), acceptance={0} source=5 dest: 0}, { cond=(AND p1 (NOT p2) p3), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={0} source=5 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p3:(AND (EQ s3 1) (EQ s12 1) (EQ s21 1) (EQ s35 1)), p2:(AND (EQ s3 1) (EQ s14 1) (EQ s19 1) (EQ s37 1)), p1:(AND (EQ s4 1) (EQ s10 1) (EQ s24 1) (EQ s34 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLFireability-00 finished in 936 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((p0||X(F(p1))))) U X(p2)))'
Support contains 10 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-26 00:08:53] [INFO ] Invariant cache hit.
[2024-05-26 00:08:53] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-26 00:08:53] [INFO ] Invariant cache hit.
[2024-05-26 00:08:54] [INFO ] Implicit Places using invariants and state equation in 513 ms returned [29, 30, 44]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 633 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/45 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 636 ms. Remains : 42/45 places, 64/64 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s11 1) (EQ s20 1) (EQ s32 1)), p2:(AND (EQ s2 1) (EQ s11 1) (EQ s21 1) (EQ s33 1)), p1:(AND (EQ s2 1) (EQ s9 1) (EQ s23 1) (EQ s31 1...], nbAcceptance=0, 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 9 steps with 1 reset in 0 ms.
FORMULA NQueens-PT-08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLFireability-02 finished in 828 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)))'
Support contains 4 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-26 00:08:54] [INFO ] Invariant cache hit.
[2024-05-26 00:08:54] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-26 00:08:54] [INFO ] Invariant cache hit.
[2024-05-26 00:08:54] [INFO ] Implicit Places using invariants and state equation in 428 ms returned [29, 30, 44]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 538 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/45 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 544 ms. Remains : 42/45 places, 64/64 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s13 1) (EQ s23 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLFireability-03 finished in 659 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 p1)&&G((p2||X(X(p1))))))'
Support contains 12 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-26 00:08:55] [INFO ] Invariant cache hit.
[2024-05-26 00:08:55] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-26 00:08:55] [INFO ] Invariant cache hit.
[2024-05-26 00:08:55] [INFO ] Implicit Places using invariants and state equation in 538 ms returned [29, 30, 44]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 643 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/45 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 645 ms. Remains : 42/45 places, 64/64 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), true, (NOT p0), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : NQueens-PT-08-LTLFireability-04 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=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 4}, { cond=(OR p1 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s13 1) (EQ s21 1) (EQ s37 1)), p0:(AND (EQ s3 1) (EQ s11 1) (EQ s22 1) (EQ s34 1)), p2:(AND (EQ s0 1) (EQ s12 1) (EQ s18 1) (EQ s32 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLFireability-04 finished in 931 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(X(G(p0)))))'
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-26 00:08:56] [INFO ] Invariant cache hit.
[2024-05-26 00:08:56] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-26 00:08:56] [INFO ] Invariant cache hit.
[2024-05-26 00:08:56] [INFO ] Implicit Places using invariants and state equation in 583 ms returned [29, 30, 44]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 702 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/45 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 707 ms. Remains : 42/45 places, 64/64 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (OR (EQ s0 0) (EQ s10 0) (EQ s20 0) (EQ s30 0)) (OR (EQ s6 0) (EQ s12 0) (EQ s24 0) (EQ s38 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 2 reset in 0 ms.
FORMULA NQueens-PT-08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLFireability-06 finished in 904 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(p1)||p0))||((!p2 U (p3||G(!p2))) U ((F(!p4)&&(!p2 U (p3||G(!p2))))||G((!p2 U (p3||G(!p2))))))))'
Support contains 14 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-26 00:08:56] [INFO ] Invariant cache hit.
[2024-05-26 00:08:57] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-26 00:08:57] [INFO ] Invariant cache hit.
[2024-05-26 00:08:57] [INFO ] Implicit Places using invariants and state equation in 765 ms returned [29, 30, 44]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 865 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/45 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 875 ms. Remains : 42/45 places, 64/64 transitions.
Stuttering acceptance computed with spot in 460 ms :[(AND (NOT p0) (NOT p1) p2 (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0 (NOT p3) p2), (AND (NOT p1) (NOT p0) (NOT p3) p2), (AND (NOT p1) p4 p0 (NOT p3) p2), (AND (NOT p0) (NOT p3) (NOT p1) p4 p2), (AND (NOT p1) p4), (AND (NOT p1) p4 (NOT p0))]
Running random walk in product with property : NQueens-PT-08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p0) p3 p4 (NOT p1)) (AND (NOT p0) (NOT p2) p4 (NOT p1))), acceptance={} source=0 dest: 5}, { cond=(OR (AND p3 p4) (AND (NOT p2) p4)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p0 p3 p4 (NOT p1)) (AND p0 (NOT p2) p4 (NOT p1))), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p3) p2 p4 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(OR (AND (NOT p0) p3 p4 (NOT p1)) (AND (NOT p0) (NOT p2) p4 (NOT p1))), acceptance={} source=6 dest: 5}, { cond=(OR (AND p3 p4) (AND (NOT p2) p4)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p2 p4 (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p3) p2 p4), acceptance={} source=6 dest: 8}], [{ cond=(AND p4 (NOT p1)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) p4 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=p4, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s11 0) (EQ s23 0) (EQ s35 0)), p3:(AND (NOT (OR (AND (EQ s6 1) (EQ s8 1) (EQ s28 1) (EQ s34 1)) (AND (EQ s0 1) (EQ s13 1) (EQ s17 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 21153 reset in 876 ms.
Product exploration explored 100000 steps with 21029 reset in 674 ms.
Computed a total of 42 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 42 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (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 p3) p2 (NOT p1) p4), (X (NOT (AND p0 (NOT p3) p2 p4 (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (NOT (OR (AND p0 p3 p4 (NOT p1)) (AND p0 (NOT p2) p4 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 p4 (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (OR (AND p0 p3 p4 (NOT p1)) (AND p0 (NOT p2) p4 (NOT p1)))))), (F (G p0)), (F (G p3)), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p4)))]
False Knowledge obtained : [(X (AND (NOT p3) p2 p4)), (X (NOT (AND (NOT p3) p2 p4))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) p2))), (X (NOT p1)), (X p1), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (OR (AND p3 p4) (AND (NOT p2) p4))), (X (NOT (OR (AND p3 p4) (AND (NOT p2) p4)))), (X (AND (NOT p0) (NOT p3) p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1)))), (X (OR (AND (NOT p0) p3 p4 (NOT p1)) (AND (NOT p0) (NOT p2) p4 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p3 p4 (NOT p1)) (AND (NOT p0) (NOT p2) p4 (NOT p1))))), (X (AND (NOT p0) (NOT p3) p2 p4 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) p2 p4 (NOT p1)))), (X (X (AND (NOT p3) p2 p4))), (X (X (NOT (AND (NOT p3) p2 p4)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p4 (NOT p1)))), (X (X (NOT (AND (NOT p0) p4 (NOT p1))))), (X (X p4)), (X (X (NOT p4))), (X (X (AND p4 (NOT p1)))), (X (X (NOT (AND p4 (NOT p1))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (OR (AND p3 p4) (AND (NOT p2) p4)))), (X (X (NOT (OR (AND p3 p4) (AND (NOT p2) p4))))), (X (X (AND (NOT p0) (NOT p3) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (OR (AND (NOT p0) p3 p4 (NOT p1)) (AND (NOT p0) (NOT p2) p4 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p3 p4 (NOT p1)) (AND (NOT p0) (NOT p2) p4 (NOT p1)))))), (X (X (AND (NOT p0) (NOT p3) p2 p4 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p4 (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 28 ms. Reduced automaton from 9 states, 24 edges and 5 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-08-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-08-LTLFireability-07 finished in 3032 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)))'
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-26 00:08:59] [INFO ] Invariant cache hit.
[2024-05-26 00:09:00] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-26 00:09:00] [INFO ] Invariant cache hit.
[2024-05-26 00:09:00] [INFO ] Implicit Places using invariants and state equation in 451 ms returned [29, 30, 44]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 570 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/45 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 575 ms. Remains : 42/45 places, 64/64 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s0 1) (EQ s9 1) (EQ s21 1) (EQ s29 1)) (AND (EQ s2 1) (EQ s14 1) (EQ s18 1) (EQ s36 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLFireability-09 finished in 688 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((G(p1)||p0))))'
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-26 00:09:00] [INFO ] Invariant cache hit.
[2024-05-26 00:09:00] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-26 00:09:00] [INFO ] Invariant cache hit.
[2024-05-26 00:09:01] [INFO ] Implicit Places using invariants and state equation in 541 ms returned [29, 30, 44]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 653 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/45 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 663 ms. Remains : 42/45 places, 64/64 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s4 1) (NEQ s14 1) (NEQ s20 1) (NEQ s38 1)), p0:(OR (EQ s6 0) (EQ s10 0) (EQ s26 0) (EQ s36 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19675 reset in 564 ms.
Product exploration explored 100000 steps with 19710 reset in 537 ms.
Computed a total of 42 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 42 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (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 p1) (NOT p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 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-08-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-08-LTLFireability-10 finished in 1924 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 U p2)))))'
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 45 /45 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-26 00:09:02] [INFO ] Invariant cache hit.
[2024-05-26 00:09:02] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-26 00:09:02] [INFO ] Invariant cache hit.
[2024-05-26 00:09:03] [INFO ] Implicit Places using invariants and state equation in 435 ms returned [29, 30, 44]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 546 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/45 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 555 ms. Remains : 42/45 places, 64/64 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NQueens-PT-08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s9 0) (EQ s27 0) (EQ s35 0)), p2:(AND (EQ s4 1) (EQ s8 1) (EQ s26 1) (EQ s32 1)), p1:(AND (EQ s6 1) (EQ s9 1) (EQ s27 1) (EQ s35 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13159 reset in 576 ms.
Product exploration explored 100000 steps with 13155 reset in 566 ms.
Computed a total of 42 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 42 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (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 p1), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (OR (AND p0 p2) (AND p0 p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (OR (AND p0 p2) (AND p0 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p0 p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-08-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-08-LTLFireability-14 finished in 1895 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(!((p0 U p1) U !p0))))'
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-26 00:09:04] [INFO ] Invariant cache hit.
[2024-05-26 00:09:04] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-26 00:09:04] [INFO ] Invariant cache hit.
[2024-05-26 00:09:05] [INFO ] Implicit Places using invariants and state equation in 430 ms returned [29, 30, 44]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 628 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/45 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 631 ms. Remains : 42/45 places, 64/64 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : NQueens-PT-08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s13 1) (EQ s20 1) (EQ s36 1)), p1:(OR (NOT (AND (EQ s0 1) (EQ s9 1) (EQ s21 1) (EQ s29 1))) (AND (EQ s7 1) (EQ s13 1) (EQ s24 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLFireability-15 finished in 812 ms.
All properties solved by simple procedures.
Total runtime 14015 ms.

BK_STOP 1716682146691

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-08"
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-08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654372300218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;