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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 6.6K Apr 12 11:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 12 11:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 10:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 10:21 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 4.1K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Apr 12 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 12 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 11:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 11:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 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-AN15-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717140669022

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-AN15
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-31 07:31:10] [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 07:31:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 07:31:10] [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 07:31:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 07:31:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 590 ms
[2024-05-31 07:31:11] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4050 PT places and 3375.0 transition bindings in 13 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 07:31:11] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 6 ms.
[2024-05-31 07:31:11] [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 2 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN15-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLFireability-13 TRUE 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 07:31:11] [INFO ] Flatten gal took : 12 ms
[2024-05-31 07:31:11] [INFO ] Flatten gal took : 0 ms
Domain [N(15), N(15)] of place Rows breaks symmetries in sort N
[2024-05-31 07:31:11] [INFO ] Unfolded HLPN to a Petri net with 4050 places and 3375 transitions 13500 arcs in 63 ms.
[2024-05-31 07:31:11] [INFO ] Unfolded 14 HLPN properties in 11 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-COL-AN15-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 675 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 67 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2024-05-31 07:31:12] [INFO ] Computed 44 invariants in 169 ms
[2024-05-31 07:31:13] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-05-31 07:31:13] [INFO ] Invariant cache hit.
[2024-05-31 07:31:14] [INFO ] Implicit Places using invariants and state equation in 1196 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
[2024-05-31 07:31:14] [INFO ] Invariant cache hit.
[2024-05-31 07:31:15] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3112 ms. Remains : 675/4050 places, 3375/3375 transitions.
Support contains 675 out of 675 places after structural reductions.
[2024-05-31 07:31:16] [INFO ] Flatten gal took : 532 ms
[2024-05-31 07:31:18] [INFO ] Flatten gal took : 550 ms
[2024-05-31 07:31:21] [INFO ] Input system was already deterministic with 3375 transitions.
Finished random walk after 197 steps, including 0 resets, run visited all 2 properties in 80 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
FORMULA Sudoku-COL-AN15-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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(G(p0)))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 7 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-31 07:31:22] [INFO ] Invariant cache hit.
[2024-05-31 07:31:22] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-31 07:31:22] [INFO ] Invariant cache hit.
[2024-05-31 07:31:23] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
[2024-05-31 07:31:23] [INFO ] Invariant cache hit.
[2024-05-31 07:31:24] [INFO ] Dead Transitions using invariants and state equation in 1129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2370 ms. Remains : 675/675 places, 3375/3375 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 224 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-02 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 s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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 196 steps with 0 reset in 52 ms.
FORMULA Sudoku-COL-AN15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLFireability-02 finished in 2754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 9 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-31 07:31:25] [INFO ] Invariant cache hit.
[2024-05-31 07:31:25] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-31 07:31:25] [INFO ] Invariant cache hit.
[2024-05-31 07:31:26] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2024-05-31 07:31:26] [INFO ] Invariant cache hit.
[2024-05-31 07:31:27] [INFO ] Dead Transitions using invariants and state equation in 1071 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2359 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 53210 steps with 268 reset in 10003 ms.
Product exploration timeout after 52150 steps with 262 reset in 10001 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN15-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN15-LTLFireability-03 finished in 25510 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 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 28 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-31 07:31:50] [INFO ] Invariant cache hit.
[2024-05-31 07:31:50] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-31 07:31:50] [INFO ] Invariant cache hit.
[2024-05-31 07:31:51] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
[2024-05-31 07:31:52] [INFO ] Redundant transitions in 201 ms returned []
[2024-05-31 07:31:52] [INFO ] Invariant cache hit.
[2024-05-31 07:31:53] [INFO ] Dead Transitions using invariants and state equation in 1092 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2534 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 38 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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 timeout after 53430 steps with 269 reset in 10004 ms.
Product exploration timeout after 53210 steps with 268 reset in 10002 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 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-COL-AN15-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN15-LTLFireability-05 finished in 25718 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((X(F((p1&&X(F(!p1)))))||p0)))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 22 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-31 07:32:16] [INFO ] Invariant cache hit.
[2024-05-31 07:32:16] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-31 07:32:16] [INFO ] Invariant cache hit.
[2024-05-31 07:32:17] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
[2024-05-31 07:32:17] [INFO ] Redundant transitions in 162 ms returned []
[2024-05-31 07:32:17] [INFO ] Invariant cache hit.
[2024-05-31 07:32:18] [INFO ] Dead Transitions using invariants and state equation in 1116 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2521 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), true, p1]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 197 steps with 0 reset in 48 ms.
FORMULA Sudoku-COL-AN15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLFireability-08 finished in 2780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 20 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-31 07:32:19] [INFO ] Invariant cache hit.
[2024-05-31 07:32:19] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-31 07:32:19] [INFO ] Invariant cache hit.
[2024-05-31 07:32:20] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
[2024-05-31 07:32:20] [INFO ] Redundant transitions in 92 ms returned []
[2024-05-31 07:32:20] [INFO ] Invariant cache hit.
[2024-05-31 07:32:21] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2404 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-09 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 s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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 198 steps with 0 reset in 41 ms.
FORMULA Sudoku-COL-AN15-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLFireability-09 finished in 2575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 18 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-31 07:32:21] [INFO ] Invariant cache hit.
[2024-05-31 07:32:21] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-31 07:32:21] [INFO ] Invariant cache hit.
[2024-05-31 07:32:23] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 1250 ms to find 0 implicit places.
[2024-05-31 07:32:23] [INFO ] Redundant transitions in 95 ms returned []
[2024-05-31 07:32:23] [INFO ] Invariant cache hit.
[2024-05-31 07:32:24] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2434 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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 196 steps with 0 reset in 41 ms.
FORMULA Sudoku-COL-AN15-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLFireability-10 finished in 2621 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(G(!p0)))))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 16 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-31 07:32:24] [INFO ] Invariant cache hit.
[2024-05-31 07:32:24] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-31 07:32:24] [INFO ] Invariant cache hit.
[2024-05-31 07:32:25] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
[2024-05-31 07:32:25] [INFO ] Invariant cache hit.
[2024-05-31 07:32:26] [INFO ] Dead Transitions using invariants and state equation in 1100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2364 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, true, p0, true]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLFireability-11 finished in 2656 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 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 17 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-31 07:32:27] [INFO ] Invariant cache hit.
[2024-05-31 07:32:27] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-31 07:32:27] [INFO ] Invariant cache hit.
[2024-05-31 07:32:28] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
[2024-05-31 07:32:28] [INFO ] Redundant transitions in 93 ms returned []
[2024-05-31 07:32:28] [INFO ] Invariant cache hit.
[2024-05-31 07:32:29] [INFO ] Dead Transitions using invariants and state equation in 1049 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2383 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN15-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 s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 51810 steps with 261 reset in 10003 ms.
Product exploration timeout after 51630 steps with 260 reset in 10002 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 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-AN15-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN15-LTLFireability-12 finished in 25587 ms.
All properties solved by simple procedures.
Total runtime 102111 ms.

BK_STOP 1717140773895

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-AN15"
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-AN15, 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-171690556200328"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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