Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 8.0K Apr 30 00:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 30 00:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 30 00:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 30 00:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 759K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652907068059

Running Version 202205111006
[2022-05-18 20:51:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 20:51:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 20:51:09] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2022-05-18 20:51:09] [INFO ] Transformed 1080 places.
[2022-05-18 20:51:09] [INFO ] Transformed 900 transitions.
[2022-05-18 20:51:09] [INFO ] Parsed PT model containing 1080 places and 900 transitions in 258 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 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-30-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 88 out of 1078 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1078/1078 places, 900/900 transitions.
Reduce places removed 900 places and 0 transitions.
Iterating post reduction 0 with 900 rules applied. Total rules applied 900 place count 178 transition count 900
Applied a total of 900 rules in 28 ms. Remains 178 /1078 variables (removed 900) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2022-05-18 20:51:10] [INFO ] Invariants computation overflowed in 169 ms
[2022-05-18 20:51:11] [INFO ] Implicit Places using invariants in 497 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2022-05-18 20:51:11] [INFO ] Invariants computation overflowed in 124 ms
[2022-05-18 20:51:12] [INFO ] Implicit Places using invariants and state equation in 957 ms returned [60, 118, 119, 177]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 1481 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 174/1078 places, 900/900 transitions.
Applied a total of 0 rules in 7 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 174/1078 places, 900/900 transitions.
Support contains 88 out of 174 places after structural reductions.
[2022-05-18 20:51:12] [INFO ] Flatten gal took : 111 ms
[2022-05-18 20:51:12] [INFO ] Flatten gal took : 75 ms
[2022-05-18 20:51:12] [INFO ] Input system was already deterministic with 900 transitions.
Support contains 83 out of 174 places (down from 88) after GAL structural reductions.
Finished random walk after 25 steps, including 0 resets, run visited all 28 properties in 21 ms. (steps per millisecond=1 )
FORMULA NQueens-PT-30-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NQueens-PT-30-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NQueens-PT-30-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 174 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 174 transition count 900
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(((G(X(p0))&&F(p1))||F(p2)))&&X(p3))))'
Support contains 16 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 13 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:13] [INFO ] Invariants computation overflowed in 92 ms
[2022-05-18 20:51:13] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:13] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-18 20:51:14] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 1799 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:14] [INFO ] Invariants computation overflowed in 95 ms
[2022-05-18 20:51:15] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 435 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : NQueens-PT-30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s7 1) (LT s39 1) (LT s86 1) (LT s132 1)), p1:(AND (GEQ s12 1) (GEQ s47 1) (GEQ s83 1) (GEQ s145 1)), p3:(AND (GEQ s9 1) (GEQ s35 1) (GEQ s92 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 6 ms.
FORMULA NQueens-PT-30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-02 finished in 2695 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||p1))))'
Support contains 7 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 7 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:15] [INFO ] Invariants computation overflowed in 91 ms
[2022-05-18 20:51:15] [INFO ] Implicit Places using invariants in 337 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:16] [INFO ] Invariants computation overflowed in 86 ms
[2022-05-18 20:51:17] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 1947 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:17] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-18 20:51:17] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-30-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(OR (LT s6 1) (LT s34 1) (LT s90 1) (LT s126 1)), p1:(AND (GEQ s10 1) (GEQ s34 1) (GEQ s94 1) (GEQ s130 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 20650 reset in 7248 ms.
Product exploration explored 100000 steps with 20532 reset in 7247 ms.
Computed a total of 174 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 174 transition count 900
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 (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (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 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 231 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-30-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-30-LTLFireability-03 finished in 19109 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&X(F(G(X(p1)))))))'
Support contains 8 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 11 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:34] [INFO ] Invariants computation overflowed in 88 ms
[2022-05-18 20:51:35] [INFO ] Implicit Places using invariants in 315 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:35] [INFO ] Invariants computation overflowed in 87 ms
[2022-05-18 20:51:36] [INFO ] Implicit Places using invariants and state equation in 1611 ms returned []
Implicit Place search using SMT with State Equation took 1932 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:36] [INFO ] Invariants computation overflowed in 94 ms
[2022-05-18 20:51:37] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NQueens-PT-30-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s44 1) (LT s75 1) (LT s131 1)), p1:(OR (LT s13 1) (LT s38 1) (LT s93 1) (LT s137 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 31 steps with 1 reset in 3 ms.
FORMULA NQueens-PT-30-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-04 finished in 2494 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(((p0 U p1)&&(F(G(p2))||X(X(!p2))))))))'
Support contains 11 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 19 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:37] [INFO ] Invariants computation overflowed in 91 ms
[2022-05-18 20:51:37] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:37] [INFO ] Invariants computation overflowed in 88 ms
[2022-05-18 20:51:39] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
[2022-05-18 20:51:39] [INFO ] Redundant transitions in 61 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:39] [INFO ] Invariants computation overflowed in 85 ms
[2022-05-18 20:51:39] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NQueens-PT-30-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND p1 p2) (AND p2 p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p2)) (AND (NOT p2) p0)), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s41 1) (GEQ s87 1) (GEQ s137 1)), p0:(AND (GEQ s24 1) (GEQ s39 1) (GEQ s103 1) (GEQ s149 1)), p2:(OR (LT s10 1) (LT s59 1) (LT s6...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 55 steps with 1 reset in 9 ms.
FORMULA NQueens-PT-30-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-05 finished in 2521 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(p1)))'
Support contains 8 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 4 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:39] [INFO ] Invariants computation overflowed in 78 ms
[2022-05-18 20:51:40] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:40] [INFO ] Invariants computation overflowed in 91 ms
[2022-05-18 20:51:42] [INFO ] Implicit Places using invariants and state equation in 2695 ms returned []
Implicit Place search using SMT with State Equation took 2997 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:42] [INFO ] Invariants computation overflowed in 88 ms
[2022-05-18 20:51:43] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : NQueens-PT-30-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s30 1) (GEQ s91 1) (GEQ s119 1)), p1:(AND (GEQ s14 1) (GEQ s45 1) (GEQ s87 1) (GEQ s145 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 34 steps with 4 reset in 6 ms.
FORMULA NQueens-PT-30-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-06 finished in 3528 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 5 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:43] [INFO ] Invariants computation overflowed in 78 ms
[2022-05-18 20:51:43] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:43] [INFO ] Invariants computation overflowed in 94 ms
[2022-05-18 20:51:45] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 1917 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:45] [INFO ] Invariants computation overflowed in 85 ms
[2022-05-18 20:51:45] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-30-LTLFireability-07 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 (GEQ s7 1) (GEQ s30 1) (GEQ s95 1) (GEQ 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, null][false, false, false]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 3 ms.
FORMULA NQueens-PT-30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-07 finished in 2432 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 14 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:45] [INFO ] Invariants computation overflowed in 83 ms
[2022-05-18 20:51:46] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:46] [INFO ] Invariants computation overflowed in 89 ms
[2022-05-18 20:51:47] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
[2022-05-18 20:51:47] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:47] [INFO ] Invariants computation overflowed in 93 ms
[2022-05-18 20:51:47] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-30-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:(AND (GEQ s21 1) (GEQ s49 1) (GEQ s90 1) (GEQ s156 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 27 steps with 0 reset in 3 ms.
FORMULA NQueens-PT-30-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-09 finished in 2392 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(G((F(G(p0))||p1)))))'
Support contains 8 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 9 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:48] [INFO ] Invariants computation overflowed in 84 ms
[2022-05-18 20:51:48] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:48] [INFO ] Invariants computation overflowed in 87 ms
[2022-05-18 20:51:49] [INFO ] Implicit Places using invariants and state equation in 1471 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
[2022-05-18 20:51:49] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:51:49] [INFO ] Invariants computation overflowed in 91 ms
[2022-05-18 20:51:50] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : NQueens-PT-30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s13 1) (GEQ s53 1) (GEQ s78 1) (GEQ s152 1)), p0:(OR (LT s6 1) (LT s35 1) (LT s89 1) (LT s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3585 reset in 5695 ms.
Product exploration explored 100000 steps with 3586 reset in 5645 ms.
Computed a total of 174 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 174 transition count 900
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 381 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-30-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-30-LTLFireability-10 finished in 15831 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!F(p0) U X(p1)))'
Support contains 12 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 7 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:52:04] [INFO ] Invariants computation overflowed in 82 ms
[2022-05-18 20:52:04] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:52:04] [INFO ] Invariants computation overflowed in 90 ms
[2022-05-18 20:52:05] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:52:05] [INFO ] Invariants computation overflowed in 100 ms
[2022-05-18 20:52:06] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 305 ms :[true, p1, (NOT p0), p1, p1, (AND (NOT p0) p1)]
Running random walk in product with property : NQueens-PT-30-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(AND (GEQ s0 1) (GEQ s37 1) (GEQ s81 1) (GEQ s123 1)), p0:(OR (AND (GEQ s19 1) (GEQ s31 1) (GEQ s106 1) (GEQ s136 1)) (AND (GEQ s29 1) (GEQ s53 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][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-30-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-11 finished in 2560 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1)))'
Support contains 8 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 4 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:52:06] [INFO ] Invariants computation overflowed in 81 ms
[2022-05-18 20:52:06] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:52:06] [INFO ] Invariants computation overflowed in 88 ms
[2022-05-18 20:52:08] [INFO ] Implicit Places using invariants and state equation in 1475 ms returned []
Implicit Place search using SMT with State Equation took 1773 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 174 cols
[2022-05-18 20:52:08] [INFO ] Invariants computation overflowed in 92 ms
[2022-05-18 20:52:08] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(OR (LT s6 1) (LT s33 1) (LT s91 1) (LT s125 1)), p1:(OR (LT s21 1) (LT s41 1) (LT s98 1) (LT s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-14 finished in 2302 ms.
All properties solved by simple procedures.
Total runtime 59607 ms.

BK_STOP 1652907129171

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NQueens-PT-30"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is NQueens-PT-30, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271821600948"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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