Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.6K Feb 26 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 17:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 17:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 17:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 17:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 96K Mar 5 18:22 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-10-LTLFireability-00
FORMULA_NAME NQueens-PT-10-LTLFireability-01
FORMULA_NAME NQueens-PT-10-LTLFireability-02
FORMULA_NAME NQueens-PT-10-LTLFireability-03
FORMULA_NAME NQueens-PT-10-LTLFireability-04
FORMULA_NAME NQueens-PT-10-LTLFireability-05
FORMULA_NAME NQueens-PT-10-LTLFireability-06
FORMULA_NAME NQueens-PT-10-LTLFireability-07
FORMULA_NAME NQueens-PT-10-LTLFireability-08
FORMULA_NAME NQueens-PT-10-LTLFireability-09
FORMULA_NAME NQueens-PT-10-LTLFireability-10
FORMULA_NAME NQueens-PT-10-LTLFireability-11
FORMULA_NAME NQueens-PT-10-LTLFireability-12
FORMULA_NAME NQueens-PT-10-LTLFireability-13
FORMULA_NAME NQueens-PT-10-LTLFireability-14
FORMULA_NAME NQueens-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678727538650

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NQueens-PT-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 17:12:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 17:12:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:12:22] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2023-03-13 17:12:22] [INFO ] Transformed 160 places.
[2023-03-13 17:12:22] [INFO ] Transformed 100 transitions.
[2023-03-13 17:12:22] [INFO ] Parsed PT model containing 160 places and 100 transitions and 500 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 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-10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 100/100 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 58 transition count 100
Applied a total of 100 rules in 20 ms. Remains 58 /158 variables (removed 100) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 58 cols
[2023-03-13 17:12:22] [INFO ] Computed 7 place invariants in 19 ms
[2023-03-13 17:12:22] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-13 17:12:22] [INFO ] Invariant cache hit.
[2023-03-13 17:12:23] [INFO ] Implicit Places using invariants and state equation in 200 ms returned [20, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 491 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/158 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 513 ms. Remains : 56/158 places, 100/100 transitions.
Support contains 43 out of 56 places after structural reductions.
[2023-03-13 17:12:23] [INFO ] Flatten gal took : 52 ms
[2023-03-13 17:12:23] [INFO ] Flatten gal took : 25 ms
[2023-03-13 17:12:23] [INFO ] Input system was already deterministic with 100 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 24 properties in 13 ms. (steps per millisecond=0 )
Computed a total of 56 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 100
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p2)||p1)))))'
Support contains 11 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 100/100 transitions.
Applied a total of 0 rules in 8 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 56 cols
[2023-03-13 17:12:23] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-13 17:12:24] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-13 17:12:24] [INFO ] Invariant cache hit.
[2023-03-13 17:12:24] [INFO ] Implicit Places using invariants and state equation in 221 ms returned [37, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 350 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/56 places, 100/100 transitions.
Applied a total of 0 rules in 10 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 368 ms. Remains : 54/56 places, 100/100 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : NQueens-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s12 1) (LT s28 1) (LT s40 1) (LT s19 1) (LT s21 1) (LT s47 1)), p1:(OR (LT s2 1) (LT s12 1) (LT s28 1) (LT s40 1)), p2:(OR (LT s7 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11299 reset in 975 ms.
Product exploration explored 100000 steps with 11254 reset in 941 ms.
Computed a total of 54 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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) (NOT p2)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X p0), (X (NOT p0)), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 624 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-10-LTLFireability-00 finished in 3361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-13 17:12:27] [INFO ] Invariant cache hit.
[2023-03-13 17:12:27] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-13 17:12:27] [INFO ] Invariant cache hit.
[2023-03-13 17:12:27] [INFO ] Implicit Places using invariants and state equation in 238 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 395 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/56 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 403 ms. Remains : 55/56 places, 100/100 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-02 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 s9 1) (GEQ s10 1) (GEQ s37 1) (GEQ s46 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 9 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-02 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-13 17:12:27] [INFO ] Invariant cache hit.
[2023-03-13 17:12:27] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-13 17:12:27] [INFO ] Invariant cache hit.
[2023-03-13 17:12:28] [INFO ] Implicit Places using invariants and state equation in 221 ms returned [37, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 361 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/56 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 369 ms. Remains : 54/56 places, 100/100 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s15 1) (LT s24 1) (LT s42 1))], nbAcceptance=1, 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 10690 reset in 830 ms.
Product exploration explored 100000 steps with 10683 reset in 749 ms.
Computed a total of 54 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-10-LTLFireability-03 finished in 2209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U (G(p3)&&p2))&&p0)))'
Support contains 10 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-13 17:12:29] [INFO ] Invariant cache hit.
[2023-03-13 17:12:30] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-13 17:12:30] [INFO ] Invariant cache hit.
[2023-03-13 17:12:30] [INFO ] Implicit Places using invariants and state equation in 209 ms returned [37, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 339 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/56 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 345 ms. Remains : 54/56 places, 100/100 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2) p1) (AND p0 (NOT p3) p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p2 p3 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2 p3 p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p3) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p2 p3 p1), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p1))), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p3) p1), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND p3 (NOT p1))), acceptance={} source=2 dest: 2}, { cond=(AND p0 p3 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p3 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p3 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s17 1) (GEQ s21 1) (GEQ s43 1)), p2:(AND (GEQ s9 1) (GEQ s17 1) (GEQ s30 1) (GEQ s52 1)), p1:(AND (GEQ s0 1) (GEQ s17 1) (GEQ s21 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-04 finished in 580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&F(!p1)) U (G((G(!p0)||(!p0&&F(!p1))))||((G(!p0)||(!p0&&F(!p1)))&&p2)))))'
Support contains 11 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-13 17:12:30] [INFO ] Invariant cache hit.
[2023-03-13 17:12:30] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-13 17:12:30] [INFO ] Invariant cache hit.
[2023-03-13 17:12:30] [INFO ] Implicit Places using invariants and state equation in 178 ms returned [37, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 274 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/56 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 276 ms. Remains : 54/56 places, 100/100 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, p1, p0, p0, (AND p1 p0)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s0 1) (GEQ s17 1) (GEQ s21 1) (GEQ s43 1)), p0:(AND (GEQ s8 1) (GEQ s10 1) (GEQ s36 1) (GEQ s44 1)), p2:(AND (GEQ s8 1) (GEQ s15 1) (GEQ s31 ...], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-05 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0 U (p1||X(F(p0)))))||G(p2))))'
Support contains 12 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-13 17:12:31] [INFO ] Invariant cache hit.
[2023-03-13 17:12:31] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-13 17:12:31] [INFO ] Invariant cache hit.
[2023-03-13 17:12:31] [INFO ] Implicit Places using invariants and state equation in 254 ms returned [37, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 399 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/56 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 402 ms. Remains : 54/56 places, 100/100 transitions.
Stuttering acceptance computed with spot in 394 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : NQueens-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}]], initial=3, aps=[p0:(AND (GEQ s7 1) (GEQ s17 1) (GEQ s28 1) (GEQ s50 1)), p1:(AND (GEQ s3 1) (GEQ s14 1) (GEQ s27 1) (GEQ s43 1)), p2:(OR (LT s9 1) (LT s12 1) (LT s35 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 1 reset in 0 ms.
FORMULA NQueens-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-06 finished in 824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-13 17:12:31] [INFO ] Invariant cache hit.
[2023-03-13 17:12:31] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-13 17:12:31] [INFO ] Invariant cache hit.
[2023-03-13 17:12:32] [INFO ] Implicit Places using invariants and state equation in 220 ms returned [37, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 387 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/56 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 393 ms. Remains : 54/56 places, 100/100 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-08 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 s6 1) (GEQ s14 1) (GEQ s30 1) (GEQ s46 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 2 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-08 finished in 622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 7 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-13 17:12:32] [INFO ] Invariant cache hit.
[2023-03-13 17:12:32] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-13 17:12:32] [INFO ] Invariant cache hit.
[2023-03-13 17:12:32] [INFO ] Implicit Places using invariants and state equation in 210 ms returned [37, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 341 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/56 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 349 ms. Remains : 54/56 places, 100/100 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-09 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:(AND (GEQ s2 1) (GEQ s19 1) (GEQ s21 1) (GEQ s47 1)), p1:(OR (LT s2 1) (LT s15 1) (LT s25 1) (LT s43 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 8 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-09 finished in 483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-13 17:12:32] [INFO ] Invariant cache hit.
[2023-03-13 17:12:33] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-13 17:12:33] [INFO ] Invariant cache hit.
[2023-03-13 17:12:33] [INFO ] Implicit Places using invariants and state equation in 310 ms returned [37, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 491 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/56 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 496 ms. Remains : 54/56 places, 100/100 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-10 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:(OR (LT s1 1) (LT s19 1) (LT s20 1) (LT s46 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-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-10 finished in 604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&X(X((p2 U !p1)))))'
Support contains 10 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-13 17:12:33] [INFO ] Invariant cache hit.
[2023-03-13 17:12:33] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-13 17:12:33] [INFO ] Invariant cache hit.
[2023-03-13 17:12:33] [INFO ] Implicit Places using invariants and state equation in 187 ms returned [37, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 304 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/56 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 308 ms. Remains : 54/56 places, 100/100 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0), (NOT p1), p1, p1, true]
Running random walk in product with property : NQueens-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s14 1) (LT s28 1) (LT s44 1)), p1:(OR (LT s1 1) (LT s17 1) (LT s22 1) (LT s44 1)), p2:(AND (GEQ s6 1) (GEQ s12 1) (GEQ s32 1) (GEQ s4...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 32 steps with 6 reset in 1 ms.
FORMULA NQueens-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-13 finished in 542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-13 17:12:34] [INFO ] Invariant cache hit.
[2023-03-13 17:12:34] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-13 17:12:34] [INFO ] Invariant cache hit.
[2023-03-13 17:12:34] [INFO ] Implicit Places using invariants and state equation in 191 ms returned [37, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 313 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/56 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 321 ms. Remains : 54/56 places, 100/100 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s18 1) (LT s20 1) (LT s44 1))], nbAcceptance=1, 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 10690 reset in 729 ms.
Product exploration explored 100000 steps with 10699 reset in 791 ms.
Computed a total of 54 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-10-LTLFireability-14 finished in 2112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 8 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-13 17:12:36] [INFO ] Invariant cache hit.
[2023-03-13 17:12:36] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-13 17:12:36] [INFO ] Invariant cache hit.
[2023-03-13 17:12:36] [INFO ] Implicit Places using invariants and state equation in 214 ms returned [37, 55]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 302 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/56 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 308 ms. Remains : 54/56 places, 100/100 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-15 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s16 1) (GEQ s23 1) (GEQ s43 1)), p1:(AND (GEQ s3 1) (GEQ s13 1) (GEQ s28 1) (GEQ s42 1))], 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 8 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-15 finished in 444 ms.
All properties solved by simple procedures.
Total runtime 14539 ms.
ITS solved all properties within timeout

BK_STOP 1678727558049

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

+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is NQueens-PT-10, 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 r265-smll-167863539500028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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