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.r417-tall-171690556500442.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 Sudoku-PT-BN04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556500442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 31K Apr 12 11:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 12 11:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 12 11:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 245K Apr 12 11:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 24K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 92K Apr 12 11:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 505K Apr 12 11:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109K Apr 12 11:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 496K Apr 12 11:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 53K 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 Sudoku-PT-BN04-LTLCardinality-00
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-01
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-02
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-03
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-04
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-05
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-06
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-07
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-08
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-09
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-10
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-11
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-12
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-13
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-14
FORMULA_NAME Sudoku-PT-BN04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717159910652

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=Sudoku-PT-BN04
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 12:51:52] [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-31 12:51:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 12:51:52] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2024-05-31 12:51:52] [INFO ] Transformed 128 places.
[2024-05-31 12:51:52] [INFO ] Transformed 64 transitions.
[2024-05-31 12:51:52] [INFO ] Found NUPN structural information;
[2024-05-31 12:51:52] [INFO ] Parsed PT model containing 128 places and 64 transitions and 320 arcs in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-BN04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 128 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 128 cols
[2024-05-31 12:51:52] [INFO ] Computed 64 invariants in 6 ms
[2024-05-31 12:51:52] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-31 12:51:52] [INFO ] Invariant cache hit.
[2024-05-31 12:51:52] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-31 12:51:52] [INFO ] Invariant cache hit.
[2024-05-31 12:51:53] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 412 ms. Remains : 128/128 places, 64/64 transitions.
Support contains 128 out of 128 places after structural reductions.
[2024-05-31 12:51:53] [INFO ] Flatten gal took : 33 ms
[2024-05-31 12:51:53] [INFO ] Flatten gal took : 12 ms
[2024-05-31 12:51:53] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 712 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 20) seen :15
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-31 12:51:53] [INFO ] Invariant cache hit.
[2024-05-31 12:51:54] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 12:51:54] [INFO ] [Nat]Absence check using 64 positive place invariants in 15 ms returned sat
[2024-05-31 12:51:54] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-BN04-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-BN04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 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).
FORMULA Sudoku-PT-BN04-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(X((p1 U p2)))))'
Support contains 112 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 12:51:54] [INFO ] Invariant cache hit.
[2024-05-31 12:51:54] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 12:51:54] [INFO ] Invariant cache hit.
[2024-05-31 12:51:54] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-31 12:51:54] [INFO ] Invariant cache hit.
[2024-05-31 12:51:54] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 128/128 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 383 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p2:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15)), p1:(LEQ (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95) (ADD...], 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 890 ms.
Product exploration explored 100000 steps with 33333 reset in 843 ms.
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 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 p2 (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 16 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN04-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN04-LTLCardinality-00 finished in 2599 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' '!(F(p0))'
Support contains 64 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 14 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 12:51:56] [INFO ] Invariant cache hit.
[2024-05-31 12:51:57] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-31 12:51:57] [INFO ] Invariant cache hit.
[2024-05-31 12:51:57] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-31 12:51:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 12:51:57] [INFO ] Invariant cache hit.
[2024-05-31 12:51:57] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 329 ms. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50...], 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]]
Product exploration explored 100000 steps with 33333 reset in 860 ms.
Product exploration explored 100000 steps with 33333 reset in 891 ms.
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 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 : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN04-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN04-LTLCardinality-03 finished in 2308 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||G(p1)))))'
Support contains 96 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 10 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 12:51:59] [INFO ] Invariant cache hit.
[2024-05-31 12:51:59] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 12:51:59] [INFO ] Invariant cache hit.
[2024-05-31 12:51:59] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-31 12:51:59] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 12:51:59] [INFO ] Invariant cache hit.
[2024-05-31 12:51:59] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-06 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=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15)), p0:(LEQ (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 125 steps with 8 reset in 3 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-06 finished in 360 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' '!(F((p0&&F(p1))))'
Support contains 80 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 12:51:59] [INFO ] Invariant cache hit.
[2024-05-31 12:51:59] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-31 12:51:59] [INFO ] Invariant cache hit.
[2024-05-31 12:51:59] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-31 12:51:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 12:51:59] [INFO ] Invariant cache hit.
[2024-05-31 12:51:59] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 287 ms. Remains : 128/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ 2 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50...], 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, null][true, true]]
Product exploration explored 100000 steps with 33333 reset in 867 ms.
Product exploration explored 100000 steps with 33333 reset in 899 ms.
Computed a total of 128 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 128 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 (NOT p1) p0), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN04-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN04-LTLCardinality-07 finished in 2230 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' '!(F(G(p0)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 65 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.2 ms
Discarding 63 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 65 /128 variables (removed 63) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 65 cols
[2024-05-31 12:52:01] [INFO ] Computed 24 invariants in 4 ms
[2024-05-31 12:52:01] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 12:52:01] [INFO ] Invariant cache hit.
[2024-05-31 12:52:02] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-31 12:52:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 12:52:02] [INFO ] Invariant cache hit.
[2024-05-31 12:52:02] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/128 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 65/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s25 0) (EQ s16 1))], 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 65 steps with 4 reset in 2 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-08 finished in 299 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' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 61 are kept as prefixes of interest. Removing 67 places using SCC suffix rule.0 ms
Discarding 67 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 61 /128 variables (removed 67) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 61 cols
[2024-05-31 12:52:02] [INFO ] Computed 19 invariants in 7 ms
[2024-05-31 12:52:02] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 12:52:02] [INFO ] Invariant cache hit.
[2024-05-31 12:52:02] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-31 12:52:02] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 12:52:02] [INFO ] Invariant cache hit.
[2024-05-31 12:52:02] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/128 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 61/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s55 0) (EQ s16 1)), p1:(EQ s17 1)], nbAcceptance=2, 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 14 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-09 finished in 286 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' '!(F(p0))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Graph (complete) has 256 edges and 128 vertex of which 61 are kept as prefixes of interest. Removing 67 places using SCC suffix rule.1 ms
Discarding 67 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 61 /128 variables (removed 67) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 61 cols
[2024-05-31 12:52:02] [INFO ] Computed 20 invariants in 5 ms
[2024-05-31 12:52:02] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 12:52:02] [INFO ] Invariant cache hit.
[2024-05-31 12:52:02] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-31 12:52:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 12:52:02] [INFO ] Invariant cache hit.
[2024-05-31 12:52:02] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/128 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 61/128 places, 64/64 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s14 1))], 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 30 steps with 2 reset in 1 ms.
FORMULA Sudoku-PT-BN04-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLCardinality-12 finished in 283 ms.
All properties solved by simple procedures.
Total runtime 10382 ms.

BK_STOP 1717159924163

--------------------
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="Sudoku-PT-BN04"
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 Sudoku-PT-BN04, 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 r417-tall-171690556500442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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