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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.2K Feb 26 09:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 09:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 26 09:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Feb 26 09:14 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:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 09:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 09:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 09:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 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-AN04-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679169844107

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-AN04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 20:04:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:04:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:04: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-18 20:04:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 20:04:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 599 ms
[2023-03-18 20:04:06] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 112 PT places and 64.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-COL-AN04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:04:06] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2023-03-18 20:04:06] [INFO ] Skeletonized 15 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 3 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN04-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLFireability-14 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-18 20:04:06] [INFO ] Flatten gal took : 11 ms
[2023-03-18 20:04:06] [INFO ] Flatten gal took : 1 ms
Domain [N(4), N(4)] of place Rows breaks symmetries in sort N
[2023-03-18 20:04:06] [INFO ] Unfolded HLPN to a Petri net with 112 places and 64 transitions 256 arcs in 9 ms.
[2023-03-18 20:04:06] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-AN04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 8 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2023-03-18 20:04:06] [INFO ] Computed 11 place invariants in 11 ms
[2023-03-18 20:04:06] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-18 20:04:06] [INFO ] Invariant cache hit.
[2023-03-18 20:04:06] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-18 20:04:06] [INFO ] Invariant cache hit.
[2023-03-18 20:04:06] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 48/112 places, 64/64 transitions.
Support contains 48 out of 48 places after structural reductions.
[2023-03-18 20:04:06] [INFO ] Flatten gal took : 19 ms
[2023-03-18 20:04:07] [INFO ] Flatten gal took : 21 ms
[2023-03-18 20:04:07] [INFO ] Input system was already deterministic with 64 transitions.
Finished random walk after 12 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=1 )
FORMULA Sudoku-COL-AN04-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:04:07] [INFO ] Invariant cache hit.
[2023-03-18 20:04:07] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 20:04:07] [INFO ] Invariant cache hit.
[2023-03-18 20:04:07] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-18 20:04:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:04:07] [INFO ] Invariant cache hit.
[2023-03-18 20:04:07] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s17 1) (LT s37 1)) (OR (LT s10 1) (LT s26 1) (LT s42 1)) (OR (LT s9 1) (LT s24 1) (LT s33 1)) (OR (LT s12 1) (LT s31 1) (LT s44 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6950 reset in 656 ms.
Product exploration explored 100000 steps with 6947 reset in 535 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 96 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-AN04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLFireability-00 finished in 1805 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 U X(!p0)))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:04:09] [INFO ] Invariant cache hit.
[2023-03-18 20:04:09] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 20:04:09] [INFO ] Invariant cache hit.
[2023-03-18 20:04:09] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-18 20:04:09] [INFO ] Invariant cache hit.
[2023-03-18 20:04:09] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s17 1) (LT s37 1)) (OR (LT s10 1) (LT s26 1) (LT s42 1)) (OR (LT s9 1) (LT s24 1) (LT s33 1)) (OR (LT s12 1) (LT s31 1) (LT s44 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLFireability-02 finished in 220 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' '!(G(F(!p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:04:09] [INFO ] Invariant cache hit.
[2023-03-18 20:04:09] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-18 20:04:09] [INFO ] Invariant cache hit.
[2023-03-18 20:04:09] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-18 20:04:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:04:09] [INFO ] Invariant cache hit.
[2023-03-18 20:04:09] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s17 1) (LT s37 1)) (OR (LT s10 1) (LT s26 1) (LT s42 1)) (OR (LT s9 1) (LT s24 1) (LT s33 1)) (OR (LT s12 1) (LT s31 1) (LT s44 ...], 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 13 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLFireability-04 finished in 219 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((G(!p1)||p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:04:09] [INFO ] Invariant cache hit.
[2023-03-18 20:04:09] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 20:04:09] [INFO ] Invariant cache hit.
[2023-03-18 20:04:09] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-18 20:04:09] [INFO ] Invariant cache hit.
[2023-03-18 20:04:09] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s1 1) (LT s17 1) (LT s37 1)) (OR (LT s10 1) (LT s26 1) (LT s42 1)) (OR (LT s9 1) (LT s24 1) (LT s33 1)) (OR (LT s12 1) (LT s31 1) (LT s44 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 455 ms.
Product exploration explored 100000 steps with 50000 reset in 498 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLFireability-05 finished in 1409 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)||G(p0))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:04:10] [INFO ] Invariant cache hit.
[2023-03-18 20:04:11] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 20:04:11] [INFO ] Invariant cache hit.
[2023-03-18 20:04:11] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-18 20:04:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:04:11] [INFO ] Invariant cache hit.
[2023-03-18 20:04:11] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 29 ms :[false]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s17 1) (LT s37 1)) (OR (LT s10 1) (LT s26 1) (LT s42 1)) (OR (LT s9 1) (LT s24 1) (LT s33 1)) (OR (LT s12 1) (LT s31 1) (LT s44 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6959 reset in 572 ms.
Product exploration explored 100000 steps with 6958 reset in 511 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 91 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-AN04-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLFireability-07 finished in 1407 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(G(!p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:04:12] [INFO ] Invariant cache hit.
[2023-03-18 20:04:12] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 20:04:12] [INFO ] Invariant cache hit.
[2023-03-18 20:04:12] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-18 20:04:12] [INFO ] Invariant cache hit.
[2023-03-18 20:04:12] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s1 1) (LT s17 1) (LT s37 1)) (OR (LT s10 1) (LT s26 1) (LT s42 1)) (OR (LT s9 1) (LT s24 1) (LT s33 1)) (OR (LT s12 1) (LT s31 1) (LT s44 ...], 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 14 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLFireability-08 finished in 349 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(F(p0)))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 20:04:12] [INFO ] Invariant cache hit.
[2023-03-18 20:04:12] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 20:04:12] [INFO ] Invariant cache hit.
[2023-03-18 20:04:12] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-18 20:04:12] [INFO ] Invariant cache hit.
[2023-03-18 20:04:12] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s1 1) (LT s17 1) (LT s37 1)) (OR (LT s10 1) (LT s26 1) (LT s42 1)) (OR (LT s9 1) (LT s24 1) (LT s33 1)) (OR (LT s12 1) (LT s31 1) (LT s44 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6950 reset in 450 ms.
Product exploration explored 100000 steps with 6946 reset in 459 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLFireability-13 finished in 1350 ms.
All properties solved by simple procedures.
Total runtime 8471 ms.
ITS solved all properties within timeout

BK_STOP 1679169855291

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

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