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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.0K Apr 12 10:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 10:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 10:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 10:03 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 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 10:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 10:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN02-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717132275787

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN02
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-31 05:11:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 05:11:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 05:11:17] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 05:11:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 05:11:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 378 ms
[2024-05-31 05:11:17] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 20 PT places and 8.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 05:11:18] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2024-05-31 05:11:18] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 6 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN02-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2024-05-31 05:11:18] [INFO ] Flatten gal took : 18 ms
[2024-05-31 05:11:18] [INFO ] Flatten gal took : 0 ms
Domain [N(2), N(2)] of place Rows breaks symmetries in sort N
[2024-05-31 05:11:18] [INFO ] Unfolded HLPN to a Petri net with 20 places and 8 transitions 32 arcs in 5 ms.
[2024-05-31 05:11:18] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN02-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 5 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-05-31 05:11:18] [INFO ] Computed 5 invariants in 5 ms
[2024-05-31 05:11:18] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-31 05:11:18] [INFO ] Invariant cache hit.
[2024-05-31 05:11:18] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-31 05:11:18] [INFO ] Invariant cache hit.
[2024-05-31 05:11:18] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 12/20 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 12/20 places, 8/8 transitions.
Support contains 12 out of 12 places after structural reductions.
[2024-05-31 05:11:18] [INFO ] Flatten gal took : 4 ms
[2024-05-31 05:11:18] [INFO ] Flatten gal took : 5 ms
[2024-05-31 05:11:18] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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' '!(G(F(p0)))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-31 05:11:18] [INFO ] Invariant cache hit.
[2024-05-31 05:11:18] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 05:11:18] [INFO ] Invariant cache hit.
[2024-05-31 05:11:18] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-31 05:11:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 05:11:18] [INFO ] Invariant cache hit.
[2024-05-31 05:11:18] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 12/12 places, 8/8 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 226 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-00 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 (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 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 4 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLFireability-00 finished in 619 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))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-31 05:11:19] [INFO ] Invariant cache hit.
[2024-05-31 05:11:19] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-31 05:11:19] [INFO ] Invariant cache hit.
[2024-05-31 05:11:19] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-31 05:11:19] [INFO ] Invariant cache hit.
[2024-05-31 05:11:19] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLFireability-02 finished in 395 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(p1))||p0)))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-31 05:11:19] [INFO ] Invariant cache hit.
[2024-05-31 05:11:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-31 05:11:19] [INFO ] Invariant cache hit.
[2024-05-31 05:11:19] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-31 05:11:19] [INFO ] Invariant cache hit.
[2024-05-31 05:11:19] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-03 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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), (X p0), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 27 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-COL-AN02-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN02-LTLFireability-03 finished in 721 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 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-31 05:11:20] [INFO ] Invariant cache hit.
[2024-05-31 05:11:20] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 05:11:20] [INFO ] Invariant cache hit.
[2024-05-31 05:11:20] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-31 05:11:20] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 05:11:20] [INFO ] Invariant cache hit.
[2024-05-31 05:11:20] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-05 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 (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 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 4 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLFireability-05 finished in 189 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 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-31 05:11:20] [INFO ] Invariant cache hit.
[2024-05-31 05:11:20] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 05:11:20] [INFO ] Invariant cache hit.
[2024-05-31 05:11:20] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-31 05:11:20] [INFO ] Invariant cache hit.
[2024-05-31 05:11:20] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-07 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:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 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 4 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLFireability-07 finished in 183 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 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-31 05:11:20] [INFO ] Invariant cache hit.
[2024-05-31 05:11:20] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-31 05:11:20] [INFO ] Invariant cache hit.
[2024-05-31 05:11:20] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-31 05:11:20] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 05:11:20] [INFO ] Invariant cache hit.
[2024-05-31 05:11:20] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-11 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 (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 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 4 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLFireability-11 finished in 149 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 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-31 05:11:20] [INFO ] Invariant cache hit.
[2024-05-31 05:11:20] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 05:11:20] [INFO ] Invariant cache hit.
[2024-05-31 05:11:20] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-31 05:11:20] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 05:11:20] [INFO ] Invariant cache hit.
[2024-05-31 05:11:20] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 46 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22200 reset in 183 ms.
Product exploration explored 100000 steps with 22234 reset in 137 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 29 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN02-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN02-LTLFireability-12 finished in 526 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&&X(p0)))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-31 05:11:21] [INFO ] Invariant cache hit.
[2024-05-31 05:11:21] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-31 05:11:21] [INFO ] Invariant cache hit.
[2024-05-31 05:11:21] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-31 05:11:21] [INFO ] Invariant cache hit.
[2024-05-31 05:11:21] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
FORMULA Sudoku-COL-AN02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLFireability-15 finished in 207 ms.
All properties solved by simple procedures.
Total runtime 4292 ms.

BK_STOP 1717132282874

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-COL-AN02"
export BK_EXAMINATION="LTLFireability"
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-COL-AN02, examination is LTLFireability"
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-171690556100263"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN02.tgz
mv Sudoku-COL-AN02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;