Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.0K Feb 26 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 17:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 17:05 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 24K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 65K 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-08-LTLCardinality-00
FORMULA_NAME NQueens-PT-08-LTLCardinality-01
FORMULA_NAME NQueens-PT-08-LTLCardinality-02
FORMULA_NAME NQueens-PT-08-LTLCardinality-03
FORMULA_NAME NQueens-PT-08-LTLCardinality-04
FORMULA_NAME NQueens-PT-08-LTLCardinality-05
FORMULA_NAME NQueens-PT-08-LTLCardinality-06
FORMULA_NAME NQueens-PT-08-LTLCardinality-07
FORMULA_NAME NQueens-PT-08-LTLCardinality-08
FORMULA_NAME NQueens-PT-08-LTLCardinality-09
FORMULA_NAME NQueens-PT-08-LTLCardinality-10
FORMULA_NAME NQueens-PT-08-LTLCardinality-11
FORMULA_NAME NQueens-PT-08-LTLCardinality-12
FORMULA_NAME NQueens-PT-08-LTLCardinality-13
FORMULA_NAME NQueens-PT-08-LTLCardinality-14
FORMULA_NAME NQueens-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678723827306

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NQueens-PT-08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 16:10:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 16:10:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 16:10:30] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-13 16:10:30] [INFO ] Transformed 112 places.
[2023-03-13 16:10:30] [INFO ] Transformed 64 transitions.
[2023-03-13 16:10:30] [INFO ] Parsed PT model containing 112 places and 64 transitions and 320 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 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-08-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 64/64 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 70 transition count 64
Applied a total of 40 rules in 18 ms. Remains 70 /110 variables (removed 40) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 70 cols
[2023-03-13 16:10:30] [INFO ] Computed 10 place invariants in 14 ms
[2023-03-13 16:10:30] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-13 16:10:30] [INFO ] Invariant cache hit.
[2023-03-13 16:10:31] [INFO ] Implicit Places using invariants and state equation in 176 ms returned [40, 54, 69]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 492 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/110 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 512 ms. Remains : 67/110 places, 64/64 transitions.
Support contains 41 out of 67 places after structural reductions.
[2023-03-13 16:10:31] [INFO ] Flatten gal took : 46 ms
[2023-03-13 16:10:31] [INFO ] Flatten gal took : 18 ms
[2023-03-13 16:10:31] [INFO ] Input system was already deterministic with 64 transitions.
Support contains 37 out of 67 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 1314 resets, run finished after 774 ms. (steps per millisecond=12 ) properties (out of 31) seen :16
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 64 rows 67 cols
[2023-03-13 16:10:32] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-13 16:10:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 16:10:32] [INFO ] [Real]Absence check using 1 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-13 16:10:32] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-13 16:10:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 16:10:32] [INFO ] [Nat]Absence check using 1 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-13 16:10:39] [INFO ] After 6541ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :0
Fused 15 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 15 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA NQueens-PT-08-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 67 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 64
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' '!(F(p0))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 64/64 transitions.
Graph (complete) has 94 edges and 67 vertex of which 45 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 45 /67 variables (removed 22) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 45 cols
[2023-03-13 16:10:39] [INFO ] Computed 4 place invariants in 18 ms
[2023-03-13 16:10:39] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-13 16:10:39] [INFO ] Invariant cache hit.
[2023-03-13 16:10:39] [INFO ] Implicit Places using invariants and state equation in 239 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 378 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/67 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 397 ms. Remains : 44/67 places, 64/64 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-08-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLCardinality-01 finished in 677 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))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 64/64 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 45 transition count 64
Applied a total of 22 rules in 2 ms. Remains 45 /67 variables (removed 22) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 45 cols
[2023-03-13 16:10:39] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-13 16:10:40] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-13 16:10:40] [INFO ] Invariant cache hit.
[2023-03-13 16:10:40] [INFO ] Implicit Places using invariants and state equation in 165 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 285 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/67 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 288 ms. Remains : 44/67 places, 64/64 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-08-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLCardinality-03 finished in 441 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(X(F((p0||X(p1)))))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 64/64 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 45 transition count 64
Applied a total of 22 rules in 3 ms. Remains 45 /67 variables (removed 22) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 45 cols
[2023-03-13 16:10:40] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-13 16:10:40] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-13 16:10:40] [INFO ] Invariant cache hit.
[2023-03-13 16:10:40] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 225 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/67 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 230 ms. Remains : 44/67 places, 64/64 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-08-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (GT 1 s0) (GT 2 s1)), p1:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 94 steps with 22 reset in 4 ms.
FORMULA NQueens-PT-08-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLCardinality-06 finished in 461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((F(p1)||G(!p2))))))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 64/64 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 46 transition count 64
Applied a total of 21 rules in 3 ms. Remains 46 /67 variables (removed 21) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 46 cols
[2023-03-13 16:10:40] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-13 16:10:40] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-13 16:10:40] [INFO ] Invariant cache hit.
[2023-03-13 16:10:41] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 235 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/67 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 241 ms. Remains : 45/67 places, 64/64 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : NQueens-PT-08-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s2), p1:(GT s0 s1), p2:(AND (OR (LEQ s0 s1) (LEQ 1 s2)) (LEQ 1 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 144 steps with 18 reset in 6 ms.
FORMULA NQueens-PT-08-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLCardinality-07 finished in 565 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||(p1&&X(G(p2)))))))'
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 64/64 transitions.
Graph (complete) has 94 edges and 67 vertex of which 45 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 45 /67 variables (removed 22) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 45 cols
[2023-03-13 16:10:41] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-13 16:10:41] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-13 16:10:41] [INFO ] Invariant cache hit.
[2023-03-13 16:10:41] [INFO ] Implicit Places using invariants and state equation in 147 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 290 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/67 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 298 ms. Remains : 44/67 places, 64/64 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NQueens-PT-08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s22 s28), p0:(LEQ s0 s38), p2:(LEQ s1 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3303 steps with 432 reset in 37 ms.
FORMULA NQueens-PT-08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLCardinality-13 finished in 496 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))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 64/64 transitions.
Graph (complete) has 94 edges and 67 vertex of which 43 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 43 /67 variables (removed 24) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2023-03-13 16:10:41] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-13 16:10:42] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-13 16:10:42] [INFO ] Invariant cache hit.
[2023-03-13 16:10:42] [INFO ] Implicit Places using invariants and state equation in 156 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 253 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/67 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 259 ms. Remains : 42/67 places, 64/64 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLCardinality-14 automaton TGBA Formula[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 1 s24)], 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 7 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLCardinality-14 finished in 326 ms.
All properties solved by simple procedures.
Total runtime 12055 ms.
ITS solved all properties within timeout

BK_STOP 1678723843413

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is NQueens-PT-08, 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 r265-smll-167863539500019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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