fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r132-tall-165271821500907
Last Updated
Jun 22, 2022

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
220.663 17904.00 26097.00 119.90 TFFFFFFTFFTFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 7.4K Apr 30 00:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 00:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 00:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 00:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 96K May 10 09:34 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-10-LTLCardinality-00
FORMULA_NAME NQueens-PT-10-LTLCardinality-01
FORMULA_NAME NQueens-PT-10-LTLCardinality-02
FORMULA_NAME NQueens-PT-10-LTLCardinality-03
FORMULA_NAME NQueens-PT-10-LTLCardinality-04
FORMULA_NAME NQueens-PT-10-LTLCardinality-05
FORMULA_NAME NQueens-PT-10-LTLCardinality-06
FORMULA_NAME NQueens-PT-10-LTLCardinality-07
FORMULA_NAME NQueens-PT-10-LTLCardinality-08
FORMULA_NAME NQueens-PT-10-LTLCardinality-09
FORMULA_NAME NQueens-PT-10-LTLCardinality-10
FORMULA_NAME NQueens-PT-10-LTLCardinality-11
FORMULA_NAME NQueens-PT-10-LTLCardinality-12
FORMULA_NAME NQueens-PT-10-LTLCardinality-13
FORMULA_NAME NQueens-PT-10-LTLCardinality-14
FORMULA_NAME NQueens-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652898217770

Running Version 202205111006
[2022-05-18 18:23:38] [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]
[2022-05-18 18:23:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 18:23:39] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2022-05-18 18:23:39] [INFO ] Transformed 160 places.
[2022-05-18 18:23:39] [INFO ] Transformed 100 transitions.
[2022-05-18 18:23:39] [INFO ] Parsed PT model containing 160 places and 100 transitions in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 100/100 transitions.
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 85 transition count 100
Applied a total of 73 rules in 15 ms. Remains 85 /158 variables (removed 73) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 85 cols
[2022-05-18 18:23:39] [INFO ] Computed 8 place invariants in 19 ms
[2022-05-18 18:23:39] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 100 rows 85 cols
[2022-05-18 18:23:39] [INFO ] Computed 8 place invariants in 6 ms
[2022-05-18 18:23:39] [INFO ] Implicit Places using invariants and state equation in 186 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 439 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/158 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 84/158 places, 100/100 transitions.
Support contains 39 out of 84 places after structural reductions.
[2022-05-18 18:23:39] [INFO ] Flatten gal took : 39 ms
[2022-05-18 18:23:39] [INFO ] Flatten gal took : 16 ms
[2022-05-18 18:23:39] [INFO ] Input system was already deterministic with 100 transitions.
Support contains 38 out of 84 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 1068 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 27) seen :17
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 100 rows 84 cols
[2022-05-18 18:23:40] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-18 18:23:40] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-05-18 18:23:40] [INFO ] [Real]Absence check using 1 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-18 18:23:41] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2022-05-18 18:23:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2022-05-18 18:23:41] [INFO ] [Nat]Absence check using 1 positive and 6 generalized place invariants in 14 ms returned sat
[2022-05-18 18:23:52] [INFO ] After 11035ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :0
Fused 10 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA NQueens-PT-10-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 10 atomic propositions for a total of 11 simplifications.
FORMULA NQueens-PT-10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 84 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 100
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((false U p0)))))'
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 100/100 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 59 transition count 100
Applied a total of 25 rules in 3 ms. Remains 59 /84 variables (removed 25) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 59 cols
[2022-05-18 18:23:52] [INFO ] Computed 6 place invariants in 8 ms
[2022-05-18 18:23:52] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 100 rows 59 cols
[2022-05-18 18:23:52] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-18 18:23:52] [INFO ] Implicit Places using invariants and state equation in 271 ms returned [39, 40]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 411 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/84 places, 100/100 transitions.
Applied a total of 0 rules in 13 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 57/84 places, 100/100 transitions.
Stuttering acceptance computed with spot in 314 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : NQueens-PT-10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ s0 s1)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 155 steps with 38 reset in 7 ms.
FORMULA NQueens-PT-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLCardinality-03 finished in 819 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 100/100 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 59 transition count 100
Applied a total of 25 rules in 3 ms. Remains 59 /84 variables (removed 25) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 59 cols
[2022-05-18 18:23:53] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-18 18:23:53] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 100 rows 59 cols
[2022-05-18 18:23:53] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-18 18:23:53] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [39, 40, 58]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 263 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/84 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 56/84 places, 100/100 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-10-LTLCardinality-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:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 38 steps with 10 reset in 2 ms.
FORMULA NQueens-PT-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLCardinality-05 finished in 415 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((!(X(p0)&&p1) U p2))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 100/100 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 59 transition count 100
Applied a total of 25 rules in 1 ms. Remains 59 /84 variables (removed 25) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 59 cols
[2022-05-18 18:23:53] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-18 18:23:53] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 100 rows 59 cols
[2022-05-18 18:23:53] [INFO ] Computed 6 place invariants in 10 ms
[2022-05-18 18:23:53] [INFO ] Implicit Places using invariants and state equation in 169 ms returned [39, 40, 58]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 257 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/84 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 56/84 places, 100/100 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p2) p0), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : NQueens-PT-10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ 1 s45), p2:(GT s50 s1), p1:(AND (LEQ 1 s45) (LEQ 1 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 67 steps with 29 reset in 1 ms.
FORMULA NQueens-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLCardinality-06 finished in 512 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(F(p0))&&X(p1))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 100/100 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 59 transition count 100
Applied a total of 25 rules in 3 ms. Remains 59 /84 variables (removed 25) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 59 cols
[2022-05-18 18:23:54] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-18 18:23:54] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 100 rows 59 cols
[2022-05-18 18:23:54] [INFO ] Computed 7 place invariants in 6 ms
[2022-05-18 18:23:54] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [39, 40, 58]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 205 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/84 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 56/84 places, 100/100 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : NQueens-PT-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s27 s0), p1:(GT s12 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA NQueens-PT-10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLCardinality-08 finished in 379 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(X(G((true U true))) U true))))'
Support contains 0 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 100/100 transitions.
Graph (complete) has 108 edges and 84 vertex of which 0 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.5 ms
Discarding 84 places :
Also discarding 100 output transitions
Drop transitions removed 100 transitions
Applied a total of 1 rules in 10 ms. Remains 0 /84 variables (removed 84) and now considering 0/100 (removed 100) transitions.
[2022-05-18 18:23:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-18 18:23:54] [INFO ] Implicit Places using invariants in 4 ms returned []
[2022-05-18 18:23:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-18 18:23:54] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2022-05-18 18:23:54] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-18 18:23:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-18 18:23:54] [INFO ] Dead Transitions using invariants and state equation in 9 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 0/84 places, 0/100 transitions.
Finished structural reductions, in 1 iterations. Remains : 0/84 places, 0/100 transitions.
Stuttering acceptance computed with spot in 12 ms :[true]
Running random walk in product with property : NQueens-PT-10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLCardinality-11 finished in 70 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&p1))&&G(G(X(p0)))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 100/100 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 61 transition count 100
Applied a total of 23 rules in 4 ms. Remains 61 /84 variables (removed 23) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 61 cols
[2022-05-18 18:23:54] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-18 18:23:54] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 100 rows 61 cols
[2022-05-18 18:23:54] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-18 18:23:54] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [41, 42, 60]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 237 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/84 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 58/84 places, 100/100 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NQueens-PT-10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s2 s1), p0:(LEQ s0 s3)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 43 steps with 4 reset in 1 ms.
FORMULA NQueens-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLCardinality-13 finished in 395 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(G(p0))&&p1))&&X(G(p2))))'
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 100/100 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 59 transition count 100
Applied a total of 25 rules in 4 ms. Remains 59 /84 variables (removed 25) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 59 cols
[2022-05-18 18:23:54] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-18 18:23:54] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 100 rows 59 cols
[2022-05-18 18:23:54] [INFO ] Computed 6 place invariants in 7 ms
[2022-05-18 18:23:55] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [39, 40]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 217 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/84 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 57/84 places, 100/100 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0), true]
Running random walk in product with property : NQueens-PT-10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT s56 s51), p2:(LEQ s11 s0), p0:(LEQ s1 s39)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLCardinality-14 finished in 414 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(p0)&&p1))))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 100/100 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 60 transition count 100
Applied a total of 24 rules in 2 ms. Remains 60 /84 variables (removed 24) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 60 cols
[2022-05-18 18:23:55] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-18 18:23:55] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 100 rows 60 cols
[2022-05-18 18:23:55] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-18 18:23:55] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [40, 41, 59]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 205 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/84 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 57/84 places, 100/100 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NQueens-PT-10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s0 s1), p0:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLCardinality-15 finished in 354 ms.
All properties solved by simple procedures.
Total runtime 16672 ms.

BK_STOP 1652898235674

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-10"
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-10, 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 r132-tall-165271821500907"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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