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-167863539500052.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-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539500052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 824K
-rw-r--r-- 1 mcc users 6.9K Feb 26 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 17:11 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 26K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 17:12 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 349K 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-20-LTLFireability-00
FORMULA_NAME NQueens-PT-20-LTLFireability-01
FORMULA_NAME NQueens-PT-20-LTLFireability-02
FORMULA_NAME NQueens-PT-20-LTLFireability-03
FORMULA_NAME NQueens-PT-20-LTLFireability-04
FORMULA_NAME NQueens-PT-20-LTLFireability-05
FORMULA_NAME NQueens-PT-20-LTLFireability-06
FORMULA_NAME NQueens-PT-20-LTLFireability-07
FORMULA_NAME NQueens-PT-20-LTLFireability-08
FORMULA_NAME NQueens-PT-20-LTLFireability-09
FORMULA_NAME NQueens-PT-20-LTLFireability-10
FORMULA_NAME NQueens-PT-20-LTLFireability-11
FORMULA_NAME NQueens-PT-20-LTLFireability-12
FORMULA_NAME NQueens-PT-20-LTLFireability-13
FORMULA_NAME NQueens-PT-20-LTLFireability-14
FORMULA_NAME NQueens-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678742232722

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-20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 21:17:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 21:17:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:17:15] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2023-03-13 21:17:15] [INFO ] Transformed 520 places.
[2023-03-13 21:17:15] [INFO ] Transformed 400 transitions.
[2023-03-13 21:17:15] [INFO ] Parsed PT model containing 520 places and 400 transitions and 2000 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 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-20-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 400/400 transitions.
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 118 transition count 400
Applied a total of 400 rules in 31 ms. Remains 118 /518 variables (removed 400) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 118 cols
[2023-03-13 21:17:16] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-13 21:17:16] [INFO ] Implicit Places using invariants in 522 ms returned []
// Phase 1: matrix 400 rows 118 cols
[2023-03-13 21:17:16] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-13 21:17:16] [INFO ] Implicit Places using invariants and state equation in 526 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1096 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/518 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1134 ms. Remains : 117/518 places, 400/400 transitions.
Support contains 63 out of 117 places after structural reductions.
[2023-03-13 21:17:17] [INFO ] Flatten gal took : 104 ms
[2023-03-13 21:17:17] [INFO ] Flatten gal took : 62 ms
[2023-03-13 21:17:17] [INFO ] Input system was already deterministic with 400 transitions.
Support contains 62 out of 117 places (down from 63) after GAL structural reductions.
Finished random walk after 14 steps, including 0 resets, run visited all 25 properties in 16 ms. (steps per millisecond=0 )
FORMULA NQueens-PT-20-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 117 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 117 transition count 400
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(X(G(((p1||G(p2))&&p0)))))'
Support contains 11 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 117 /117 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:18] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-13 21:17:18] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:18] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-13 21:17:19] [INFO ] Implicit Places using invariants and state equation in 822 ms returned [77, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1100 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/117 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 115 /115 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1117 ms. Remains : 115/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 379 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : NQueens-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (GEQ s14 1) (GEQ s21 1) (GEQ s71 1) (GEQ s91 1)), p1:(AND (GEQ s19 1) (GEQ s39 1) (GEQ s58 1) (GEQ s114 1)), p2:(AND (GEQ s18 1) (GEQ s25 1) (GEQ ...], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-00 finished in 1579 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 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 400/400 transitions.
Applied a total of 0 rules in 16 ms. Remains 117 /117 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:19] [INFO ] Invariants computation overflowed in 23 ms
[2023-03-13 21:17:19] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:19] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-13 21:17:20] [INFO ] Implicit Places using invariants and state equation in 737 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 991 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/117 places, 400/400 transitions.
Applied a total of 0 rules in 17 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1026 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-20-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 s12 1) (GEQ s28 1) (GEQ s62 1) (GEQ s96 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 18 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-02 finished in 1091 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 8 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:20] [INFO ] Invariants computation overflowed in 22 ms
[2023-03-13 21:17:20] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:20] [INFO ] Invariants computation overflowed in 25 ms
[2023-03-13 21:17:21] [INFO ] Implicit Places using invariants and state equation in 733 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 993 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/117 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1006 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-03 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 s16 1) (GEQ s33 1) (GEQ s61 1) (GEQ s105 1)), p1:(AND (GEQ s6 1) (GEQ s30 1) (GEQ s54 1) (GEQ s92 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 18 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-03 finished in 1236 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(p0)))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:21] [INFO ] Invariants computation overflowed in 27 ms
[2023-03-13 21:17:22] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:22] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 21:17:22] [INFO ] Implicit Places using invariants and state equation in 736 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1005 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/117 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1012 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s25 1) (GEQ s53 1) (GEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 23 steps with 3 reset in 3 ms.
FORMULA NQueens-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-04 finished in 1103 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((X(X(p1))&&F((p2&&G(p3)))))))'
Support contains 16 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:22] [INFO ] Invariants computation overflowed in 23 ms
[2023-03-13 21:17:23] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:23] [INFO ] Invariants computation overflowed in 22 ms
[2023-03-13 21:17:23] [INFO ] Implicit Places using invariants and state equation in 710 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 942 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/117 places, 400/400 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 948 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s17 1) (LT s32 1) (LT s63 1) (LT s105 1)), p2:(OR (LT s12 1) (LT s21 1) (LT s69 1) (LT s89 1)), p3:(OR (LT s7 1) (LT s23 1) (LT s62 1) (LT s86 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17957 reset in 5112 ms.
Product exploration explored 100000 steps with 18081 reset in 5002 ms.
Computed a total of 114 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 114 transition count 400
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 p2) (NOT p3) p1), (F (G p0)), (F (G p2)), (F (G p3)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) p2 p3)), (X (NOT (AND (NOT p0) p2 p3))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p0) p2 p3))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 473 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-20-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-20-LTLFireability-05 finished in 12336 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' '!((p0 U (p1 U !p2)))'
Support contains 10 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 117 /117 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:35] [INFO ] Invariants computation overflowed in 24 ms
[2023-03-13 21:17:35] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:35] [INFO ] Invariants computation overflowed in 22 ms
[2023-03-13 21:17:36] [INFO ] Implicit Places using invariants and state equation in 715 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 923 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/117 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 935 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, p2, p2]
Running random walk in product with property : NQueens-PT-20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(AND (GEQ s7 1) (GEQ s24 1) (GEQ s61 1) (GEQ s87 1)), p1:(AND (GEQ s15 1) (GEQ s24 1) (GEQ s69 1) (GEQ s95 1)), p0:(AND (GEQ s15 1) (GEQ s22 1) (GEQ s7...], 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, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 22 steps with 3 reset in 2 ms.
FORMULA NQueens-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-07 finished in 1049 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(X(G(p1)))))'
Support contains 8 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:36] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 21:17:36] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:36] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 21:17:37] [INFO ] Implicit Places using invariants and state equation in 712 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 961 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/117 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 965 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s0 1) (LT s21 1) (LT s57 1) (LT s77 1)), p1:(OR (LT s12 1) (LT s31 1) (LT s59 1) (LT s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 15744 reset in 4777 ms.
Product exploration explored 100000 steps with 15703 reset in 4801 ms.
Computed a total of 114 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 114 transition count 400
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 p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 300 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-20-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-20-LTLFireability-08 finished in 11560 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(p1)&&X(F(p2))&&p0)))'
Support contains 11 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 400/400 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:47] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 21:17:48] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:48] [INFO ] Invariants computation overflowed in 23 ms
[2023-03-13 21:17:48] [INFO ] Implicit Places using invariants and state equation in 725 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 946 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/117 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 951 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : NQueens-PT-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (LT s2 1) (LT s37 1) (LT s43 1) (LT s95 1)), p2:(OR (LT s2 1) (LT s23 1) (LT s57 1) (LT s81 1)), p0:(AND (GEQ s15 1) (GEQ s30 1) (GEQ s63 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-10 finished in 1165 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(G(p1)))))'
Support contains 8 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:49] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 21:17:49] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:49] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 21:17:49] [INFO ] Implicit Places using invariants and state equation in 687 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 942 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/117 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 954 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : NQueens-PT-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s17 1) (LT s32 1) (LT s63 1) (LT s105 1)), p1:(OR (LT s15 1) (LT s23 1) (LT s70 1) (LT s94 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 165 steps with 8 reset in 6 ms.
FORMULA NQueens-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-11 finished in 1091 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&&G(!p1))))'
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:50] [INFO ] Invariants computation overflowed in 23 ms
[2023-03-13 21:17:50] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:17:50] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 21:17:51] [INFO ] Implicit Places using invariants and state equation in 726 ms returned [116]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 985 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/117 places, 400/400 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 995 ms. Remains : 116/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : NQueens-PT-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s19 1) (LT s20 1) (LT s77 1) (LT s97 1)), p1:(AND (GEQ s0 1) (GEQ s20 1) (GEQ s58 1) (GEQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5403 reset in 2742 ms.
Product exploration explored 100000 steps with 5409 reset in 2753 ms.
Computed a total of 116 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116 transition count 400
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (OR (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 383 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) p1), p1]
Finished random walk after 10 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (OR (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 562 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) p1), p1]
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 21:17:58] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 21:17:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:18:05] [INFO ] [Real]Absence check using state equation in 7108 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 21:18:05] [INFO ] Invariants computation overflowed in 22 ms
[2023-03-13 21:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:18:13] [INFO ] [Real]Absence check using state equation in 7127 ms returned unknown
Could not prove EG p1
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 400/400 transitions.
Applied a total of 0 rules in 9 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 21:18:13] [INFO ] Invariants computation overflowed in 22 ms
[2023-03-13 21:18:13] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 21:18:13] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 21:18:14] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
[2023-03-13 21:18:14] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 21:18:14] [INFO ] Invariants computation overflowed in 22 ms
[2023-03-13 21:18:14] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1258 ms. Remains : 116/116 places, 400/400 transitions.
Computed a total of 116 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 116 transition count 400
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (OR (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 379 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) p1), p1]
Finished random walk after 9 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (OR (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 441 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) p1), p1]
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 21:18:15] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 21:18:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:18:23] [INFO ] [Real]Absence check using state equation in 7104 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 21:18:23] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 21:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 21:18:30] [INFO ] [Real]Absence check using state equation in 7093 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) p1), p1]
Product exploration explored 100000 steps with 5405 reset in 2691 ms.
Product exploration explored 100000 steps with 5408 reset in 2742 ms.
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 21:18:36] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-13 21:18:36] [INFO ] Implicit Places using invariants in 191 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 21:18:36] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 21:18:37] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
[2023-03-13 21:18:37] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 21:18:37] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 21:18:37] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1211 ms. Remains : 116/116 places, 400/400 transitions.
Treatment of property NQueens-PT-20-LTLFireability-13 finished in 47405 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&&G(!p1))))'
[2023-03-13 21:18:37] [INFO ] Flatten gal took : 47 ms
[2023-03-13 21:18:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-13 21:18:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 400 transitions and 1599 arcs took 5 ms.
Total runtime 82560 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1030/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : NQueens-PT-20-LTLFireability-13

BK_STOP 1678742319680

--------------------
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
mcc2023
ltl formula name NQueens-PT-20-LTLFireability-13
ltl formula formula --ltl=/tmp/1030/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 117 places, 400 transitions and 1599 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1030/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1030/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1030/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1030/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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

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