fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r263-tall-171654372300217
Last Updated
July 7, 2024

About the Execution of 2023-gold for NQueens-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
315.871 14077.00 19573.00 396.50 FFFFFFFTFFFFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372300217.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r263-tall-171654372300217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 12 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 12 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 65K May 18 16:43 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 1716682106819

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NQueens-PT-08
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-26 00:08:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 00:08:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:08:28] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2024-05-26 00:08:28] [INFO ] Transformed 112 places.
[2024-05-26 00:08:28] [INFO ] Transformed 64 transitions.
[2024-05-26 00:08:28] [INFO ] Found NUPN structural information;
[2024-05-26 00:08:28] [INFO ] Parsed PT model containing 112 places and 64 transitions and 320 arcs in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 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-08-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 64/64 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 61 transition count 64
Applied a total of 49 rules in 13 ms. Remains 61 /110 variables (removed 49) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 61 cols
[2024-05-26 00:08:28] [INFO ] Computed 10 invariants in 23 ms
[2024-05-26 00:08:29] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-26 00:08:29] [INFO ] Invariant cache hit.
[2024-05-26 00:08:29] [INFO ] Implicit Places using invariants and state equation in 454 ms returned [31, 45, 46, 60]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 983 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/110 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1001 ms. Remains : 57/110 places, 64/64 transitions.
Support contains 21 out of 57 places after structural reductions.
[2024-05-26 00:08:29] [INFO ] Flatten gal took : 26 ms
[2024-05-26 00:08:29] [INFO ] Flatten gal took : 12 ms
[2024-05-26 00:08:29] [INFO ] Input system was already deterministic with 64 transitions.
Finished random walk after 252 steps, including 32 resets, run visited all 15 properties in 32 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 57 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 57 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0||F(!p1)))) U (G(p1) U p2))))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 44 transition count 64
Applied a total of 13 rules in 2 ms. Remains 44 /57 variables (removed 13) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 44 cols
[2024-05-26 00:08:30] [INFO ] Computed 4 invariants in 3 ms
[2024-05-26 00:08:30] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-26 00:08:30] [INFO ] Invariant cache hit.
[2024-05-26 00:08:30] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-26 00:08:30] [INFO ] Invariant cache hit.
[2024-05-26 00:08:30] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/57 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 563 ms. Remains : 44/57 places, 64/64 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 283 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p0)), false, (AND p1 (NOT p0))]
Running random walk in product with property : NQueens-PT-08-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s18 1), p1:(OR (EQ s0 0) (EQ s17 1)), p0:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2226 steps with 1026 reset in 32 ms.
FORMULA NQueens-PT-08-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLCardinality-01 finished in 947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 58 edges and 57 vertex of which 43 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 43 /57 variables (removed 14) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2024-05-26 00:08:31] [INFO ] Computed 2 invariants in 6 ms
[2024-05-26 00:08:31] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-26 00:08:31] [INFO ] Invariant cache hit.
[2024-05-26 00:08:31] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-05-26 00:08:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-26 00:08:31] [INFO ] Invariant cache hit.
[2024-05-26 00:08:31] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/57 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 548 ms. Remains : 43/57 places, 64/64 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 126 steps with 15 reset in 3 ms.
FORMULA NQueens-PT-08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLCardinality-02 finished in 635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(X(p1)))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 44 transition count 64
Applied a total of 13 rules in 1 ms. Remains 44 /57 variables (removed 13) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 44 cols
[2024-05-26 00:08:31] [INFO ] Computed 3 invariants in 2 ms
[2024-05-26 00:08:31] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-26 00:08:31] [INFO ] Invariant cache hit.
[2024-05-26 00:08:32] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-05-26 00:08:32] [INFO ] Invariant cache hit.
[2024-05-26 00:08:32] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/57 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 44/57 places, 64/64 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : NQueens-PT-08-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s1 1), p1:(OR (EQ s0 0) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 72 steps with 17 reset in 3 ms.
FORMULA NQueens-PT-08-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLCardinality-04 finished in 784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 58 edges and 57 vertex of which 43 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 43 /57 variables (removed 14) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2024-05-26 00:08:32] [INFO ] Computed 3 invariants in 5 ms
[2024-05-26 00:08:32] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-26 00:08:32] [INFO ] Invariant cache hit.
[2024-05-26 00:08:33] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2024-05-26 00:08:33] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-26 00:08:33] [INFO ] Invariant cache hit.
[2024-05-26 00:08:33] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/57 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1110 ms. Remains : 43/57 places, 64/64 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 403 steps with 52 reset in 5 ms.
FORMULA NQueens-PT-08-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLCardinality-05 finished in 1188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 58 edges and 57 vertex of which 43 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 43 /57 variables (removed 14) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2024-05-26 00:08:33] [INFO ] Computed 3 invariants in 2 ms
[2024-05-26 00:08:33] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-26 00:08:33] [INFO ] Invariant cache hit.
[2024-05-26 00:08:34] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2024-05-26 00:08:34] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-26 00:08:34] [INFO ] Invariant cache hit.
[2024-05-26 00:08:34] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/57 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 716 ms. Remains : 43/57 places, 64/64 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s2 1), p0:(OR (EQ s41 0) (EQ s0 1))], 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, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-08-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLCardinality-08 finished in 846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Graph (complete) has 58 edges and 57 vertex of which 44 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 44 /57 variables (removed 13) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 44 cols
[2024-05-26 00:08:34] [INFO ] Computed 3 invariants in 1 ms
[2024-05-26 00:08:34] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-26 00:08:34] [INFO ] Invariant cache hit.
[2024-05-26 00:08:35] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2024-05-26 00:08:35] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-26 00:08:35] [INFO ] Invariant cache hit.
[2024-05-26 00:08:35] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/57 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 734 ms. Remains : 44/57 places, 64/64 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s0 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLCardinality-10 finished in 811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 43 transition count 64
Applied a total of 14 rules in 1 ms. Remains 43 /57 variables (removed 14) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2024-05-26 00:08:35] [INFO ] Computed 4 invariants in 6 ms
[2024-05-26 00:08:35] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-26 00:08:35] [INFO ] Invariant cache hit.
[2024-05-26 00:08:35] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-05-26 00:08:35] [INFO ] Invariant cache hit.
[2024-05-26 00:08:35] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/57 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 531 ms. Remains : 43/57 places, 64/64 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 62 steps with 8 reset in 2 ms.
FORMULA NQueens-PT-08-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLCardinality-11 finished in 674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||X(p2)))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 45 transition count 64
Applied a total of 12 rules in 2 ms. Remains 45 /57 variables (removed 12) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 45 cols
[2024-05-26 00:08:35] [INFO ] Computed 3 invariants in 2 ms
[2024-05-26 00:08:36] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-26 00:08:36] [INFO ] Invariant cache hit.
[2024-05-26 00:08:36] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2024-05-26 00:08:36] [INFO ] Invariant cache hit.
[2024-05-26 00:08:36] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 45/57 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 887 ms. Remains : 45/57 places, 64/64 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : NQueens-PT-08-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}]], initial=1, aps=[p0:(OR (EQ s2 0) (EQ s1 1)), p1:(OR (EQ s2 0) (EQ s0 1)), p2:(AND (EQ s0 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 731 ms.
Product exploration explored 100000 steps with 50000 reset in 759 ms.
Computed a total of 45 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 45 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).
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 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 16 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-08-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-08-LTLCardinality-12 finished in 2671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 64/64 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 43 transition count 64
Applied a total of 14 rules in 3 ms. Remains 43 /57 variables (removed 14) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 43 cols
[2024-05-26 00:08:38] [INFO ] Computed 3 invariants in 4 ms
[2024-05-26 00:08:38] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-26 00:08:38] [INFO ] Invariant cache hit.
[2024-05-26 00:08:39] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2024-05-26 00:08:39] [INFO ] Invariant cache hit.
[2024-05-26 00:08:39] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/57 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 809 ms. Remains : 43/57 places, 64/64 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 56 steps with 13 reset in 2 ms.
FORMULA NQueens-PT-08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-08-LTLCardinality-13 finished in 892 ms.
All properties solved by simple procedures.
Total runtime 11149 ms.

BK_STOP 1716682120896

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r263-tall-171654372300217"
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 ;