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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.8K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 181K Apr 12 03:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 03:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 12 03:17 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 534K 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-25-LTLFireability-00
FORMULA_NAME NQueens-PT-25-LTLFireability-01
FORMULA_NAME NQueens-PT-25-LTLFireability-02
FORMULA_NAME NQueens-PT-25-LTLFireability-03
FORMULA_NAME NQueens-PT-25-LTLFireability-04
FORMULA_NAME NQueens-PT-25-LTLFireability-05
FORMULA_NAME NQueens-PT-25-LTLFireability-06
FORMULA_NAME NQueens-PT-25-LTLFireability-07
FORMULA_NAME NQueens-PT-25-LTLFireability-08
FORMULA_NAME NQueens-PT-25-LTLFireability-09
FORMULA_NAME NQueens-PT-25-LTLFireability-10
FORMULA_NAME NQueens-PT-25-LTLFireability-11
FORMULA_NAME NQueens-PT-25-LTLFireability-12
FORMULA_NAME NQueens-PT-25-LTLFireability-13
FORMULA_NAME NQueens-PT-25-LTLFireability-14
FORMULA_NAME NQueens-PT-25-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716683215882

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-25
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 00:26:57] [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:26:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:26:57] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-05-26 00:26:57] [INFO ] Transformed 775 places.
[2024-05-26 00:26:57] [INFO ] Transformed 625 transitions.
[2024-05-26 00:26:57] [INFO ] Found NUPN structural information;
[2024-05-26 00:26:57] [INFO ] Parsed PT model containing 775 places and 625 transitions and 3125 arcs in 164 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-25-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-25-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-25-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 773/773 places, 625/625 transitions.
Reduce places removed 625 places and 0 transitions.
Iterating post reduction 0 with 625 rules applied. Total rules applied 625 place count 148 transition count 625
Applied a total of 625 rules in 23 ms. Remains 148 /773 variables (removed 625) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 148 cols
[2024-05-26 00:26:57] [INFO ] Invariants computation overflowed in 102 ms
[2024-05-26 00:26:58] [INFO ] Implicit Places using invariants in 499 ms returned []
// Phase 1: matrix 625 rows 148 cols
[2024-05-26 00:26:58] [INFO ] Invariants computation overflowed in 87 ms
[2024-05-26 00:28:34] [INFO ] Performed 97/148 implicitness test of which 1 returned IMPLICIT in 95 seconds.
[2024-05-26 00:29:16] [INFO ] Performed 98/148 implicitness test of which 2 returned IMPLICIT in 137 seconds.
[2024-05-26 00:29:38] [INFO ] Implicit Places with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... after 160101 ms
Discarding 2 places :
Implicit Place search using SMT with State Equation took 160625 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/773 places, 625/625 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160653 ms. Remains : 146/773 places, 625/625 transitions.
Support contains 57 out of 146 places after structural reductions.
[2024-05-26 00:29:38] [INFO ] Flatten gal took : 88 ms
[2024-05-26 00:29:38] [INFO ] Flatten gal took : 60 ms
[2024-05-26 00:29:38] [INFO ] Input system was already deterministic with 625 transitions.
Support contains 56 out of 146 places (down from 57) after GAL structural reductions.
Finished random walk after 12 steps, including 0 resets, run visited all 18 properties in 31 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 146 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 146 transition count 625
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(p0)||X(F(p1))))'
Support contains 7 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 625/625 transitions.
Applied a total of 0 rules in 9 ms. Remains 146 /146 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:29:39] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-26 00:29:39] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:29:39] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-26 00:30:42] [INFO ] Performed 96/146 implicitness test of which 0 returned IMPLICIT in 63 seconds.
[2024-05-26 00:31:24] [INFO ] Performed 144/146 implicitness test of which 1 returned IMPLICIT in 104 seconds.
[2024-05-26 00:31:24] [INFO ] Implicit Places using invariants and state equation in 105145 ms returned [97, 145]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 105462 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/146 places, 625/625 transitions.
Applied a total of 0 rules in 11 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105484 ms. Remains : 144/146 places, 625/625 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 216 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-25-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s15 0) (EQ s32 0) (EQ s81 0) (EQ s118 0)), p0:(AND (EQ s7 1) (EQ s32 1) (EQ s73 1) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14122 reset in 7880 ms.
Product exploration explored 100000 steps with 14220 reset in 7769 ms.
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
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) p0), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-25-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-00 finished in 122245 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 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 625/625 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:31:41] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-26 00:31:41] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:31:41] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-26 00:32:23] [INFO ] Performed 96/146 implicitness test of which 0 returned IMPLICIT in 41 seconds.
[2024-05-26 00:32:58] [INFO ] Performed 97/146 implicitness test of which 1 returned IMPLICIT in 76 seconds.
[2024-05-26 00:33:57] [INFO ] Performed 145/146 implicitness test of which 2 returned IMPLICIT in 135 seconds.
[2024-05-26 00:33:57] [INFO ] Implicit Places using invariants and state equation in 135737 ms returned [97, 145]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 135978 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/146 places, 625/625 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135991 ms. Remains : 144/146 places, 625/625 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-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 s16 1) (EQ s36 1) (EQ s78 1) (EQ s123 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 28 steps with 3 reset in 5 ms.
FORMULA NQueens-PT-25-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-03 finished in 136087 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 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 625/625 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:33:57] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-26 00:33:57] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:33:57] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-26 00:34:42] [INFO ] Performed 96/146 implicitness test of which 0 returned IMPLICIT in 44 seconds.
[2024-05-26 00:36:00] [INFO ] Performed 97/146 implicitness test of which 1 returned IMPLICIT in 122 seconds.
[2024-05-26 00:36:37] [INFO ] Performed 144/146 implicitness test of which 1 returned IMPLICIT in 159 seconds.
[2024-05-26 00:36:37] [INFO ] Implicit Places using invariants and state equation in 160052 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 160268 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/146 places, 625/625 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160282 ms. Remains : 145/146 places, 625/625 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s38 0) (EQ s65 0) (EQ s114 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 13758 reset in 7430 ms.
Product exploration explored 100000 steps with 13706 reset in 7473 ms.
Computed a total of 145 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 145 transition count 625
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 11 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-25-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-04 finished in 176078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 625/625 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:36:53] [INFO ] Invariants computation overflowed in 57 ms
[2024-05-26 00:36:53] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:36:53] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-26 00:39:33] [INFO ] Performed 96/146 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2024-05-26 00:39:33] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2024-05-26 00:39:33] [INFO ] Implicit Places using invariants and state equation in 160063 ms returned []
Implicit Place search using SMT with State Equation took 160310 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:39:33] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-26 00:39:34] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160558 ms. Remains : 146/146 places, 625/625 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s22 1) (NEQ s39 1) (NEQ s81 1) (NEQ s133 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12969 reset in 7416 ms.
Product exploration explored 100000 steps with 13031 reset in 7486 ms.
Computed a total of 146 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 146 transition count 625
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 (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-25-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-05 finished in 176407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F(p1)))))'
Support contains 8 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 625/625 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:39:49] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-26 00:39:50] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:39:50] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-26 00:41:02] [INFO ] Performed 96/146 implicitness test of which 0 returned IMPLICIT in 72 seconds.
[2024-05-26 00:42:30] [INFO ] Performed 97/146 implicitness test of which 1 returned IMPLICIT in 159 seconds.
[2024-05-26 00:42:30] [INFO ] Implicit Places using invariants and state equation in 160046 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 160271 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/146 places, 625/625 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160280 ms. Remains : 145/146 places, 625/625 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-25-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s17 1) (EQ s45 1) (EQ s70 1) (EQ s133 1)), p0:(OR (NEQ s0 1) (NEQ s41 1) (NEQ s57 1) (NEQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 43 steps with 7 reset in 7 ms.
FORMULA NQueens-PT-25-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-06 finished in 160443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Support contains 8 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 625/625 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:42:30] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-26 00:42:30] [INFO ] Implicit Places using invariants in 209 ms returned []
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:42:30] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-26 00:43:40] [INFO ] Performed 96/146 implicitness test of which 0 returned IMPLICIT in 69 seconds.
[2024-05-26 00:45:10] [INFO ] Performed 144/146 implicitness test of which 1 returned IMPLICIT in 159 seconds.
[2024-05-26 00:45:10] [INFO ] Implicit Places using invariants and state equation in 160061 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 160273 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/146 places, 625/625 transitions.
Applied a total of 0 rules in 4 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160282 ms. Remains : 145/146 places, 625/625 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s47 1) (EQ s59 1) (EQ s126 1)), p1:(OR (EQ s20 0) (EQ s42 0) (EQ s76 0) (EQ s133 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5453 reset in 4727 ms.
Product exploration explored 100000 steps with 5501 reset in 4784 ms.
Computed a total of 145 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 145 transition count 625
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 (NOT p1)), true, (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 10 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-25-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-07 finished in 170765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 625/625 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:45:21] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-26 00:45:21] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:45:21] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-26 00:45:58] [INFO ] Performed 50/146 implicitness test of which 0 returned IMPLICIT in 37 seconds.
[2024-05-26 00:46:51] [INFO ] Performed 96/146 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-26 00:48:01] [INFO ] Performed 144/146 implicitness test of which 1 returned IMPLICIT in 159 seconds.
[2024-05-26 00:48:01] [INFO ] Implicit Places using invariants and state equation in 160051 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 160265 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/146 places, 625/625 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160274 ms. Remains : 145/146 places, 625/625 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s0 1) (EQ s35 1) (EQ s63 1) (EQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 4 ms.
FORMULA NQueens-PT-25-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-08 finished in 160385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 625/625 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:48:01] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-26 00:48:01] [INFO ] Implicit Places using invariants in 223 ms returned []
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:48:01] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-26 00:48:42] [INFO ] Performed 50/146 implicitness test of which 0 returned IMPLICIT in 40 seconds.
[2024-05-26 00:49:34] [INFO ] Performed 96/146 implicitness test of which 0 returned IMPLICIT in 93 seconds.
[2024-05-26 00:50:27] [INFO ] Performed 144/146 implicitness test of which 1 returned IMPLICIT in 145 seconds.
[2024-05-26 00:50:27] [INFO ] Implicit Places using invariants and state equation in 145781 ms returned [97, 145]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 146006 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/146 places, 625/625 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146011 ms. Remains : 144/146 places, 625/625 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s14 1) (EQ s25 1) (EQ s87 1) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 47 steps with 8 reset in 9 ms.
FORMULA NQueens-PT-25-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-09 finished in 146136 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))))'
Support contains 8 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 625/625 transitions.
Applied a total of 0 rules in 15 ms. Remains 146 /146 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:50:27] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-26 00:50:27] [INFO ] Implicit Places using invariants in 203 ms returned []
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:50:27] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-26 00:51:30] [INFO ] Performed 96/146 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-05-26 00:52:06] [INFO ] Performed 144/146 implicitness test of which 1 returned IMPLICIT in 98 seconds.
[2024-05-26 00:52:37] [INFO ] Performed 145/146 implicitness test of which 2 returned IMPLICIT in 129 seconds.
[2024-05-26 00:52:37] [INFO ] Implicit Places using invariants and state equation in 129215 ms returned [97, 145]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 129421 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/146 places, 625/625 transitions.
Applied a total of 0 rules in 7 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 129444 ms. Remains : 144/146 places, 625/625 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-25-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s43 0) (EQ s56 0) (EQ s115 0)), p1:(AND (EQ s20 1) (EQ s39 1) (EQ s79 1) (EQ s130 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4310 reset in 4059 ms.
Product exploration explored 100000 steps with 4317 reset in 4103 ms.
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (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 p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT 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 p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-25-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-10 finished in 138449 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(G(p1)))))'
Support contains 8 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 625/625 transitions.
Applied a total of 0 rules in 10 ms. Remains 146 /146 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:52:46] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-26 00:52:46] [INFO ] Implicit Places using invariants in 219 ms returned []
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:52:46] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-26 00:55:26] [INFO ] Performed 96/146 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2024-05-26 00:55:26] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2024-05-26 00:55:26] [INFO ] Implicit Places using invariants and state equation in 160056 ms returned []
Implicit Place search using SMT with State Equation took 160276 ms to find 0 implicit places.
[2024-05-26 00:55:26] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:55:26] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-26 00:55:26] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160556 ms. Remains : 146/146 places, 625/625 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s42 0) (EQ s65 0) (EQ s123 0)), p1:(AND (EQ s15 1) (EQ s26 1) (EQ s87 1) (EQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 56 steps with 6 reset in 4 ms.
FORMULA NQueens-PT-25-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-11 finished in 160681 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)))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 625/625 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:55:26] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-26 00:55:26] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:55:27] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-26 00:57:15] [INFO ] Performed 96/146 implicitness test of which 0 returned IMPLICIT in 108 seconds.
[2024-05-26 00:58:07] [INFO ] Performed 144/146 implicitness test of which 1 returned IMPLICIT in 159 seconds.
[2024-05-26 00:58:07] [INFO ] Implicit Places using invariants and state equation in 160050 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 160262 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/146 places, 625/625 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 160273 ms. Remains : 145/146 places, 625/625 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s39 1) (EQ s62 1) (EQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-25-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-12 finished in 160323 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)))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 625/625 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:58:07] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-26 00:58:07] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 00:58:07] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-26 00:58:56] [INFO ] Performed 96/146 implicitness test of which 0 returned IMPLICIT in 48 seconds.
[2024-05-26 00:59:45] [INFO ] Performed 144/146 implicitness test of which 1 returned IMPLICIT in 97 seconds.
[2024-05-26 01:00:29] [INFO ] Performed 145/146 implicitness test of which 2 returned IMPLICIT in 142 seconds.
[2024-05-26 01:00:29] [INFO ] Implicit Places using invariants and state equation in 142427 ms returned [97, 145]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 142644 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/146 places, 625/625 transitions.
Applied a total of 0 rules in 12 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142663 ms. Remains : 144/146 places, 625/625 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s19 1) (EQ s33 1) (EQ s84 1) (EQ s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 4 ms.
FORMULA NQueens-PT-25-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-13 finished in 142709 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 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 625/625 transitions.
Applied a total of 0 rules in 10 ms. Remains 146 /146 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 01:00:29] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-26 01:00:30] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 625 rows 146 cols
[2024-05-26 01:00:30] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-26 01:01:30] [INFO ] Performed 96/146 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-26 01:03:10] [INFO ] Performed 145/146 implicitness test of which 2 returned IMPLICIT in 159 seconds.
[2024-05-26 01:03:10] [INFO ] Implicit Places using invariants and state equation in 160051 ms returned [97, 145]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 160265 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/146 places, 625/625 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 160280 ms. Remains : 144/146 places, 625/625 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-15 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 (NEQ s7 1) (NEQ s44 1) (NEQ s61 1) (NEQ s122 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]]
Product exploration explored 100000 steps with 10372 reset in 6450 ms.
Product exploration explored 100000 steps with 10392 reset in 6489 ms.
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
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 16 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-25-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-15 finished in 174096 ms.
All properties solved by simple procedures.
Total runtime 2186516 ms.

BK_STOP 1716685405261

--------------------
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-25"
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-25, 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-171654372400243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-25.tgz
mv NQueens-PT-25 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 ;