About the Execution of LoLa+red for NQueens-PT-25
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 489.388 | 165011.00 | 187611.00 | 1133.70 | TFFFTTFTFFTFFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r263-smll-167863537700060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is NQueens-PT-25, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863537700060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.1K Feb 26 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.5K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 26 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:27 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 534K 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-25-LTLFireability-00
FORMULA_NAME NQueens-PT-25-LTLFireability-01
FORMULA_NAME NQueens-PT-25-LTLFireability-02
FORMULA_NAME NQueens-PT-25-LTLFireability-03
FORMULA_NAME NQueens-PT-25-LTLFireability-04
FORMULA_NAME NQueens-PT-25-LTLFireability-05
FORMULA_NAME NQueens-PT-25-LTLFireability-06
FORMULA_NAME NQueens-PT-25-LTLFireability-07
FORMULA_NAME NQueens-PT-25-LTLFireability-08
FORMULA_NAME NQueens-PT-25-LTLFireability-09
FORMULA_NAME NQueens-PT-25-LTLFireability-10
FORMULA_NAME NQueens-PT-25-LTLFireability-11
FORMULA_NAME NQueens-PT-25-LTLFireability-12
FORMULA_NAME NQueens-PT-25-LTLFireability-13
FORMULA_NAME NQueens-PT-25-LTLFireability-14
FORMULA_NAME NQueens-PT-25-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678714747216
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NQueens-PT-25
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-13 13:39:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 13:39:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 13:39:11] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2023-03-13 13:39:11] [INFO ] Transformed 775 places.
[2023-03-13 13:39:11] [INFO ] Transformed 625 transitions.
[2023-03-13 13:39:11] [INFO ] Parsed PT model containing 775 places and 625 transitions and 3125 arcs in 406 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-25-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-25-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 773/773 places, 625/625 transitions.
Reduce places removed 625 places and 0 transitions.
Iterating post reduction 0 with 625 rules applied. Total rules applied 625 place count 148 transition count 625
Applied a total of 625 rules in 47 ms. Remains 148 /773 variables (removed 625) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 148 cols
[2023-03-13 13:39:11] [INFO ] Invariants computation overflowed in 202 ms
[2023-03-13 13:39:12] [INFO ] Implicit Places using invariants in 703 ms returned []
// Phase 1: matrix 625 rows 148 cols
[2023-03-13 13:39:12] [INFO ] Invariants computation overflowed in 166 ms
[2023-03-13 13:39:13] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned [50, 98, 99, 147]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 2109 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/773 places, 625/625 transitions.
Applied a total of 0 rules in 8 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2167 ms. Remains : 144/773 places, 625/625 transitions.
Support contains 78 out of 144 places after structural reductions.
[2023-03-13 13:39:14] [INFO ] Flatten gal took : 230 ms
[2023-03-13 13:39:14] [INFO ] Flatten gal took : 147 ms
[2023-03-13 13:39:14] [INFO ] Input system was already deterministic with 625 transitions.
Support contains 77 out of 144 places (down from 78) after GAL structural reductions.
Finished random walk after 17 steps, including 0 resets, run visited all 29 properties in 31 ms. (steps per millisecond=0 )
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
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' '!((G(p0)||X(F(p1))))'
Support contains 7 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 25 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:39:15] [INFO ] Invariants computation overflowed in 86 ms
[2023-03-13 13:39:15] [INFO ] Implicit Places using invariants in 586 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:39:15] [INFO ] Invariants computation overflowed in 101 ms
[2023-03-13 13:39:17] [INFO ] Implicit Places using invariants and state equation in 2098 ms returned []
Implicit Place search using SMT with State Equation took 2699 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:39:17] [INFO ] Invariants computation overflowed in 81 ms
[2023-03-13 13:39:18] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3392 ms. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 422 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-25-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s15 1) (LT s32 1) (LT s81 1) (LT s118 1)), p0:(AND (GEQ s7 1) (GEQ s32 1) (GEQ s73 1) (GEQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14268 reset in 8526 ms.
Product exploration explored 100000 steps with 14215 reset in 7530 ms.
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 484 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-25-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-00 finished in 21510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 8 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 24 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:39:36] [INFO ] Invariants computation overflowed in 78 ms
[2023-03-13 13:39:36] [INFO ] Implicit Places using invariants in 533 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:39:37] [INFO ] Invariants computation overflowed in 78 ms
[2023-03-13 13:39:38] [INFO ] Implicit Places using invariants and state equation in 1999 ms returned []
Implicit Place search using SMT with State Equation took 2542 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:39:39] [INFO ] Invariants computation overflowed in 78 ms
[2023-03-13 13:39:39] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3334 ms. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s48 1) (GEQ s53 1) (GEQ s122 1)) (AND (GEQ s9 1) (GEQ s31 1) (GEQ s76 1) (GEQ s111 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-25-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-02 finished in 3489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G((X(p1)&&p0))))||(!p2 U (p3||G(!p2)))))'
Support contains 11 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 12 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:39:40] [INFO ] Invariants computation overflowed in 77 ms
[2023-03-13 13:39:40] [INFO ] Implicit Places using invariants in 419 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:39:40] [INFO ] Invariants computation overflowed in 77 ms
[2023-03-13 13:39:42] [INFO ] Implicit Places using invariants and state equation in 2023 ms returned []
Implicit Place search using SMT with State Equation took 2444 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:39:42] [INFO ] Invariants computation overflowed in 85 ms
[2023-03-13 13:39:43] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3286 ms. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 571 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p3) p2)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p2 (NOT p1))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=5 dest: 5}, { cond=(OR (AND (NOT p3) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 8}]], initial=6, aps=[p0:(AND (GEQ s24 1) (GEQ s27 1) (GEQ s95 1) (GEQ s122 1)), p3:(AND (NOT (AND (GEQ s24 1) (GEQ s27 1) (GEQ s95 1) (GEQ s122 1))) (NOT (AND (GEQ s9 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-25-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-03 finished in 3899 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 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 7 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:39:43] [INFO ] Invariants computation overflowed in 90 ms
[2023-03-13 13:39:44] [INFO ] Implicit Places using invariants in 573 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:39:44] [INFO ] Invariants computation overflowed in 83 ms
[2023-03-13 13:39:46] [INFO ] Implicit Places using invariants and state equation in 1954 ms returned []
Implicit Place search using SMT with State Equation took 2545 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:39:46] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-13 13:39:47] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3190 ms. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-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:(OR (LT s5 1) (LT s38 1) (LT s65 1) (LT s114 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]]
Product exploration explored 100000 steps with 13820 reset in 7684 ms.
Product exploration explored 100000 steps with 13726 reset in 7971 ms.
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 205 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-25-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-04 finished in 20464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 6 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:04] [INFO ] Invariants computation overflowed in 77 ms
[2023-03-13 13:40:04] [INFO ] Implicit Places using invariants in 488 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:04] [INFO ] Invariants computation overflowed in 78 ms
[2023-03-13 13:40:06] [INFO ] Implicit Places using invariants and state equation in 2017 ms returned []
Implicit Place search using SMT with State Equation took 2528 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:06] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-13 13:40:07] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3124 ms. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s22 1) (LT s39 1) (LT s81 1) (LT s132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13127 reset in 8236 ms.
Product exploration explored 100000 steps with 13037 reset in 7653 ms.
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-25-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-05 finished in 20307 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 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 6 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:24] [INFO ] Invariants computation overflowed in 80 ms
[2023-03-13 13:40:25] [INFO ] Implicit Places using invariants in 532 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:25] [INFO ] Invariants computation overflowed in 77 ms
[2023-03-13 13:40:27] [INFO ] Implicit Places using invariants and state equation in 1928 ms returned []
Implicit Place search using SMT with State Equation took 2462 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:27] [INFO ] Invariants computation overflowed in 80 ms
[2023-03-13 13:40:27] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3185 ms. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-06 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 s23 1) (GEQ s30 1) (GEQ s91 1) (GEQ s124 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 37 steps with 8 reset in 4 ms.
FORMULA NQueens-PT-25-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-06 finished in 3316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Support contains 8 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:27] [INFO ] Invariants computation overflowed in 79 ms
[2023-03-13 13:40:28] [INFO ] Implicit Places using invariants in 481 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:28] [INFO ] Invariants computation overflowed in 78 ms
[2023-03-13 13:40:30] [INFO ] Implicit Places using invariants and state equation in 2032 ms returned []
Implicit Place search using SMT with State Equation took 2517 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:30] [INFO ] Invariants computation overflowed in 78 ms
[2023-03-13 13:40:31] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3287 ms. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s47 1) (GEQ s59 1) (GEQ s126 1)), p1:(OR (LT s20 1) (LT s42 1) (LT s76 1) (LT s133 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5458 reset in 5093 ms.
Product exploration explored 100000 steps with 5452 reset in 4852 ms.
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), true, (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 4 factoid took 478 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-25-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-07 finished in 15195 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(p0)||G(F(p1))))'
Support contains 12 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 20 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:43] [INFO ] Invariants computation overflowed in 77 ms
[2023-03-13 13:40:43] [INFO ] Implicit Places using invariants in 491 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:43] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-13 13:40:45] [INFO ] Implicit Places using invariants and state equation in 1856 ms returned []
Implicit Place search using SMT with State Equation took 2350 ms to find 0 implicit places.
[2023-03-13 13:40:45] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:45] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-13 13:40:46] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3143 ms. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s25 1) (GEQ s76 1) (GEQ s99 1)), p1:(OR (AND (GEQ s5 1) (GEQ s40 1) (GEQ s63 1) (GEQ s116 1)) (AND (OR (LT s20 1) (LT s35 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-25-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-08 finished in 3335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(p1||F(p2)))))'
Support contains 11 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:46] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-13 13:40:46] [INFO ] Implicit Places using invariants in 511 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:47] [INFO ] Invariants computation overflowed in 78 ms
[2023-03-13 13:40:48] [INFO ] Implicit Places using invariants and state equation in 1983 ms returned []
Implicit Place search using SMT with State Equation took 2498 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:48] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-13 13:40:49] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3335 ms. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : NQueens-PT-25-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (GEQ s10 1) (GEQ s42 1) (GEQ s66 1) (GEQ s123 1)), p1:(AND (GEQ s16 1) (GEQ s42 1) (GEQ s72 1) (GEQ s129 1)), p2:(AND (GEQ s3 1) (GEQ s46 1) (GEQ ...], 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 4 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-25-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-09 finished in 3626 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&&X((!p1 U (p2||G(!p1))))))))'
Support contains 11 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:50] [INFO ] Invariants computation overflowed in 79 ms
[2023-03-13 13:40:50] [INFO ] Implicit Places using invariants in 510 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:50] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-13 13:40:52] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 2400 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:40:52] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-13 13:40:53] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3183 ms. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : NQueens-PT-25-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s19 1) (LT s33 1) (LT s84 1) (LT s123 1)), p2:(AND (NOT (AND (GEQ s6 1) (GEQ s44 1) (GEQ s60 1) (GEQ s121 1))) (NOT (AND (GEQ s3 1) (GEQ s49 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8547 reset in 6749 ms.
Product exploration explored 100000 steps with 8543 reset in 6806 ms.
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
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) p1), (F (G p0)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X p0), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p2) p1)
Knowledge based reduction with 4 factoid took 726 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-25-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-10 finished in 18920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((!p0 U (G(p1)&&(!p2||G(p0))))))))'
Support contains 12 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:41:09] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-13 13:41:09] [INFO ] Implicit Places using invariants in 486 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:41:09] [INFO ] Invariants computation overflowed in 82 ms
[2023-03-13 13:41:11] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 2406 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:41:11] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-13 13:41:12] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3155 ms. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 501 ms :[(OR (NOT p1) (AND (NOT p0) p2)), (OR (NOT p1) (AND (NOT p0) p2)), (OR (NOT p1) (AND (NOT p0) p2)), true, (NOT p1), (NOT p0), (OR (NOT p1) (AND (NOT p0) p2)), (NOT p1)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 3}, { cond=(AND p1 p0), acceptance={} source=6 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 3}, { cond=(AND p1 p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s15 1) (GEQ s31 1) (GEQ s82 1) (GEQ s117 1)), p0:(AND (GEQ s19 1) (GEQ s28 1) (GEQ s89 1) (GEQ s118 1)), p2:(AND (GEQ s16 1) (GEQ s49 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-25-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-11 finished in 3693 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 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 13 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:41:12] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-13 13:41:13] [INFO ] Implicit Places using invariants in 518 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:41:13] [INFO ] Invariants computation overflowed in 79 ms
[2023-03-13 13:41:15] [INFO ] Implicit Places using invariants and state equation in 1858 ms returned []
Implicit Place search using SMT with State Equation took 2378 ms to find 0 implicit places.
[2023-03-13 13:41:15] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:41:15] [INFO ] Invariants computation overflowed in 66 ms
[2023-03-13 13:41:15] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2988 ms. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-12 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 s2 1) (GEQ s37 1) (GEQ s63 1) (GEQ s110 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 22 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-25-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-12 finished in 3066 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(p1)&&p0))||F((!p2 U (p3||G(!p2))))))'
Support contains 12 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 7 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:41:15] [INFO ] Invariants computation overflowed in 77 ms
[2023-03-13 13:41:16] [INFO ] Implicit Places using invariants in 480 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:41:16] [INFO ] Invariants computation overflowed in 82 ms
[2023-03-13 13:41:18] [INFO ] Implicit Places using invariants and state equation in 1944 ms returned []
Implicit Place search using SMT with State Equation took 2426 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:41:18] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-13 13:41:18] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3209 ms. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p3) p2), (AND (NOT p3) (NOT p1) p2)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (NOT (AND (GEQ s11 1) (GEQ s49 1) (GEQ s60 1) (GEQ s131 1))) (NOT (AND (GEQ s15 1) (GEQ s40 1) (GEQ s73 1) (GEQ s126 1)))), p0:(AND (GEQ s2 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14676 reset in 8991 ms.
Product exploration explored 100000 steps with 14715 reset in 8046 ms.
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
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 p3) p0 (NOT p1) p2), (F (G p3)), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p3) p0 (NOT p1))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p3) p2 (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
Property proved to be true thanks to knowledge :(F (G p3))
Knowledge based reduction with 5 factoid took 531 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-25-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-14 finished in 22123 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 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 12 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:41:37] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-13 13:41:38] [INFO ] Implicit Places using invariants in 483 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:41:38] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-13 13:41:40] [INFO ] Implicit Places using invariants and state equation in 1967 ms returned []
Implicit Place search using SMT with State Equation took 2462 ms to find 0 implicit places.
[2023-03-13 13:41:40] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2023-03-13 13:41:40] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-13 13:41:40] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3055 ms. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s24 1) (LT s29 1) (LT s93 1) (LT s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4312 reset in 4305 ms.
Product exploration explored 100000 steps with 4310 reset in 4219 ms.
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-25-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-15 finished in 13009 ms.
All properties solved by simple procedures.
Total runtime 160242 ms.
ITS solved all properties within timeout
BK_STOP 1678714912227
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NQueens-PT-25"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is NQueens-PT-25, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863537700060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-25.tgz
mv NQueens-PT-25 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 '
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 ;