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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 46K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 251K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 94K Apr 12 11:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 473K Apr 12 11:31 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 38K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 59K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 224K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 12 11:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 288K Apr 12 11:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 193K Apr 12 11:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 931K Apr 12 11:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.9K Apr 23 08:00 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 80K 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-AN05-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN05-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN05-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN05-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN05-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN05-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN05-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN05-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN05-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN05-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN05-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN05-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN05-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN05-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN05-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717145188854

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-AN05
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 08:46:30] [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 08:46:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 08:46:30] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2024-05-31 08:46:30] [INFO ] Transformed 200 places.
[2024-05-31 08:46:30] [INFO ] Transformed 125 transitions.
[2024-05-31 08:46:30] [INFO ] Found NUPN structural information;
[2024-05-31 08:46:30] [INFO ] Parsed PT model containing 200 places and 125 transitions and 500 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN05-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN05-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN05-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN05-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 200 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2024-05-31 08:46:30] [INFO ] Computed 75 invariants in 16 ms
[2024-05-31 08:46:30] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-31 08:46:30] [INFO ] Invariant cache hit.
[2024-05-31 08:46:31] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-05-31 08:46:31] [INFO ] Invariant cache hit.
[2024-05-31 08:46:31] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 728 ms. Remains : 200/200 places, 125/125 transitions.
Support contains 200 out of 200 places after structural reductions.
[2024-05-31 08:46:31] [INFO ] Flatten gal took : 41 ms
[2024-05-31 08:46:31] [INFO ] Flatten gal took : 16 ms
[2024-05-31 08:46:31] [INFO ] Input system was already deterministic with 125 transitions.
Incomplete random walk after 10000 steps, including 454 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 08:46:32] [INFO ] Invariant cache hit.
[2024-05-31 08:46:32] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 08:46:32] [INFO ] [Nat]Absence check using 75 positive place invariants in 12 ms returned sat
[2024-05-31 08:46:32] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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((p0&&G(F(p1))))))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:46:32] [INFO ] Invariant cache hit.
[2024-05-31 08:46:32] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-31 08:46:32] [INFO ] Invariant cache hit.
[2024-05-31 08:46:32] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-05-31 08:46:32] [INFO ] Invariant cache hit.
[2024-05-31 08:46:32] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 386 ms. Remains : 200/200 places, 125/125 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 325 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN05-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24) (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 5 ms.
FORMULA Sudoku-PT-AN05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLCardinality-02 finished in 890 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 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 14 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:46:33] [INFO ] Invariant cache hit.
[2024-05-31 08:46:33] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-31 08:46:33] [INFO ] Invariant cache hit.
[2024-05-31 08:46:33] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-31 08:46:33] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 08:46:33] [INFO ] Invariant cache hit.
[2024-05-31 08:46:33] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 377 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN05-LTLCardinality-03 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 (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174) (ADD s25 s26 s27...], 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 19 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLCardinality-03 finished in 440 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(X(G((p0||G(p1))))))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:46:33] [INFO ] Invariant cache hit.
[2024-05-31 08:46:33] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 08:46:33] [INFO ] Invariant cache hit.
[2024-05-31 08:46:33] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-31 08:46:33] [INFO ] Invariant cache hit.
[2024-05-31 08:46:34] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN05-LTLCardinality-05 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=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GT (ADD s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199) (ADD s25 s26 s27...], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLCardinality-05 finished in 518 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(X(F((p0&&(p1||X(F(p0))))))))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:46:34] [INFO ] Invariant cache hit.
[2024-05-31 08:46:34] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-31 08:46:34] [INFO ] Invariant cache hit.
[2024-05-31 08:46:34] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-05-31 08:46:34] [INFO ] Invariant cache hit.
[2024-05-31 08:46:34] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 364 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 1 (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174)), p1:(LEQ 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1383 ms.
Product exploration explored 100000 steps with 33333 reset in 1347 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN05-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN05-LTLCardinality-06 finished in 3635 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 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 13 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:46:37] [INFO ] Invariant cache hit.
[2024-05-31 08:46:38] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-31 08:46:38] [INFO ] Invariant cache hit.
[2024-05-31 08:46:38] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-31 08:46:38] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 08:46:38] [INFO ] Invariant cache hit.
[2024-05-31 08:46:38] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 424 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN05-LTLCardinality-07 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 2 (ADD 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 s51 s52 s53 s54 s55 s56 s57 s58 s59 ...], 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 23 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN05-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLCardinality-07 finished in 487 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))||G(p1)))'
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 76 transition count 125
Applied a total of 124 rules in 9 ms. Remains 76 /200 variables (removed 124) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 76 cols
[2024-05-31 08:46:38] [INFO ] Computed 14 invariants in 11 ms
[2024-05-31 08:46:38] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-31 08:46:38] [INFO ] Invariant cache hit.
[2024-05-31 08:46:38] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-31 08:46:38] [INFO ] Invariant cache hit.
[2024-05-31 08:46:38] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 76/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN05-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s25 0) (EQ s15 1)), p1:(AND (EQ s21 0) (EQ s29 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 848 ms.
Product exploration explored 100000 steps with 50000 reset in 896 ms.
Computed a total of 76 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 76 transition count 125
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 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 15 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN05-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN05-LTLCardinality-08 finished in 2300 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((p0 U X(G(p1)))))'
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 11 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2024-05-31 08:46:40] [INFO ] Computed 14 invariants in 3 ms
[2024-05-31 08:46:40] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 08:46:40] [INFO ] Invariant cache hit.
[2024-05-31 08:46:40] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-31 08:46:40] [INFO ] Invariant cache hit.
[2024-05-31 08:46:40] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-AN05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s3 1), p0:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLCardinality-11 finished in 404 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 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Graph (complete) has 375 edges and 200 vertex of which 76 are kept as prefixes of interest. Removing 124 places using SCC suffix rule.3 ms
Discarding 124 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 76 /200 variables (removed 124) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 76 cols
[2024-05-31 08:46:41] [INFO ] Computed 14 invariants in 4 ms
[2024-05-31 08:46:41] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 08:46:41] [INFO ] Invariant cache hit.
[2024-05-31 08:46:41] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-31 08:46:41] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 08:46:41] [INFO ] Invariant cache hit.
[2024-05-31 08:46:41] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/200 places, 125/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 327 ms. Remains : 76/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN05-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:(OR (EQ s25 0) (EQ s13 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 44 steps with 1 reset in 1 ms.
FORMULA Sudoku-PT-AN05-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLCardinality-12 finished in 377 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 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 76 transition count 125
Applied a total of 124 rules in 2 ms. Remains 76 /200 variables (removed 124) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 76 cols
[2024-05-31 08:46:41] [INFO ] Computed 14 invariants in 5 ms
[2024-05-31 08:46:41] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-31 08:46:41] [INFO ] Invariant cache hit.
[2024-05-31 08:46:41] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-31 08:46:41] [INFO ] Invariant cache hit.
[2024-05-31 08:46:41] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 76/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN05-LTLCardinality-14 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:(AND (EQ s50 0) (EQ s25 1))], 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 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLCardinality-14 finished in 395 ms.
All properties solved by simple procedures.
Total runtime 11618 ms.

BK_STOP 1717145203321

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

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