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.r261-smll-167863535800052.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 itstools
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 r261-smll-167863535800052
=====================================================================

--------------------
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 1678709619555

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NQueens-PT-20
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-13 12:13:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-13 12:13:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 12:13:42] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2023-03-13 12:13:42] [INFO ] Transformed 520 places.
[2023-03-13 12:13:42] [INFO ] Transformed 400 transitions.
[2023-03-13 12:13:42] [INFO ] Parsed PT model containing 520 places and 400 transitions and 2000 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 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 60 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 12:13:43] [INFO ] Invariants computation overflowed in 107 ms
[2023-03-13 12:13:43] [INFO ] Implicit Places using invariants in 466 ms returned []
// Phase 1: matrix 400 rows 118 cols
[2023-03-13 12:13:43] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-13 12:13:44] [INFO ] Implicit Places using invariants and state equation in 587 ms returned [40]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1124 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 9 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 1195 ms. Remains : 117/518 places, 400/400 transitions.
Support contains 63 out of 117 places after structural reductions.
[2023-03-13 12:13:44] [INFO ] Flatten gal took : 148 ms
[2023-03-13 12:13:44] [INFO ] Flatten gal took : 92 ms
[2023-03-13 12:13:44] [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 13 steps, including 0 resets, run visited all 25 properties in 24 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 10 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 12:13:45] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-13 12:13:45] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 12:13:45] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-13 12:13:46] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned [77, 78]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1402 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 12 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 1424 ms. Remains : 115/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 424 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 3 ms.
FORMULA NQueens-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-00 finished in 1941 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 28 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 12:13:47] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-13 12:13:47] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 12:13:47] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-13 12:13:48] [INFO ] Implicit Places using invariants and state equation in 866 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1260 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 20 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 1308 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 40 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 17 steps with 0 reset in 3 ms.
FORMULA NQueens-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-02 finished in 1369 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 13 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 12:13:48] [INFO ] Invariants computation overflowed in 22 ms
[2023-03-13 12:13:49] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 12:13:49] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-13 12:13:50] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1346 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 14 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 1373 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NQueens-PT-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 17 steps with 0 reset in 3 ms.
FORMULA NQueens-PT-20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-03 finished in 1517 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 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 12:13:50] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-13 12:13:50] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 12:13:50] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-13 12:13:51] [INFO ] Implicit Places using invariants and state equation in 932 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1257 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 5 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 1267 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 98 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 42 steps with 12 reset in 8 ms.
FORMULA NQueens-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-04 finished in 1390 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 4 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 12:13:51] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-13 12:13:52] [INFO ] Implicit Places using invariants in 377 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 12:13:52] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-13 12:13:53] [INFO ] Implicit Places using invariants and state equation in 983 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1367 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 1374 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 397 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 18007 reset in 4893 ms.
Product exploration explored 100000 steps with 18210 reset in 4869 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 542 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 12537 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 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 12:14:04] [INFO ] Invariants computation overflowed in 24 ms
[2023-03-13 12:14:04] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 12:14:04] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-13 12:14:05] [INFO ] Implicit Places using invariants and state equation in 764 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1060 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 9 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 1077 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 108 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 17 steps with 5 reset in 3 ms.
FORMULA NQueens-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-07 finished in 1205 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 3 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 12:14:05] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 12:14:05] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 12:14:05] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 12:14:06] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1353 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 1360 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 189 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 15824 reset in 5251 ms.
Product exploration explored 100000 steps with 15773 reset in 4687 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 204 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 12152 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 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 12:14:17] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 12:14:17] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 12:14:17] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-13 12:14:18] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1391 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 1402 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 318 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 1 ms.
FORMULA NQueens-PT-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-10 finished in 1739 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 12:14:19] [INFO ] Invariants computation overflowed in 20 ms
[2023-03-13 12:14:19] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 12:14:19] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-13 12:14:20] [INFO ] Implicit Places using invariants and state equation in 964 ms returned [77, 78, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1229 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 5 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 1240 ms. Remains : 114/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 139 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 37 steps with 1 reset in 2 ms.
FORMULA NQueens-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLFireability-11 finished in 1398 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 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 12:14:20] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-13 12:14:20] [INFO ] Implicit Places using invariants in 286 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 12:14:20] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 12:14:21] [INFO ] Implicit Places using invariants and state equation in 765 ms returned [116]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1055 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 6 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 1069 ms. Remains : 116/117 places, 400/400 transitions.
Stuttering acceptance computed with spot in 78 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 5404 reset in 3083 ms.
Product exploration explored 100000 steps with 5409 reset in 2694 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 425 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 80 ms :[(OR (NOT p0) p1), p1]
Finished random walk after 9 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=1 )
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 563 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 106 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) p1), p1]
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 12:14:29] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-13 12:14:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 12:14:36] [INFO ] [Real]Absence check using state equation in 7334 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 12:14:36] [INFO ] Invariants computation overflowed in 27 ms
[2023-03-13 12:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 12:14:44] [INFO ] [Real]Absence check using state equation in 7075 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 4 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 12:14:44] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 12:14:44] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 12:14:44] [INFO ] Invariants computation overflowed in 20 ms
[2023-03-13 12:14:45] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
[2023-03-13 12:14:45] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 12:14:45] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 12:14:45] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1379 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 505 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 95 ms :[(OR (NOT p0) p1), p1]
Finished random walk after 11 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 583 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 97 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) p1), p1]
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 12:14:47] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-13 12:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 12:14:55] [INFO ] [Real]Absence check using state equation in 7377 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 12:14:55] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-13 12:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 12:15:02] [INFO ] [Real]Absence check using state equation in 7285 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) p1), p1]
Product exploration explored 100000 steps with 5402 reset in 2725 ms.
Product exploration explored 100000 steps with 5408 reset in 2566 ms.
Built C files in :
/tmp/ltsmin9832850122890165258
[2023-03-13 12:15:08] [INFO ] Computing symmetric may disable matrix : 400 transitions.
[2023-03-13 12:15:08] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 12:15:08] [INFO ] Computing symmetric may enable matrix : 400 transitions.
[2023-03-13 12:15:08] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 12:15:08] [INFO ] Computing Do-Not-Accords matrix : 400 transitions.
[2023-03-13 12:15:08] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 12:15:08] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9832850122890165258
Running compilation step : cd /tmp/ltsmin9832850122890165258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1769 ms.
Running link step : cd /tmp/ltsmin9832850122890165258;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin9832850122890165258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5450153763818151510.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 5 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 12:15:23] [INFO ] Invariants computation overflowed in 20 ms
[2023-03-13 12:15:23] [INFO ] Implicit Places using invariants in 237 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 12:15:23] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 12:15:24] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
[2023-03-13 12:15:24] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2023-03-13 12:15:24] [INFO ] Invariants computation overflowed in 25 ms
[2023-03-13 12:15:24] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1314 ms. Remains : 116/116 places, 400/400 transitions.
Built C files in :
/tmp/ltsmin9714357164273872176
[2023-03-13 12:15:24] [INFO ] Computing symmetric may disable matrix : 400 transitions.
[2023-03-13 12:15:24] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 12:15:24] [INFO ] Computing symmetric may enable matrix : 400 transitions.
[2023-03-13 12:15:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 12:15:24] [INFO ] Computing Do-Not-Accords matrix : 400 transitions.
[2023-03-13 12:15:24] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 12:15:24] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9714357164273872176
Running compilation step : cd /tmp/ltsmin9714357164273872176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1668 ms.
Running link step : cd /tmp/ltsmin9714357164273872176;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9714357164273872176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13124646809087243302.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-13 12:15:39] [INFO ] Flatten gal took : 42 ms
[2023-03-13 12:15:39] [INFO ] Flatten gal took : 42 ms
[2023-03-13 12:15:39] [INFO ] Time to serialize gal into /tmp/LTL10103024612059802297.gal : 7 ms
[2023-03-13 12:15:39] [INFO ] Time to serialize properties into /tmp/LTL8111861570508999704.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10103024612059802297.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15611105335059717907.hoa' '-atoms' '/tmp/LTL8111861570508999704.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8111861570508999704.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15611105335059717907.hoa
Detected timeout of ITS tools.
[2023-03-13 12:15:55] [INFO ] Flatten gal took : 40 ms
[2023-03-13 12:15:55] [INFO ] Flatten gal took : 32 ms
[2023-03-13 12:15:55] [INFO ] Time to serialize gal into /tmp/LTL1509479578077471120.gal : 7 ms
[2023-03-13 12:15:55] [INFO ] Time to serialize properties into /tmp/LTL2850434297413312060.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1509479578077471120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2850434297413312060.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G("(((cX_0<1)||(cY_0<1))||((L_19<1)||(R_1<1)))"))&&("(((cX_19<1)||(cY_0<1))||((L_38<1)||(R_20<1)))"))))
Formula 0 simplified : G(!"(((cX_19<1)||(cY_0<1))||((L_38<1)||(R_20<1)))" | F!"(((cX_0<1)||(cY_0<1))||((L_19<1)||(R_1<1)))")
Detected timeout of ITS tools.
[2023-03-13 12:16:10] [INFO ] Flatten gal took : 29 ms
[2023-03-13 12:16:10] [INFO ] Applying decomposition
[2023-03-13 12:16:10] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6912222661762892931.txt' '-o' '/tmp/graph6912222661762892931.bin' '-w' '/tmp/graph6912222661762892931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6912222661762892931.bin' '-l' '-1' '-v' '-w' '/tmp/graph6912222661762892931.weights' '-q' '0' '-e' '0.001'
[2023-03-13 12:16:10] [INFO ] Decomposing Gal with order
[2023-03-13 12:16:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 12:16:10] [INFO ] Removed a total of 1482 redundant transitions.
[2023-03-13 12:16:10] [INFO ] Flatten gal took : 110 ms
[2023-03-13 12:16:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-13 12:16:10] [INFO ] Time to serialize gal into /tmp/LTL17915686441544977341.gal : 8 ms
[2023-03-13 12:16:10] [INFO ] Time to serialize properties into /tmp/LTL12946386816085961267.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17915686441544977341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12946386816085961267.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("(((u0.cX_0<1)||(u20.cY_0<1))||((u58.L_19<1)||(u78.R_1<1)))"))&&("(((u19.cX_19<1)||(u20.cY_0<1))||((u77.L_38<1)||(u97.R_20<1))...161
Formula 0 simplified : G(!"(((u19.cX_19<1)||(u20.cY_0<1))||((u77.L_38<1)||(u97.R_20<1)))" | F!"(((u0.cX_0<1)||(u20.cY_0<1))||((u58.L_19<1)||(u78.R_1<1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16249604783531400634
[2023-03-13 12:16:25] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16249604783531400634
Running compilation step : cd /tmp/ltsmin16249604783531400634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1142 ms.
Running link step : cd /tmp/ltsmin16249604783531400634;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16249604783531400634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))&&(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NQueens-PT-20-LTLFireability-13 finished in 140080 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 12:16:41] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14731696771781194082
[2023-03-13 12:16:41] [INFO ] Computing symmetric may disable matrix : 400 transitions.
[2023-03-13 12:16:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 12:16:41] [INFO ] Computing symmetric may enable matrix : 400 transitions.
[2023-03-13 12:16:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 12:16:41] [INFO ] Applying decomposition
[2023-03-13 12:16:41] [INFO ] Flatten gal took : 37 ms
[2023-03-13 12:16:41] [INFO ] Computing Do-Not-Accords matrix : 400 transitions.
[2023-03-13 12:16:41] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-13 12:16:41] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14731696771781194082
Running compilation step : cd /tmp/ltsmin14731696771781194082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph299755767820570616.txt' '-o' '/tmp/graph299755767820570616.bin' '-w' '/tmp/graph299755767820570616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph299755767820570616.bin' '-l' '-1' '-v' '-w' '/tmp/graph299755767820570616.weights' '-q' '0' '-e' '0.001'
[2023-03-13 12:16:41] [INFO ] Decomposing Gal with order
[2023-03-13 12:16:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 12:16:41] [INFO ] Removed a total of 1482 redundant transitions.
[2023-03-13 12:16:41] [INFO ] Flatten gal took : 173 ms
[2023-03-13 12:16:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-13 12:16:41] [INFO ] Time to serialize gal into /tmp/LTLFireability16732121173507374304.gal : 7 ms
[2023-03-13 12:16:41] [INFO ] Time to serialize properties into /tmp/LTLFireability12406258615071452406.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16732121173507374304.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12406258615071452406.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F(("(((u19.cX_19<1)||(u20.cY_0<1))||((u77.L_38<1)||(u97.R_20<1)))")&&(G(!("(((u0.cX_0>=1)&&(u20.cY_0>=1))&&((u58.L_19>=1)&&(u78.R_1...168
Formula 0 simplified : G(!"(((u19.cX_19<1)||(u20.cY_0<1))||((u77.L_38<1)||(u97.R_20<1)))" | F"(((u0.cX_0>=1)&&(u20.cY_0>=1))&&((u58.L_19>=1)&&(u78.R_1>=1))...158
Compilation finished in 1946 ms.
Running link step : cd /tmp/ltsmin14731696771781194082;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14731696771781194082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&[](!(LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-13 12:37:42] [INFO ] Flatten gal took : 76 ms
[2023-03-13 12:37:42] [INFO ] Time to serialize gal into /tmp/LTLFireability3090471295949278685.gal : 5 ms
[2023-03-13 12:37:42] [INFO ] Time to serialize properties into /tmp/LTLFireability15992288838891307909.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3090471295949278685.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15992288838891307909.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(("(((cX_19<1)||(cY_0<1))||((L_38<1)||(R_20<1)))")&&(G(!("(((cX_0>=1)&&(cY_0>=1))&&((L_19>=1)&&(R_1>=1)))"))))))
Formula 0 simplified : G(!"(((cX_19<1)||(cY_0<1))||((L_38<1)||(R_20<1)))" | F"(((cX_0>=1)&&(cY_0>=1))&&((L_19>=1)&&(R_1>=1)))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.043: Initializing POR dependencies: labels 402, guards 400
pins2lts-mc-linux64( 1/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 1.202: LTL layer: formula: <>(((LTLAPp0==true)&&[](!(LTLAPp1==true))))
pins2lts-mc-linux64( 6/ 8), 1.202: "<>(((LTLAPp0==true)&&[](!(LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 1.203: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 1.386: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 1.406: There are 403 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.406: State length is 118, there are 405 groups
pins2lts-mc-linux64( 0/ 8), 1.406: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.406: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.406: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.406: Visible groups: 0 / 405, labels: 2 / 403
pins2lts-mc-linux64( 0/ 8), 1.406: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 1.406: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 2.166: [Blue] ~19 levels ~960 states ~29664 transitions
pins2lts-mc-linux64( 6/ 8), 2.219: [Blue] ~19 levels ~1920 states ~32000 transitions
pins2lts-mc-linux64( 6/ 8), 2.325: [Blue] ~20 levels ~3840 states ~37792 transitions
pins2lts-mc-linux64( 6/ 8), 2.519: [Blue] ~20 levels ~7680 states ~48176 transitions
pins2lts-mc-linux64( 6/ 8), 2.939: [Blue] ~20 levels ~15360 states ~70944 transitions
pins2lts-mc-linux64( 1/ 8), 3.863: [Blue] ~19 levels ~30720 states ~118192 transitions
pins2lts-mc-linux64( 6/ 8), 5.033: [Blue] ~20 levels ~61440 states ~228040 transitions
pins2lts-mc-linux64( 2/ 8), 8.816: [Blue] ~20 levels ~122880 states ~465240 transitions
pins2lts-mc-linux64( 5/ 8), 15.305: [Blue] ~21 levels ~245760 states ~915200 transitions
pins2lts-mc-linux64( 2/ 8), 28.334: [Blue] ~20 levels ~491520 states ~2048304 transitions
pins2lts-mc-linux64( 1/ 8), 53.257: [Blue] ~21 levels ~983040 states ~4174224 transitions
pins2lts-mc-linux64( 1/ 8), 104.972: [Blue] ~21 levels ~1966080 states ~8667144 transitions
pins2lts-mc-linux64( 1/ 8), 215.349: [Blue] ~21 levels ~3932160 states ~18336520 transitions
pins2lts-mc-linux64( 5/ 8), 451.118: [Blue] ~21 levels ~7864320 states ~38954704 transitions
pins2lts-mc-linux64( 2/ 8), 942.489: [Blue] ~20 levels ~15728640 states ~83003184 transitions
pins2lts-mc-linux64( 7/ 8), 1263.480: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1263.624:
pins2lts-mc-linux64( 0/ 8), 1263.624: Explored 19785632 states 107000972 transitions, fanout: 5.408
pins2lts-mc-linux64( 0/ 8), 1263.624: Total exploration time 1262.210 sec (1262.060 sec minimum, 1262.124 sec on average)
pins2lts-mc-linux64( 0/ 8), 1263.624: States per second: 15675, Transitions per second: 84773
pins2lts-mc-linux64( 0/ 8), 1263.624:
pins2lts-mc-linux64( 0/ 8), 1263.624: State space has 19798709 states, 354215 are accepting
pins2lts-mc-linux64( 0/ 8), 1263.624: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1263.624: blue states: 19785632 (99.93%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1263.624: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1263.624: all-red states: 354215 (1.79%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1263.624:
pins2lts-mc-linux64( 0/ 8), 1263.624: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1263.624:
pins2lts-mc-linux64( 0/ 8), 1263.624: Queue width: 8B, total height: 168, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1263.624: Tree memory: 407.1MB, 21.6 B/state, compr.: 4.5%
pins2lts-mc-linux64( 0/ 8), 1263.624: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1263.624: Stored 449 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1263.624: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1263.624: Est. total memory use: 407.1MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14731696771781194082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&[](!(LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14731696771781194082;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&[](!(LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-13 12:58:45] [INFO ] Flatten gal took : 639 ms
[2023-03-13 12:58:46] [INFO ] Input system was already deterministic with 400 transitions.
[2023-03-13 12:58:47] [INFO ] Transformed 117 places.
[2023-03-13 12:58:47] [INFO ] Transformed 400 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
java.lang.NullPointerException: Cannot read the array length because "order" is null
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.computeOrderWithGreatSPN(MultiOrderRunner.java:60)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:143)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:815)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 12:58:47] [INFO ] Time to serialize gal into /tmp/LTLFireability12140445456285680826.gal : 10 ms
[2023-03-13 12:58:47] [INFO ] Time to serialize properties into /tmp/LTLFireability18165038125149909283.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12140445456285680826.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18165038125149909283.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("(((cX_19<1)||(cY_0<1))||((L_38<1)||(R_20<1)))")&&(G(!("(((cX_0>=1)&&(cY_0>=1))&&((L_19>=1)&&(R_1>=1)))"))))))
Formula 0 simplified : G(!"(((cX_19<1)||(cY_0<1))||((L_38<1)||(R_20<1)))" | F"(((cX_0>=1)&&(cY_0>=1))&&((L_19>=1)&&(R_1>=1)))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 446484 kB
After kill :
MemTotal: 16393216 kB
MemFree: 11294180 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r261-smll-167863535800052"
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 ;