Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.9K Apr 12 10:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 10:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 10:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 10:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 11:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 11:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 10:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 12 10:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717259300004

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-AN09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:28:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:28:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:28:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 16:28:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:28:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 546 ms
[2024-06-01 16:28:21] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 972 PT places and 729.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 16:28:22] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 9 ms.
[2024-06-01 16:28:22] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 3 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN09-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLFireability-10 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).
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 16:28:22] [INFO ] Flatten gal took : 10 ms
[2024-06-01 16:28:22] [INFO ] Flatten gal took : 1 ms
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2024-06-01 16:28:22] [INFO ] Unfolded HLPN to a Petri net with 972 places and 729 transitions 2916 arcs in 33 ms.
[2024-06-01 16:28:22] [INFO ] Unfolded 13 HLPN properties in 3 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-AN09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 243 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 243 transition count 729
Applied a total of 729 rules in 28 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2024-06-01 16:28:23] [INFO ] Computed 26 invariants in 39 ms
[2024-06-01 16:28:23] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-06-01 16:28:23] [INFO ] Invariant cache hit.
[2024-06-01 16:28:23] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Starting structural reductions in LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 605 ms. Remains : 243/972 places, 729/729 transitions.
Support contains 243 out of 243 places after structural reductions.
[2024-06-01 16:28:23] [INFO ] Flatten gal took : 163 ms
[2024-06-01 16:28:24] [INFO ] Flatten gal took : 179 ms
[2024-06-01 16:28:25] [INFO ] Input system was already deterministic with 729 transitions.
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 278 steps (0 resets) in 388 ms. (0 steps per ms) remains 0/2 properties
FORMULA Sudoku-COL-AN09-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p1)||p0)))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 16:28:26] [INFO ] Invariant cache hit.
[2024-06-01 16:28:26] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 16:28:26] [INFO ] Invariant cache hit.
[2024-06-01 16:28:26] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 300 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 6247 ms.
Product exploration explored 100000 steps with 50000 reset in 6245 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN09-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLFireability-00 finished in 15161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U (X(X(G(p0)))||(!p0&&X(X(p0))))))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 16:28:41] [INFO ] Invariant cache hit.
[2024-06-01 16:28:41] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 16:28:41] [INFO ] Invariant cache hit.
[2024-06-01 16:28:41] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-01
Product exploration explored 100000 steps with 25019 reset in 8813 ms.
Product exploration explored 100000 steps with 25034 reset in 8892 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
RANDOM walk for 278 steps (0 resets) in 47 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN09-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLFireability-01 finished in 20269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 16:29:01] [INFO ] Invariant cache hit.
[2024-06-01 16:29:01] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 16:29:01] [INFO ] Invariant cache hit.
[2024-06-01 16:29:01] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-06-01 16:29:01] [INFO ] Redundant transitions in 41 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 339 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-07
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-AN09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN09-LTLFireability-07 finished in 407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((X(X(!p0)) U G(p1))))))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 16:29:02] [INFO ] Invariant cache hit.
[2024-06-01 16:29:02] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 16:29:02] [INFO ] Invariant cache hit.
[2024-06-01 16:29:02] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-06-01 16:29:02] [INFO ] Redundant transitions in 8 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 298 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-08
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-AN09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN09-LTLFireability-08 finished in 673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(!p0)))))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 16:29:02] [INFO ] Invariant cache hit.
[2024-06-01 16:29:02] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 16:29:02] [INFO ] Invariant cache hit.
[2024-06-01 16:29:03] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 271 ms :[p0, p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-11
Product exploration explored 100000 steps with 1419 reset in 4275 ms.
Product exploration explored 100000 steps with 1418 reset in 4296 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 (Minato strategy)
Knowledge based reduction with 2 factoid took 17 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-AN09-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLFireability-11 finished in 9493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 8 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 16:29:12] [INFO ] Invariant cache hit.
[2024-06-01 16:29:12] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 16:29:12] [INFO ] Invariant cache hit.
[2024-06-01 16:29:12] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-06-01 16:29:12] [INFO ] Redundant transitions in 6 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 279 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-12
Stuttering criterion allowed to conclude after 68 steps with 0 reset in 8 ms.
FORMULA Sudoku-COL-AN09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN09-LTLFireability-12 finished in 357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 16:29:12] [INFO ] Invariant cache hit.
[2024-06-01 16:29:12] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 16:29:12] [INFO ] Invariant cache hit.
[2024-06-01 16:29:12] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-06-01 16:29:12] [INFO ] Redundant transitions in 8 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 32 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-14
Product exploration explored 100000 steps with 1419 reset in 4252 ms.
Product exploration explored 100000 steps with 1420 reset in 4308 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 23 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-AN09-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLFireability-14 finished in 10748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 16:29:23] [INFO ] Invariant cache hit.
[2024-06-01 16:29:23] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 16:29:23] [INFO ] Invariant cache hit.
[2024-06-01 16:29:23] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-06-01 16:29:23] [INFO ] Redundant transitions in 6 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 298 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 94 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-15
Product exploration explored 100000 steps with 1418 reset in 4259 ms.
Product exploration explored 100000 steps with 1419 reset in 4362 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 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-AN09-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLFireability-15 finished in 10836 ms.
All properties solved by simple procedures.
Total runtime 72999 ms.
ITS solved all properties within timeout

BK_STOP 1717259374523

--------------------
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.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-AN09"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-COL-AN09, 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 r536-tall-171690532400476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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