Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r489-tall-167912706400124.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Sudoku-COL-AN16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706400124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 11:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 11:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 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-AN16-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679195463866

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN16
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 03:11:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 03:11:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 03:11:05] [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.
[2023-03-19 03:11:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 03:11:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 382 ms
[2023-03-19 03:11:05] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4864 PT places and 4096.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
FORMULA Sudoku-COL-AN16-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 03:11:06] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 6 ms.
[2023-03-19 03:11:06] [INFO ] Skeletonized 15 HLPN properties in 1 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 1 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN16-LTLFireability-00 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 )
[2023-03-19 03:11:06] [INFO ] Flatten gal took : 10 ms
[2023-03-19 03:11:06] [INFO ] Flatten gal took : 1 ms
Domain [N(16), N(16)] of place Rows breaks symmetries in sort N
[2023-03-19 03:11:06] [INFO ] Unfolded HLPN to a Petri net with 4864 places and 4096 transitions 16384 arcs in 66 ms.
[2023-03-19 03:11:06] [INFO ] Unfolded 14 HLPN properties in 14 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-AN16-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 768 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 768 transition count 4096
Applied a total of 4096 rules in 70 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2023-03-19 03:11:17] [INFO ] Computed 47 place invariants in 413 ms
[2023-03-19 03:11:17] [INFO ] Implicit Places using invariants in 655 ms returned []
[2023-03-19 03:11:17] [INFO ] Invariant cache hit.
[2023-03-19 03:11:18] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
[2023-03-19 03:11:18] [INFO ] Invariant cache hit.
[2023-03-19 03:11:19] [INFO ] Dead Transitions using invariants and state equation in 1237 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2853 ms. Remains : 768/4864 places, 4096/4096 transitions.
Support contains 768 out of 768 places after structural reductions.
[2023-03-19 03:11:21] [INFO ] Flatten gal took : 705 ms
[2023-03-19 03:11:25] [INFO ] Flatten gal took : 774 ms
[2023-03-19 03:11:29] [INFO ] Input system was already deterministic with 4096 transitions.
Finished random walk after 227 steps, including 0 resets, run visited all 3 properties in 121 ms. (steps per millisecond=1 )
FORMULA Sudoku-COL-AN16-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 33 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 03:11:37] [INFO ] Invariant cache hit.
[2023-03-19 03:11:37] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-19 03:11:37] [INFO ] Invariant cache hit.
[2023-03-19 03:11:38] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
[2023-03-19 03:11:38] [INFO ] Redundant transitions in 286 ms returned []
[2023-03-19 03:11:38] [INFO ] Invariant cache hit.
[2023-03-19 03:11:40] [INFO ] Dead Transitions using invariants and state equation in 1289 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2566 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-01 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 s177 1) (GEQ s446 1) (GEQ s737 1)) (AND (GEQ s208 1) (GEQ s469 1) (GEQ s592 1)) (AND (GEQ s100 1) (GEQ s362 1) (GEQ s676 1)) (AND (GEQ s1...], 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 225 steps with 0 reset in 61 ms.
FORMULA Sudoku-COL-AN16-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN16-LTLFireability-01 finished in 2854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p0)))))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 28 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 03:11:40] [INFO ] Invariant cache hit.
[2023-03-19 03:11:40] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-19 03:11:40] [INFO ] Invariant cache hit.
[2023-03-19 03:11:41] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2023-03-19 03:11:41] [INFO ] Redundant transitions in 244 ms returned []
[2023-03-19 03:11:41] [INFO ] Invariant cache hit.
[2023-03-19 03:11:42] [INFO ] Dead Transitions using invariants and state equation in 1212 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2558 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-02 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 s177 1) (GEQ s446 1) (GEQ s737 1)) (AND (GEQ s208 1) (GEQ s469 1) (GEQ s592 1)) (AND (GEQ s100 1) (GEQ s362 1) (GEQ s676 1)) (AND (GEQ s1...], 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 223 steps with 0 reset in 68 ms.
FORMULA Sudoku-COL-AN16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN16-LTLFireability-02 finished in 3559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p0&&F(!p0))))))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 9 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 03:11:44] [INFO ] Invariant cache hit.
[2023-03-19 03:11:44] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-19 03:11:44] [INFO ] Invariant cache hit.
[2023-03-19 03:11:45] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
[2023-03-19 03:11:45] [INFO ] Invariant cache hit.
[2023-03-19 03:11:46] [INFO ] Dead Transitions using invariants and state equation in 1259 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2268 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s177 1) (GEQ s446 1) (GEQ s737 1)) (AND (GEQ s208 1) (GEQ s469 1) (GEQ s592 1)) (AND (GEQ s100 1) (GEQ s362 1) (GEQ s676 1)) (AND (GEQ s1...], 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 23850 steps with 11925 reset in 10003 ms.
Product exploration timeout after 23160 steps with 11580 reset in 10001 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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 :(X p0)
Knowledge based reduction with 3 factoid took 63 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-AN16-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN16-LTLFireability-03 finished in 27972 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 9 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 03:12:11] [INFO ] Invariant cache hit.
[2023-03-19 03:12:12] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-19 03:12:12] [INFO ] Invariant cache hit.
[2023-03-19 03:12:12] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
[2023-03-19 03:12:12] [INFO ] Invariant cache hit.
[2023-03-19 03:12:14] [INFO ] Dead Transitions using invariants and state equation in 1244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2255 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT 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 s177 1) (GEQ s446 1) (GEQ s737 1)) (AND (GEQ s208 1) (GEQ s469 1) (GEQ s592 1)) (AND (GEQ s100 1) (GEQ s362 1) (GEQ s676 1)) (AND (GEQ s1...], 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 2 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-AN16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN16-LTLFireability-05 finished in 2525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0||G(p0))))'
Support contains 0 out of 768 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 22 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 03:12:14] [INFO ] Invariant cache hit.
[2023-03-19 03:12:14] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-19 03:12:14] [INFO ] Invariant cache hit.
[2023-03-19 03:12:15] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 938 ms to find 0 implicit places.
[2023-03-19 03:12:15] [INFO ] Redundant transitions in 150 ms returned []
[2023-03-19 03:12:15] [INFO ] Invariant cache hit.
[2023-03-19 03:12:16] [INFO ] Dead Transitions using invariants and state equation in 1289 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2408 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 17 ms :[false]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-07 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN16-LTLFireability-07 TRUE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN16-LTLFireability-07 finished in 3195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(!p0))))))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 6 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 03:12:17] [INFO ] Invariant cache hit.
[2023-03-19 03:12:17] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-19 03:12:17] [INFO ] Invariant cache hit.
[2023-03-19 03:12:18] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
[2023-03-19 03:12:18] [INFO ] Invariant cache hit.
[2023-03-19 03:12:19] [INFO ] Dead Transitions using invariants and state equation in 1234 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2209 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 192 ms :[p0, p0, p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (AND (GEQ s177 1) (GEQ s446 1) (GEQ s737 1)) (AND (GEQ s208 1) (GEQ s469 1) (GEQ s592 1)) (AND (GEQ s100 1) (GEQ s362 1) (GEQ s676 1)) (AND (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 35720 steps with 158 reset in 10003 ms.
Product exploration timeout after 36370 steps with 160 reset in 10001 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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, (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 2 factoid took 55 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN16-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN16-LTLFireability-09 finished in 26792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)&&(X(G((X(p0)||p2)))||p1))))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 5 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 03:12:44] [INFO ] Invariant cache hit.
[2023-03-19 03:12:44] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-19 03:12:44] [INFO ] Invariant cache hit.
[2023-03-19 03:12:45] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
[2023-03-19 03:12:45] [INFO ] Invariant cache hit.
[2023-03-19 03:12:46] [INFO ] Dead Transitions using invariants and state equation in 1142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2176 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p2) (NOT p0)), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s177 1) (GEQ s446 1) (GEQ s737 1)) (AND (GEQ s208 1) (GEQ s469 1) (GEQ s592 1)) (AND (GEQ s100 1) (GEQ s362 1) (GEQ s676 1)) (AND (GEQ s1...], 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, null][false, false, false, false, false, false]]
Product exploration timeout after 37440 steps with 165 reset in 10001 ms.
Product exploration timeout after 36870 steps with 163 reset in 10009 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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 p2), (X p1), (X p0), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 6 factoid took 133 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN16-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN16-LTLFireability-11 finished in 35622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 27 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 03:13:20] [INFO ] Invariant cache hit.
[2023-03-19 03:13:20] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-19 03:13:20] [INFO ] Invariant cache hit.
[2023-03-19 03:13:21] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
[2023-03-19 03:13:21] [INFO ] Redundant transitions in 152 ms returned []
[2023-03-19 03:13:21] [INFO ] Invariant cache hit.
[2023-03-19 03:13:22] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2337 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-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 (AND (GEQ s177 1) (GEQ s446 1) (GEQ s737 1)) (AND (GEQ s208 1) (GEQ s469 1) (GEQ s592 1)) (AND (GEQ s100 1) (GEQ s362 1) (GEQ s676 1)) (AND (GEQ s1...], 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 229 steps with 0 reset in 69 ms.
FORMULA Sudoku-COL-AN16-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN16-LTLFireability-12 finished in 2502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 9 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 03:13:22] [INFO ] Invariant cache hit.
[2023-03-19 03:13:22] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-19 03:13:22] [INFO ] Invariant cache hit.
[2023-03-19 03:13:23] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
[2023-03-19 03:13:23] [INFO ] Invariant cache hit.
[2023-03-19 03:13:24] [INFO ] Dead Transitions using invariants and state equation in 1231 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2172 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 79 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-14 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 s177 1) (GEQ s446 1) (GEQ s737 1)) (AND (GEQ s208 1) (GEQ s469 1) (GEQ s592 1)) (AND (GEQ s100 1) (GEQ s362 1) (GEQ s676 1)) (AND (GEQ s1...], 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 37210 steps with 164 reset in 10001 ms.
Product exploration timeout after 37320 steps with 165 reset in 10001 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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 :(F (G (NOT p0)))
Knowledge based reduction with 3 factoid took 65 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-AN16-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN16-LTLFireability-14 finished in 26620 ms.
All properties solved by simple procedures.
Total runtime 163901 ms.
ITS solved all properties within timeout

BK_STOP 1679195630310

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-AN16"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-COL-AN16, 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 r489-tall-167912706400124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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