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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 6.7K Apr 30 00:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 30 00:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 00:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 00:07 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.6K May 9 08:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:18 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 65K 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-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 1652897912893

Running Version 202205111006
[2022-05-18 18:18:34] [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 18:18:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 18:18:34] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2022-05-18 18:18:34] [INFO ] Transformed 112 places.
[2022-05-18 18:18:34] [INFO ] Transformed 64 transitions.
[2022-05-18 18:18:34] [INFO ] Parsed PT model containing 112 places and 64 transitions in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-08-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLFireability-06 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 13 ms. Remains 46 /110 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 46 cols
[2022-05-18 18:18:34] [INFO ] Computed 7 place invariants in 11 ms
[2022-05-18 18:18:34] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 64 rows 46 cols
[2022-05-18 18:18:34] [INFO ] Computed 7 place invariants in 9 ms
[2022-05-18 18:18:34] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [16, 31]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 254 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/110 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 44/110 places, 64/64 transitions.
Support contains 39 out of 44 places after structural reductions.
[2022-05-18 18:18:34] [INFO ] Flatten gal took : 29 ms
[2022-05-18 18:18:34] [INFO ] Flatten gal took : 11 ms
[2022-05-18 18:18:34] [INFO ] Input system was already deterministic with 64 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 24 properties in 12 ms. (steps per millisecond=0 )
Computed a total of 44 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U (X(p2)&&p1)))'
Support contains 10 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:35] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-18 18:18:35] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:35] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-18 18:18:35] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [29, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 171 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 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 2 iterations. Remains : 42/44 places, 64/64 transitions.
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p1) (NOT p2)), true, p0, (NOT p2), (NOT p2)]
Running random walk in product with property : NQueens-PT-08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s10 1) (GEQ s21 1) (GEQ s31 1)), p0:(AND (GEQ s1 1) (GEQ s9 1) (GEQ s22 1) (GEQ s30 1)), p2:(AND (GEQ s1 1) (GEQ s10 1) (GEQ s21 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 1 ms.
FORMULA NQueens-PT-08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLFireability-00 finished in 572 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(p1)||p0))&&X(p2))))'
Support contains 12 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:35] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-18 18:18:35] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 18:18:36] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 163 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/44 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 43/44 places, 64/64 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : NQueens-PT-08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p2) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(OR (AND (GEQ s1 1) (GEQ s10 1) (GEQ s21 1) (GEQ s31 1)) (LT s6 1) (LT s8 1) (LT s28 1) (LT s34 1)), p0:(OR (LT s7 1) (LT s15 1) (LT s22 1) (LT s42 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 15 steps with 2 reset in 3 ms.
FORMULA NQueens-PT-08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLFireability-02 finished in 327 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||G(!(X(p1) U p2)))))'
Support contains 8 out of 44 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:36] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-18 18:18:36] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 18:18:36] [INFO ] Implicit Places using invariants and state equation in 226 ms returned [29, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 278 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 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 2 iterations. Remains : 42/44 places, 64/64 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND p2 (NOT p0)), (AND p2 (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=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s9 1) (GEQ s22 1) (GEQ s30 1)), p0:(OR (LT s2 1) (LT s11 1) (LT s21 1) (LT s33 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 30862 reset in 850 ms.
Product exploration explored 100000 steps with 30904 reset in 731 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 p2 (NOT p0)), (F (G (NOT p2))), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G (NOT p2)))
Knowledge based reduction with 3 factoid took 270 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-08-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-08-LTLFireability-03 finished in 2405 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(G(X(p0))))||p1)))'
Support contains 8 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 18:18:38] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:38] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-18 18:18:38] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [29, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 133 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 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 2 iterations. Remains : 42/44 places, 64/64 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(AND (GEQ s3 1) (GEQ s8 1) (GEQ s25 1) (GEQ s31 1)), p0:(AND (GEQ s7 1) (GEQ s10 1) (GEQ s27 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 3 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLFireability-05 finished in 297 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:38] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-18 18:18:39] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:39] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-18 18:18:39] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [29, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 167 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 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 2 iterations. Remains : 42/44 places, 64/64 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s7 1) (GEQ s11 1) (GEQ s26 1) (GEQ s38 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLFireability-07 finished in 301 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(!p0)&&F(p0))) U X(p1)))'
Support contains 7 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 18:18:39] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-18 18:18:39] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [29, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 157 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/44 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 2 iterations. Remains : 42/44 places, 64/64 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), p0, (NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s10 1) (GEQ s25 1) (GEQ s35 1)), p0:(AND (GEQ s4 1) (GEQ s10 1) (GEQ s24 1) (GEQ s34 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 7 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLFireability-08 finished in 354 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 7 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 18:18:39] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-18 18:18:39] [INFO ] Implicit Places using invariants and state equation in 97 ms returned [29, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 153 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/44 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 2 iterations. Remains : 42/44 places, 64/64 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s4 1) (LT s11 1) (LT s23 1) (LT s35 1)) (OR (LT s3 1) (LT s10 1) (LT s23 1) (LT s33 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 25742 reset in 649 ms.
Product exploration explored 100000 steps with 25852 reset in 647 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 : [(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 :(F (G p0))
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-08-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-08-LTLFireability-09 finished in 1708 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G((G(F(p0))||X(p1)||!p1))))))'
Support contains 8 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:41] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 18:18:41] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:41] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-18 18:18:41] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [29, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 145 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/44 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 2 iterations. Remains : 42/44 places, 64/64 transitions.
Stuttering acceptance computed with spot in 267 ms :[false, false, false, false, false]
Running random walk in product with property : NQueens-PT-08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s11 1) (LT s19 1) (LT s31 1)), p0:(AND (GEQ s5 1) (GEQ s10 1) (GEQ s25 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 19007 reset in 589 ms.
Product exploration explored 100000 steps with 18993 reset in 574 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) p0), true, (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-08-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-08-LTLFireability-10 finished in 1817 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U (F(p1)||p2))))'
Support contains 14 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 18:18:43] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-18 18:18:43] [INFO ] Implicit Places using invariants and state equation in 76 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 153 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/44 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 43/44 places, 64/64 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NQueens-PT-08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s5 1) (GEQ s13 1) (GEQ s22 1) (GEQ s39 1)), p1:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s29 1) (GEQ s36 1)), p0:(OR (AND (GEQ s5 1) (GEQ s8 1) (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLFireability-11 finished in 312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((G(X(p1)) U X(!G((p2 U p1))))&&p0) U G(p3)))'
Support contains 11 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:43] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-18 18:18:43] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:43] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-18 18:18:43] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [29, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 159 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/44 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 2 iterations. Remains : 42/44 places, 64/64 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p3), true, p1, (NOT p3)]
Running random walk in product with property : NQueens-PT-08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p3 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (GEQ s1 1) (GEQ s12 1) (GEQ s19 1) (GEQ s33 1)), p0:(AND (GEQ s6 1) (GEQ s14 1) (GEQ s22 1) (GEQ s40 1)), p2:(AND (GEQ s5 1) (GEQ s14 1) (GEQ s21 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLFireability-12 finished in 341 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(p0)))&&G(F(p1))))'
Support contains 8 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-18 18:18:43] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-18 18:18:43] [INFO ] Implicit Places using invariants and state equation in 76 ms returned [29, 43]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 133 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/44 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 2 iterations. Remains : 42/44 places, 64/64 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NQueens-PT-08-LTLFireability-14 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s11 1) (LT s23 1) (LT s35 1)), p1:(OR (LT s2 1) (LT s8 1) (LT s24 1) (LT s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 17084 reset in 585 ms.
Product exploration explored 100000 steps with 17203 reset in 554 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 p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 200 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-08-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-08-LTLFireability-14 finished in 1675 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(X(p0)))||G(X(p1)))))'
Support contains 7 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:45] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-18 18:18:45] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 64 rows 44 cols
[2022-05-18 18:18:45] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-18 18:18:45] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/44 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 43/44 places, 64/64 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s14 1) (GEQ s23 1) (GEQ s42 1)), p0:(OR (LT s7 1) (LT s8 1) (LT s29 1) (LT s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 18424 reset in 566 ms.
Product exploration explored 100000 steps with 18333 reset in 582 ms.
Computed a total of 43 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 43 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 p1 (NOT p0)), true, (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 275 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-08-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-08-LTLFireability-15 finished in 1756 ms.
All properties solved by simple procedures.
Total runtime 13101 ms.

BK_STOP 1652897927568

--------------------
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-08"
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-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 r132-tall-165271821500900"
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 ;