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.r263-smll-167863537700044.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 lolaxred
Input is NQueens-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863537700044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.0K Feb 26 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 17:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 17:09 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.8K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 11K Feb 26 17:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 17:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 26 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 129K Feb 26 17:10 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 203K 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-15-LTLFireability-00
FORMULA_NAME NQueens-PT-15-LTLFireability-01
FORMULA_NAME NQueens-PT-15-LTLFireability-02
FORMULA_NAME NQueens-PT-15-LTLFireability-03
FORMULA_NAME NQueens-PT-15-LTLFireability-04
FORMULA_NAME NQueens-PT-15-LTLFireability-05
FORMULA_NAME NQueens-PT-15-LTLFireability-06
FORMULA_NAME NQueens-PT-15-LTLFireability-07
FORMULA_NAME NQueens-PT-15-LTLFireability-08
FORMULA_NAME NQueens-PT-15-LTLFireability-09
FORMULA_NAME NQueens-PT-15-LTLFireability-10
FORMULA_NAME NQueens-PT-15-LTLFireability-11
FORMULA_NAME NQueens-PT-15-LTLFireability-12
FORMULA_NAME NQueens-PT-15-LTLFireability-13
FORMULA_NAME NQueens-PT-15-LTLFireability-14
FORMULA_NAME NQueens-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678708844829

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NQueens-PT-15
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-13 12:00:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 12:00:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 12:00:48] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2023-03-13 12:00:48] [INFO ] Transformed 315 places.
[2023-03-13 12:00:48] [INFO ] Transformed 225 transitions.
[2023-03-13 12:00:48] [INFO ] Parsed PT model containing 315 places and 225 transitions and 1125 arcs in 370 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-15-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-15-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-15-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-15-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-15-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 225/225 transitions.
Reduce places removed 225 places and 0 transitions.
Iterating post reduction 0 with 225 rules applied. Total rules applied 225 place count 88 transition count 225
Applied a total of 225 rules in 38 ms. Remains 88 /313 variables (removed 225) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 88 cols
[2023-03-13 12:00:49] [INFO ] Computed 7 place invariants in 70 ms
[2023-03-13 12:00:49] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-13 12:00:49] [INFO ] Invariant cache hit.
[2023-03-13 12:00:50] [INFO ] Implicit Places using invariants and state equation in 584 ms returned [30, 58, 59]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1136 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/313 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1179 ms. Remains : 85/313 places, 225/225 transitions.
Support contains 57 out of 85 places after structural reductions.
[2023-03-13 12:00:50] [INFO ] Flatten gal took : 112 ms
[2023-03-13 12:00:50] [INFO ] Flatten gal took : 60 ms
[2023-03-13 12:00:51] [INFO ] Input system was already deterministic with 225 transitions.
Support contains 56 out of 85 places (down from 57) after GAL structural reductions.
Finished random walk after 11 steps, including 0 resets, run visited all 23 properties in 22 ms. (steps per millisecond=0 )
FORMULA NQueens-PT-15-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 85 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 85 transition count 225
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' '!(X((p0&&X(G(p1)))))'
Support contains 8 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 225/225 transitions.
Applied a total of 0 rules in 10 ms. Remains 85 /85 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 85 cols
[2023-03-13 12:00:51] [INFO ] Computed 4 place invariants in 45 ms
[2023-03-13 12:00:51] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-13 12:00:51] [INFO ] Invariant cache hit.
[2023-03-13 12:00:52] [INFO ] Implicit Places using invariants and state equation in 595 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 937 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/85 places, 225/225 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 955 ms. Remains : 84/85 places, 225/225 transitions.
Stuttering acceptance computed with spot in 450 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-00 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s20 1) (LT s39 1) (LT s62 1)), p1:(OR (LT s5 1) (LT s25 1) (LT s38 1) (LT s71 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 3 ms.
FORMULA NQueens-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-00 finished in 1505 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 8 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 225/225 transitions.
Applied a total of 0 rules in 15 ms. Remains 85 /85 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-13 12:00:53] [INFO ] Invariant cache hit.
[2023-03-13 12:00:53] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-13 12:00:53] [INFO ] Invariant cache hit.
[2023-03-13 12:00:53] [INFO ] Implicit Places using invariants and state equation in 565 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 797 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/85 places, 225/225 transitions.
Applied a total of 0 rules in 9 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 821 ms. Remains : 84/85 places, 225/225 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s19 1) (GEQ s48 1) (GEQ s69 1) (OR (LT s1 1) (LT s28 1) (LT s31 1) (LT s70 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-02 finished in 902 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 8 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 225/225 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-13 12:00:53] [INFO ] Invariant cache hit.
[2023-03-13 12:00:54] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-13 12:00:54] [INFO ] Invariant cache hit.
[2023-03-13 12:00:54] [INFO ] Implicit Places using invariants and state equation in 621 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 841 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/85 places, 225/225 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 856 ms. Remains : 84/85 places, 225/225 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-04 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 s0 1) (GEQ s24 1) (GEQ s34 1) (GEQ s65 1) (OR (LT s12 1) (LT s23 1) (LT s47 1) (LT s76 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 1 ms.
FORMULA NQueens-PT-15-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-04 finished in 998 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&&F((G(!p1)&&F(!p2))))||G((F(!p2)&&F(G(!p1))))||p0)))'
Support contains 12 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 225/225 transitions.
Applied a total of 0 rules in 9 ms. Remains 85 /85 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-13 12:00:55] [INFO ] Invariant cache hit.
[2023-03-13 12:00:55] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-13 12:00:55] [INFO ] Invariant cache hit.
[2023-03-13 12:00:55] [INFO ] Implicit Places using invariants and state equation in 536 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 770 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/85 places, 225/225 transitions.
Applied a total of 0 rules in 9 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 790 ms. Remains : 84/85 places, 225/225 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p2)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s14 1) (LT s18 1) (LT s54 1) (LT s73 1)), p1:(AND (GEQ s13 1) (GEQ s24 1) (GEQ s47 1) (GEQ s78 1)), p2:(AND (GEQ s7 1) (GEQ s22 1) (GEQ s43 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 22571 reset in 3105 ms.
Product exploration explored 100000 steps with 22561 reset in 2942 ms.
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
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 p2), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 629 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-06 finished in 7918 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((F(p1)&&p0))))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 225/225 transitions.
Applied a total of 0 rules in 9 ms. Remains 85 /85 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-13 12:01:02] [INFO ] Invariant cache hit.
[2023-03-13 12:01:03] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-13 12:01:03] [INFO ] Invariant cache hit.
[2023-03-13 12:01:03] [INFO ] Implicit Places using invariants and state equation in 536 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 806 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/85 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 820 ms. Remains : 84/85 places, 225/225 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s15 1) (GEQ s54 1) (GEQ s67 1)), p1:(AND (GEQ s9 1) (GEQ s17 1) (GEQ s50 1) (GEQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-07 finished in 1108 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)||G(p1))))'
Support contains 8 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 225/225 transitions.
Applied a total of 0 rules in 7 ms. Remains 85 /85 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-13 12:01:04] [INFO ] Invariant cache hit.
[2023-03-13 12:01:04] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-13 12:01:04] [INFO ] Invariant cache hit.
[2023-03-13 12:01:04] [INFO ] Implicit Places using invariants and state equation in 575 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 823 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/85 places, 225/225 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 837 ms. Remains : 84/85 places, 225/225 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-15-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s14 1) (GEQ s26 1) (GEQ s46 1) (GEQ s81 1)), p1:(AND (GEQ s10 1) (GEQ s28 1) (GEQ s40 1) (GEQ s79 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-15-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-10 finished in 916 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)||G(F(p1)))))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 225/225 transitions.
Applied a total of 0 rules in 7 ms. Remains 85 /85 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-13 12:01:04] [INFO ] Invariant cache hit.
[2023-03-13 12:01:05] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-13 12:01:05] [INFO ] Invariant cache hit.
[2023-03-13 12:01:05] [INFO ] Implicit Places using invariants and state equation in 610 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 854 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/85 places, 225/225 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 868 ms. Remains : 84/85 places, 225/225 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s24 1) (GEQ s37 1) (GEQ s68 1)), p1:(AND (GEQ s0 1) (GEQ s24 1) (GEQ s34 1) (GEQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-11 finished in 1001 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) U ((X(!p0)&&F(!p1))||G(F(!p1))))))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 225/225 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-13 12:01:05] [INFO ] Invariant cache hit.
[2023-03-13 12:01:06] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-13 12:01:06] [INFO ] Invariant cache hit.
[2023-03-13 12:01:06] [INFO ] Implicit Places using invariants and state equation in 546 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 766 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/85 places, 225/225 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 772 ms. Remains : 84/85 places, 225/225 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) p1), false, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s18 1) (GEQ s46 1) (GEQ s65 1)), p1:(AND (GEQ s12 1) (GEQ s24 1) (GEQ s46 1) (GEQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19916 reset in 2858 ms.
Product exploration explored 100000 steps with 20027 reset in 2540 ms.
Computed a total of 84 stabilizing places and 225 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 225
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 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 (NOT p1)))
Knowledge based reduction with 3 factoid took 656 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-15-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-15-LTLFireability-12 finished in 7248 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((F(G((p0 U p1))) U p2)))'
Support contains 11 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 225/225 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-13 12:01:13] [INFO ] Invariant cache hit.
[2023-03-13 12:01:13] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-13 12:01:13] [INFO ] Invariant cache hit.
[2023-03-13 12:01:13] [INFO ] Implicit Places using invariants and state equation in 557 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 789 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/85 places, 225/225 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 794 ms. Remains : 84/85 places, 225/225 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : NQueens-PT-15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s8 1) (GEQ s16 1) (GEQ s50 1) (GEQ s65 1)), p1:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s50 1) (GEQ s65 1)) (AND (GEQ s5 1) (GEQ s16 1) (GEQ s47 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 2 reset in 1 ms.
FORMULA NQueens-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-13 finished in 1077 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)&&X((F(p0)||G(p1)))))'
Support contains 8 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 225/225 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-13 12:01:14] [INFO ] Invariant cache hit.
[2023-03-13 12:01:14] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-13 12:01:14] [INFO ] Invariant cache hit.
[2023-03-13 12:01:15] [INFO ] Implicit Places using invariants and state equation in 551 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 759 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/85 places, 225/225 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 764 ms. Remains : 84/85 places, 225/225 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-15-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s10 1) (GEQ s22 1) (GEQ s46 1) (GEQ s73 1)), p1:(OR (LT s2 1) (LT s24 1) (LT s36 1) (LT s67 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 31 steps with 9 reset in 2 ms.
FORMULA NQueens-PT-15-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-15-LTLFireability-15 finished in 950 ms.
All properties solved by simple procedures.
Total runtime 26664 ms.
ITS solved all properties within timeout

BK_STOP 1678708876662

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-15"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is NQueens-PT-15, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863537700044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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