fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r140-tall-162089127200068
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for NQueens-PT-30

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
333.060 136819.00 74612.00 46287.10 FTFFFFTFFTFTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127200068.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NQueens-PT-30, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127200068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 07:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 07:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 759K May 5 16:51 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-30-00
FORMULA_NAME NQueens-PT-30-01
FORMULA_NAME NQueens-PT-30-02
FORMULA_NAME NQueens-PT-30-03
FORMULA_NAME NQueens-PT-30-04
FORMULA_NAME NQueens-PT-30-05
FORMULA_NAME NQueens-PT-30-06
FORMULA_NAME NQueens-PT-30-07
FORMULA_NAME NQueens-PT-30-08
FORMULA_NAME NQueens-PT-30-09
FORMULA_NAME NQueens-PT-30-10
FORMULA_NAME NQueens-PT-30-11
FORMULA_NAME NQueens-PT-30-12
FORMULA_NAME NQueens-PT-30-13
FORMULA_NAME NQueens-PT-30-14
FORMULA_NAME NQueens-PT-30-15

=== Now, execution of the tool begins

BK_START 1620926168173

Running Version 0
[2021-05-13 17:16:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 17:16:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 17:16:21] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2021-05-13 17:16:21] [INFO ] Transformed 1080 places.
[2021-05-13 17:16:21] [INFO ] Transformed 900 transitions.
[2021-05-13 17:16:21] [INFO ] Parsed PT model containing 1080 places and 900 transitions in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 17:16:21] [INFO ] Initial state test concluded for 2 properties.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-30-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 1078 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1078/1078 places, 900/900 transitions.
Reduce places removed 867 places and 0 transitions.
Iterating post reduction 0 with 867 rules applied. Total rules applied 867 place count 211 transition count 900
Applied a total of 867 rules in 46 ms. Remains 211 /1078 variables (removed 867) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 211 cols
[2021-05-13 17:16:21] [INFO ] Invariants computation overflowed in 172 ms
[2021-05-13 17:16:21] [INFO ] Implicit Places using invariants in 526 ms returned []
// Phase 1: matrix 900 rows 211 cols
[2021-05-13 17:16:21] [INFO ] Invariants computation overflowed in 126 ms
[2021-05-13 17:16:23] [INFO ] Implicit Places using invariants and state equation in 1694 ms returned [93, 151, 152, 210]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 2249 ms to find 4 implicit places.
// Phase 1: matrix 900 rows 207 cols
[2021-05-13 17:16:23] [INFO ] Invariants computation overflowed in 138 ms
[2021-05-13 17:16:23] [INFO ] Dead Transitions using invariants and state equation in 445 ms returned []
Starting structural reductions, iteration 1 : 207/1078 places, 900/900 transitions.
Applied a total of 0 rules in 15 ms. Remains 207 /207 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 207 cols
[2021-05-13 17:16:24] [INFO ] Invariants computation overflowed in 113 ms
[2021-05-13 17:16:24] [INFO ] Dead Transitions using invariants and state equation in 445 ms returned []
Finished structural reductions, in 2 iterations. Remains : 207/1078 places, 900/900 transitions.
[2021-05-13 17:16:24] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-13 17:16:24] [INFO ] Flatten gal took : 131 ms
FORMULA NQueens-PT-30-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 17:16:24] [INFO ] Flatten gal took : 90 ms
[2021-05-13 17:16:24] [INFO ] Input system was already deterministic with 900 transitions.
Incomplete random walk after 100000 steps, including 3585 resets, run finished after 6272 ms. (steps per millisecond=15 ) properties (out of 23) seen :15
Running SMT prover for 8 properties.
// Phase 1: matrix 900 rows 207 cols
[2021-05-13 17:16:36] [INFO ] Invariants computation overflowed in 90 ms
[2021-05-13 17:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:16:36] [INFO ] [Real]Absence check using state equation in 112 ms returned unsat
[2021-05-13 17:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:16:36] [INFO ] [Real]Absence check using state equation in 116 ms returned unsat
[2021-05-13 17:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:16:36] [INFO ] [Real]Absence check using state equation in 132 ms returned unsat
[2021-05-13 17:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:16:36] [INFO ] [Real]Absence check using state equation in 93 ms returned unsat
[2021-05-13 17:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:16:36] [INFO ] [Real]Absence check using state equation in 87 ms returned unsat
[2021-05-13 17:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:16:37] [INFO ] [Real]Absence check using state equation in 97 ms returned unsat
[2021-05-13 17:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:16:37] [INFO ] [Real]Absence check using state equation in 101 ms returned unsat
[2021-05-13 17:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 17:16:37] [INFO ] [Real]Absence check using state equation in 85 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
[2021-05-13 17:16:37] [INFO ] Initial state test concluded for 2 properties.
FORMULA NQueens-PT-30-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 900/900 transitions.
Graph (complete) has 132 edges and 207 vertex of which 176 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.3 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 176 /207 variables (removed 31) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:16:37] [INFO ] Invariants computation overflowed in 88 ms
[2021-05-13 17:16:37] [INFO ] Implicit Places using invariants in 303 ms returned []
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:16:37] [INFO ] Invariants computation overflowed in 123 ms
[2021-05-13 17:16:39] [INFO ] Implicit Places using invariants and state equation in 1670 ms returned []
Implicit Place search using SMT with State Equation took 1973 ms to find 0 implicit places.
[2021-05-13 17:16:39] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:16:39] [INFO ] Invariants computation overflowed in 87 ms
[2021-05-13 17:16:39] [INFO ] Dead Transitions using invariants and state equation in 364 ms returned []
Finished structural reductions, in 1 iterations. Remains : 176/207 places, 900/900 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0)]
Running random walk in product with property : NQueens-PT-30-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 518 steps with 18 reset in 37 ms.
FORMULA NQueens-PT-30-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-00 finished in 2617 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 900/900 transitions.
Graph (complete) has 132 edges and 207 vertex of which 174 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.2 ms
Discarding 33 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 174 /207 variables (removed 33) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2021-05-13 17:16:40] [INFO ] Invariants computation overflowed in 83 ms
[2021-05-13 17:16:40] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2021-05-13 17:16:40] [INFO ] Invariants computation overflowed in 84 ms
[2021-05-13 17:16:41] [INFO ] Implicit Places using invariants and state equation in 1574 ms returned []
Implicit Place search using SMT with State Equation took 1859 ms to find 0 implicit places.
[2021-05-13 17:16:41] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2021-05-13 17:16:41] [INFO ] Invariants computation overflowed in 146 ms
[2021-05-13 17:16:42] [INFO ] Dead Transitions using invariants and state equation in 423 ms returned []
Finished structural reductions, in 1 iterations. Remains : 174/207 places, 900/900 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut14925087631105174961.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 15258 ms :[false, (NOT p0)]
Running random walk in product with property : NQueens-PT-30-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s34)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 84 steps with 2 reset in 5 ms.
FORMULA NQueens-PT-30-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-03 finished in 17604 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((!p0&&X(F(p0)))||G(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 900/900 transitions.
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 176 transition count 900
Applied a total of 31 rules in 5 ms. Remains 176 /207 variables (removed 31) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:16:57] [INFO ] Invariants computation overflowed in 87 ms
[2021-05-13 17:16:57] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:16:57] [INFO ] Invariants computation overflowed in 98 ms
[2021-05-13 17:16:59] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 1936 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:16:59] [INFO ] Invariants computation overflowed in 90 ms
[2021-05-13 17:16:59] [INFO ] Dead Transitions using invariants and state equation in 440 ms returned []
Finished structural reductions, in 1 iterations. Remains : 176/207 places, 900/900 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-30-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1781 steps with 63 reset in 109 ms.
FORMULA NQueens-PT-30-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-04 finished in 2570 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 900/900 transitions.
Graph (complete) has 132 edges and 207 vertex of which 176 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 176 /207 variables (removed 31) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:17:00] [INFO ] Invariants computation overflowed in 102 ms
[2021-05-13 17:17:00] [INFO ] Implicit Places using invariants in 315 ms returned []
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:17:00] [INFO ] Invariants computation overflowed in 79 ms
[2021-05-13 17:17:02] [INFO ] Implicit Places using invariants and state equation in 1605 ms returned []
Implicit Place search using SMT with State Equation took 1937 ms to find 0 implicit places.
[2021-05-13 17:17:02] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:17:02] [INFO ] Invariants computation overflowed in 76 ms
[2021-05-13 17:17:02] [INFO ] Dead Transitions using invariants and state equation in 348 ms returned []
Finished structural reductions, in 1 iterations. Remains : 176/207 places, 900/900 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut8272423595389590435.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 10102 ms :[false]
Running random walk in product with property : NQueens-PT-30-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s0 s1)], 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 3584 reset in 6037 ms.
Product exploration explored 100000 steps with 3585 reset in 6030 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 176 transition count 900
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 : [(F (OR (G p0) (G (NOT p0)))), (NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-30-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-07 finished in 36710 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 900/900 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 178 transition count 900
Applied a total of 29 rules in 8 ms. Remains 178 /207 variables (removed 29) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2021-05-13 17:17:36] [INFO ] Invariants computation overflowed in 89 ms
[2021-05-13 17:17:37] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2021-05-13 17:17:37] [INFO ] Invariants computation overflowed in 92 ms
[2021-05-13 17:17:38] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 178 cols
[2021-05-13 17:17:38] [INFO ] Invariants computation overflowed in 110 ms
[2021-05-13 17:17:39] [INFO ] Dead Transitions using invariants and state equation in 373 ms returned []
Finished structural reductions, in 1 iterations. Remains : 178/207 places, 900/900 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-30-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ s0 s1) (GT s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA NQueens-PT-30-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-08 finished in 2390 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 900/900 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 177 transition count 900
Applied a total of 30 rules in 5 ms. Remains 177 /207 variables (removed 30) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 177 cols
[2021-05-13 17:17:39] [INFO ] Invariants computation overflowed in 89 ms
[2021-05-13 17:17:39] [INFO ] Implicit Places using invariants in 317 ms returned []
// Phase 1: matrix 900 rows 177 cols
[2021-05-13 17:17:39] [INFO ] Invariants computation overflowed in 74 ms
[2021-05-13 17:17:41] [INFO ] Implicit Places using invariants and state equation in 1671 ms returned []
Implicit Place search using SMT with State Equation took 1991 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 177 cols
[2021-05-13 17:17:41] [INFO ] Invariants computation overflowed in 73 ms
[2021-05-13 17:17:41] [INFO ] Dead Transitions using invariants and state equation in 344 ms returned []
Finished structural reductions, in 1 iterations. Remains : 177/207 places, 900/900 transitions.
Stuttering acceptance computed with spot in 7811 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-30-12 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s2), p1:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-30-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-12 finished in 10165 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 900/900 transitions.
Graph (complete) has 132 edges and 207 vertex of which 176 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 176 /207 variables (removed 31) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:17:49] [INFO ] Invariants computation overflowed in 81 ms
[2021-05-13 17:17:49] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:17:49] [INFO ] Invariants computation overflowed in 84 ms
[2021-05-13 17:17:51] [INFO ] Implicit Places using invariants and state equation in 1637 ms returned []
Implicit Place search using SMT with State Equation took 1932 ms to find 0 implicit places.
[2021-05-13 17:17:51] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:17:51] [INFO ] Invariants computation overflowed in 85 ms
[2021-05-13 17:17:51] [INFO ] Dead Transitions using invariants and state equation in 359 ms returned []
Finished structural reductions, in 1 iterations. Remains : 176/207 places, 900/900 transitions.
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Running random walk in product with property : NQueens-PT-30-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 294 steps with 10 reset in 19 ms.
FORMULA NQueens-PT-30-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-13 finished in 2395 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 900/900 transitions.
Graph (complete) has 132 edges and 207 vertex of which 176 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 176 /207 variables (removed 31) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:17:51] [INFO ] Invariants computation overflowed in 82 ms
[2021-05-13 17:17:52] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:17:52] [INFO ] Invariants computation overflowed in 77 ms
[2021-05-13 17:17:53] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
[2021-05-13 17:17:53] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:17:53] [INFO ] Invariants computation overflowed in 75 ms
[2021-05-13 17:17:54] [INFO ] Dead Transitions using invariants and state equation in 356 ms returned []
Finished structural reductions, in 1 iterations. Remains : 176/207 places, 900/900 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, (G p0 | G!p0)], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 10113 ms :[false]
Running random walk in product with property : NQueens-PT-30-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s0 s1)], 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 3585 reset in 5925 ms.
Product exploration explored 100000 steps with 3584 reset in 5980 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 176 transition count 900
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 : [(F (OR (G p0) (G (NOT p0)))), (NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-30-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-14 finished in 28837 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 900/900 transitions.
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 176 transition count 900
Applied a total of 31 rules in 5 ms. Remains 176 /207 variables (removed 31) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:18:20] [INFO ] Invariants computation overflowed in 87 ms
[2021-05-13 17:18:20] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:18:21] [INFO ] Invariants computation overflowed in 78 ms
[2021-05-13 17:18:22] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 176 cols
[2021-05-13 17:18:22] [INFO ] Invariants computation overflowed in 71 ms
[2021-05-13 17:18:22] [INFO ] Dead Transitions using invariants and state equation in 344 ms returned []
Finished structural reductions, in 1 iterations. Remains : 176/207 places, 900/900 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : NQueens-PT-30-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6531 steps with 3265 reset in 697 ms.
FORMULA NQueens-PT-30-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-15 finished in 3054 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620926304992

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-30"
export BK_EXAMINATION="LTLCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is NQueens-PT-30, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089127200068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-30.tgz
mv NQueens-PT-30 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;