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-167863539500051.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-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539500051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 824K
-rw-r--r-- 1 mcc users 6.9K Feb 26 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 17:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 349K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NQueens-PT-20-LTLCardinality-00
FORMULA_NAME NQueens-PT-20-LTLCardinality-01
FORMULA_NAME NQueens-PT-20-LTLCardinality-02
FORMULA_NAME NQueens-PT-20-LTLCardinality-03
FORMULA_NAME NQueens-PT-20-LTLCardinality-04
FORMULA_NAME NQueens-PT-20-LTLCardinality-05
FORMULA_NAME NQueens-PT-20-LTLCardinality-06
FORMULA_NAME NQueens-PT-20-LTLCardinality-07
FORMULA_NAME NQueens-PT-20-LTLCardinality-08
FORMULA_NAME NQueens-PT-20-LTLCardinality-09
FORMULA_NAME NQueens-PT-20-LTLCardinality-10
FORMULA_NAME NQueens-PT-20-LTLCardinality-11
FORMULA_NAME NQueens-PT-20-LTLCardinality-12
FORMULA_NAME NQueens-PT-20-LTLCardinality-13
FORMULA_NAME NQueens-PT-20-LTLCardinality-14
FORMULA_NAME NQueens-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678742185298

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-20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 21:16:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 21:16:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:16:28] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-13 21:16:28] [INFO ] Transformed 520 places.
[2023-03-13 21:16:28] [INFO ] Transformed 400 transitions.
[2023-03-13 21:16:28] [INFO ] Parsed PT model containing 520 places and 400 transitions and 2000 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-20-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 400/400 transitions.
Reduce places removed 366 places and 0 transitions.
Iterating post reduction 0 with 366 rules applied. Total rules applied 366 place count 152 transition count 400
Applied a total of 366 rules in 35 ms. Remains 152 /518 variables (removed 366) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 152 cols
[2023-03-13 21:16:28] [INFO ] Invariants computation overflowed in 86 ms
[2023-03-13 21:16:29] [INFO ] Implicit Places using invariants in 375 ms returned []
// Phase 1: matrix 400 rows 152 cols
[2023-03-13 21:16:29] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-13 21:16:29] [INFO ] Implicit Places using invariants and state equation in 892 ms returned [112, 113]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1308 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/518 places, 400/400 transitions.
Applied a total of 0 rules in 11 ms. Remains 150 /150 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1354 ms. Remains : 150/518 places, 400/400 transitions.
Support contains 41 out of 150 places after structural reductions.
[2023-03-13 21:16:30] [INFO ] Flatten gal took : 107 ms
[2023-03-13 21:16:30] [INFO ] Flatten gal took : 54 ms
[2023-03-13 21:16:30] [INFO ] Input system was already deterministic with 400 transitions.
Incomplete random walk after 10000 steps, including 541 resets, run finished after 948 ms. (steps per millisecond=10 ) properties (out of 25) seen :16
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 400 rows 150 cols
[2023-03-13 21:16:31] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-13 21:16:32] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 21:16:32] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA NQueens-PT-20-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA NQueens-PT-20-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 150 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 150 transition count 400
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA NQueens-PT-20-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((p0||X(p1)||G(p2))))'
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 400/400 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 120 transition count 400
Applied a total of 30 rules in 10 ms. Remains 120 /150 variables (removed 30) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 120 cols
[2023-03-13 21:16:32] [INFO ] Invariants computation overflowed in 23 ms
[2023-03-13 21:16:32] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 400 rows 120 cols
[2023-03-13 21:16:32] [INFO ] Invariants computation overflowed in 24 ms
[2023-03-13 21:16:33] [INFO ] Implicit Places using invariants and state equation in 807 ms returned [44, 119]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1101 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/150 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1116 ms. Remains : 118/150 places, 400/400 transitions.
Stuttering acceptance computed with spot in 383 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : NQueens-PT-20-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(LEQ s0 s3), p0:(LEQ 1 s57), p2:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 49072 reset in 4964 ms.
Product exploration explored 100000 steps with 49038 reset in 4851 ms.
Computed a total of 118 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 400
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 458 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Finished random walk after 3645 steps, including 198 resets, run visited all 4 properties in 104 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (AND p2 (NOT p1))), (F (NOT p0)), (F (AND (NOT p2) (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 586 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 5 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 118 cols
[2023-03-13 21:16:46] [INFO ] Invariants computation overflowed in 24 ms
[2023-03-13 21:16:46] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 400 rows 118 cols
[2023-03-13 21:16:46] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-13 21:16:47] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 118 cols
[2023-03-13 21:16:47] [INFO ] Invariants computation overflowed in 23 ms
[2023-03-13 21:16:47] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1330 ms. Remains : 118/118 places, 400/400 transitions.
Computed a total of 118 stabilizing places and 400 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 400
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 344 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 542 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 4) seen :3
Finished Best-First random walk after 738 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=246 )
Knowledge obtained : [(AND p0 p2 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 428 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Entered a terminal (fully accepting) state of product in 98517 steps with 48323 reset in 4556 ms.
FORMULA NQueens-PT-20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLCardinality-01 finished in 21847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 400/400 transitions.
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 119 transition count 400
Applied a total of 31 rules in 4 ms. Remains 119 /150 variables (removed 31) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 119 cols
[2023-03-13 21:16:54] [INFO ] Invariants computation overflowed in 26 ms
[2023-03-13 21:16:54] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 400 rows 119 cols
[2023-03-13 21:16:54] [INFO ] Invariants computation overflowed in 24 ms
[2023-03-13 21:16:55] [INFO ] Implicit Places using invariants and state equation in 723 ms returned [43, 118]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 981 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/150 places, 400/400 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 988 ms. Remains : 117/150 places, 400/400 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NQueens-PT-20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LEQ s0 s1) (LEQ s54 s2)), p1:(LEQ s0 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 1 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLCardinality-02 finished in 1158 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 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 400/400 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 118 transition count 400
Applied a total of 32 rules in 3 ms. Remains 118 /150 variables (removed 32) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 118 cols
[2023-03-13 21:16:55] [INFO ] Invariants computation overflowed in 19 ms
[2023-03-13 21:16:55] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 400 rows 118 cols
[2023-03-13 21:16:55] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-13 21:16:56] [INFO ] Implicit Places using invariants and state equation in 741 ms returned [42, 117]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 995 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/150 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1001 ms. Remains : 116/150 places, 400/400 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-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:(LEQ 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 134 steps with 7 reset in 4 ms.
FORMULA NQueens-PT-20-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLCardinality-03 finished in 1140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 400/400 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 117 transition count 400
Applied a total of 33 rules in 3 ms. Remains 117 /150 variables (removed 33) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:16:56] [INFO ] Invariants computation overflowed in 20 ms
[2023-03-13 21:16:56] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2023-03-13 21:16:56] [INFO ] Invariants computation overflowed in 20 ms
[2023-03-13 21:16:57] [INFO ] Implicit Places using invariants and state equation in 720 ms returned [41, 116]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 953 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 115/150 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 115 /115 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 959 ms. Remains : 115/150 places, 400/400 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-LTLCardinality-06 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 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][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLCardinality-06 finished in 1087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 400/400 transitions.
Graph (complete) has 136 edges and 150 vertex of which 119 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 12 ms. Remains 119 /150 variables (removed 31) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 119 cols
[2023-03-13 21:16:57] [INFO ] Invariants computation overflowed in 24 ms
[2023-03-13 21:16:58] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 400 rows 119 cols
[2023-03-13 21:16:58] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-13 21:16:58] [INFO ] Implicit Places using invariants and state equation in 834 ms returned [118]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1041 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/150 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 118 /118 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1062 ms. Remains : 118/150 places, 400/400 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s2 s0) (GT s1 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-20-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLCardinality-12 finished in 1117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 400/400 transitions.
Graph (complete) has 136 edges and 150 vertex of which 115 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 115 /150 variables (removed 35) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 115 cols
[2023-03-13 21:16:58] [INFO ] Invariants computation overflowed in 22 ms
[2023-03-13 21:16:59] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 400 rows 115 cols
[2023-03-13 21:16:59] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-13 21:16:59] [INFO ] Implicit Places using invariants and state equation in 763 ms returned [114]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1030 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/150 places, 400/400 transitions.
Applied a total of 0 rules in 10 ms. Remains 114 /114 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1047 ms. Remains : 114/150 places, 400/400 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} 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]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLCardinality-13 finished in 1100 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))||G(p1)))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 400/400 transitions.
Graph (complete) has 136 edges and 150 vertex of which 119 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 119 /150 variables (removed 31) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 119 cols
[2023-03-13 21:17:00] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-13 21:17:00] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 400 rows 119 cols
[2023-03-13 21:17:00] [INFO ] Invariants computation overflowed in 25 ms
[2023-03-13 21:17:01] [INFO ] Implicit Places using invariants and state equation in 820 ms returned [43, 118]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1091 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/150 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 117 /117 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1107 ms. Remains : 117/150 places, 400/400 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s97 s1), p0:(LEQ s0 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 646 steps with 34 reset in 19 ms.
FORMULA NQueens-PT-20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-LTLCardinality-15 finished in 1268 ms.
All properties solved by simple procedures.
Total runtime 33118 ms.
ITS solved all properties within timeout

BK_STOP 1678742222738

--------------------
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-20"
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-20, 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-167863539500051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-20.tgz
mv NQueens-PT-20 execution
cd execution
if [ "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 ;