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.r485-tall-167912698800020.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 itstools
Input is Sudoku-COL-AN03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912698800020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 5.6K Feb 26 09:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 09:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 09:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:35 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.8K 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 5.7K Feb 26 09:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K Feb 26 09:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 09:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 09:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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-AN03-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679146257309

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN03
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-18 13:30:58] [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]
[2023-03-18 13:30:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 13:30:59] [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 13:30:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 13:30:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 377 ms
[2023-03-18 13:30:59] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 54 PT places and 27.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 13:30:59] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 13:30:59] [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).
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [N(3), N(3)] of place Rows breaks symmetries in sort N
[2023-03-18 13:30:59] [INFO ] Unfolded HLPN to a Petri net with 54 places and 27 transitions 108 arcs in 6 ms.
[2023-03-18 13:30:59] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 6 formulas.
FORMULA Sudoku-COL-AN03-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 27 transition count 27
Applied a total of 27 rules in 5 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2023-03-18 13:30:59] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-18 13:30:59] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-18 13:30:59] [INFO ] Invariant cache hit.
[2023-03-18 13:30:59] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-18 13:30:59] [INFO ] Invariant cache hit.
[2023-03-18 13:30:59] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 27/54 places, 27/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 27/54 places, 27/27 transitions.
Support contains 27 out of 27 places after structural reductions.
[2023-03-18 13:30:59] [INFO ] Flatten gal took : 28 ms
[2023-03-18 13:31:00] [INFO ] Flatten gal took : 13 ms
[2023-03-18 13:31:00] [INFO ] Input system was already deterministic with 27 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 6 properties in 7 ms. (steps per millisecond=1 )
FORMULA Sudoku-COL-AN03-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 27 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
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' '!(X(X((X(G(p1))||p0))))'
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-18 13:31:00] [INFO ] Invariant cache hit.
[2023-03-18 13:31:00] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-18 13:31:00] [INFO ] Invariant cache hit.
[2023-03-18 13:31:00] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-18 13:31:00] [INFO ] Invariant cache hit.
[2023-03-18 13:31:00] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 409 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 349 ms.
Product exploration explored 100000 steps with 33333 reset in 284 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN03-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN03-LTLFireability-00 finished in 1403 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 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-18 13:31:01] [INFO ] Invariant cache hit.
[2023-03-18 13:31:01] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 13:31:01] [INFO ] Invariant cache hit.
[2023-03-18 13:31:01] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-18 13:31:01] [INFO ] Invariant cache hit.
[2023-03-18 13:31:01] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s8 1) (LT s16 1) (LT s23 1)) (OR (LT s0 1) (LT s9 1) (LT s18 1)) (OR (LT s2 1) (LT s9 1) (LT s20 1)) (OR (LT s4 1) (LT s12 1) (LT s19 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
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 :(X (NOT p0))
Knowledge based reduction with 4 factoid took 86 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-AN03-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN03-LTLFireability-01 finished in 739 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 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-18 13:31:02] [INFO ] Invariant cache hit.
[2023-03-18 13:31:02] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 13:31:02] [INFO ] Invariant cache hit.
[2023-03-18 13:31:02] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-18 13:31:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:31:02] [INFO ] Invariant cache hit.
[2023-03-18 13:31:02] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 29 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s8 1) (LT s16 1) (LT s23 1)) (OR (LT s0 1) (LT s9 1) (LT s18 1)) (OR (LT s2 1) (LT s9 1) (LT s20 1)) (OR (LT s4 1) (LT s12 1) (LT s19 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-LTLFireability-03 finished in 134 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&&X(X(G(p0))))))'
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-18 13:31:02] [INFO ] Invariant cache hit.
[2023-03-18 13:31:02] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 13:31:02] [INFO ] Invariant cache hit.
[2023-03-18 13:31:02] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-18 13:31:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 13:31:02] [INFO ] Invariant cache hit.
[2023-03-18 13:31:02] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s8 1) (LT s16 1) (LT s23 1)) (OR (LT s0 1) (LT s9 1) (LT s18 1)) (OR (LT s2 1) (LT s9 1) (LT s20 1)) (OR (LT s4 1) (LT s12 1) (LT s19 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 11748 reset in 308 ms.
Product exploration explored 100000 steps with 11753 reset in 397 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
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 123 ms. Reduced automaton from 4 states, 8 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN03-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN03-LTLFireability-04 finished in 1093 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((X((G(F(!p2))||p1))||p0)))'
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-18 13:31:03] [INFO ] Invariant cache hit.
[2023-03-18 13:31:03] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-18 13:31:03] [INFO ] Invariant cache hit.
[2023-03-18 13:31:03] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-18 13:31:03] [INFO ] Invariant cache hit.
[2023-03-18 13:31:03] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), p2, p2]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-LTLFireability-05 finished in 279 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 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-18 13:31:03] [INFO ] Invariant cache hit.
[2023-03-18 13:31:04] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 13:31:04] [INFO ] Invariant cache hit.
[2023-03-18 13:31:04] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-18 13:31:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:31:04] [INFO ] Invariant cache hit.
[2023-03-18 13:31:04] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 38 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s8 1) (LT s16 1) (LT s23 1)) (OR (LT s0 1) (LT s9 1) (LT s18 1)) (OR (LT s2 1) (LT s9 1) (LT s20 1)) (OR (LT s4 1) (LT s12 1) (LT s19 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-LTLFireability-06 finished in 149 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((p0&&(X(p0)||p1)))))'
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-18 13:31:04] [INFO ] Invariant cache hit.
[2023-03-18 13:31:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-18 13:31:04] [INFO ] Invariant cache hit.
[2023-03-18 13:31:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-18 13:31:04] [INFO ] Invariant cache hit.
[2023-03-18 13:31:04] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 248 ms.
Product exploration explored 100000 steps with 33333 reset in 246 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p0 (NOT p1)))))
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN03-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN03-LTLFireability-10 finished in 920 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 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-18 13:31:05] [INFO ] Invariant cache hit.
[2023-03-18 13:31:05] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 13:31:05] [INFO ] Invariant cache hit.
[2023-03-18 13:31:05] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-18 13:31:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:31:05] [INFO ] Invariant cache hit.
[2023-03-18 13:31:05] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-11 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:(AND (OR (LT s8 1) (LT s16 1) (LT s23 1)) (OR (LT s0 1) (LT s9 1) (LT s18 1)) (OR (LT s2 1) (LT s9 1) (LT s20 1)) (OR (LT s4 1) (LT s12 1) (LT s19 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11722 reset in 218 ms.
Product exploration explored 100000 steps with 11744 reset in 225 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
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 258 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN03-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN03-LTLFireability-11 finished in 904 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))'
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-18 13:31:05] [INFO ] Invariant cache hit.
[2023-03-18 13:31:05] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-18 13:31:05] [INFO ] Invariant cache hit.
[2023-03-18 13:31:06] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-18 13:31:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:31:06] [INFO ] Invariant cache hit.
[2023-03-18 13:31:06] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 88 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s8 1) (LT s16 1) (LT s23 1)) (OR (LT s0 1) (LT s9 1) (LT s18 1)) (OR (LT s2 1) (LT s9 1) (LT s20 1)) (OR (LT s4 1) (LT s12 1) (LT s19 1)) ...], 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 11745 reset in 225 ms.
Product exploration explored 100000 steps with 11738 reset in 230 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
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 88 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-AN03-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN03-LTLFireability-12 finished in 729 ms.
All properties solved by simple procedures.
Total runtime 7819 ms.

BK_STOP 1679146268022

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-AN03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Sudoku-COL-AN03, 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 r485-tall-167912698800020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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