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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.9K Apr 12 10:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 10:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 10:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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 4.0K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 10:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 10:10 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-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 1717256573091

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-AN03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:42:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:42:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:42:54] [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 15:42:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 15:42:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 512 ms
[2024-06-01 15:42:54] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 54 PT places and 27.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 15:42:55] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 6 ms.
[2024-06-01 15:42:55] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 2 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN03-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 15:42:55] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:42:55] [INFO ] Flatten gal took : 1 ms
Domain [N(3), N(3)] of place Rows breaks symmetries in sort N
[2024-06-01 15:42:55] [INFO ] Unfolded HLPN to a Petri net with 54 places and 27 transitions 108 arcs in 11 ms.
[2024-06-01 15:42:55] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-AN03-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-LTLFireability-13 TRUE 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 12 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2024-06-01 15:42:55] [INFO ] Computed 8 invariants in 6 ms
[2024-06-01 15:42:55] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 15:42:55] [INFO ] Invariant cache hit.
[2024-06-01 15:42:55] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 27/54 places, 27/27 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 27/54 places, 27/27 transitions.
Support contains 27 out of 27 places after structural reductions.
[2024-06-01 15:42:55] [INFO ] Flatten gal took : 14 ms
[2024-06-01 15:42:55] [INFO ] Flatten gal took : 12 ms
[2024-06-01 15:42:55] [INFO ] Input system was already deterministic with 27 transitions.
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 30 steps (0 resets) in 11 ms. (2 steps per ms) remains 0/1 properties
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0||X(F((F(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 0 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 15:42:55] [INFO ] Invariant cache hit.
[2024-06-01 15:42:55] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 15:42:55] [INFO ] Invariant cache hit.
[2024-06-01 15:42:55] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 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 72 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 320 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-00
Product exploration explored 100000 steps with 11729 reset in 387 ms.
Product exploration explored 100000 steps with 11742 reset in 307 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 (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 2 states, 2 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 1229 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 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.
[2024-06-01 15:42:56] [INFO ] Invariant cache hit.
[2024-06-01 15:42:57] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 15:42:57] [INFO ] Invariant cache hit.
[2024-06-01 15:42:57] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-06-01 15:42:57] [INFO ] Redundant transitions in 0 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 70 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-01
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN03-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-LTLFireability-01 finished in 112 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 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.
[2024-06-01 15:42:57] [INFO ] Invariant cache hit.
[2024-06-01 15:42:57] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 15:42:57] [INFO ] Invariant cache hit.
[2024-06-01 15:42:57] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-06-01 15:42:57] [INFO ] Redundant transitions in 0 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 65 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-02
Product exploration explored 100000 steps with 11748 reset in 252 ms.
Product exploration explored 100000 steps with 11741 reset in 330 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 : [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 14 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-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN03-LTLFireability-02 finished in 798 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)&&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.
[2024-06-01 15:42:57] [INFO ] Invariant cache hit.
[2024-06-01 15:42:57] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 15:42:57] [INFO ] Invariant cache hit.
[2024-06-01 15:42:57] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-06-01 15:42:57] [INFO ] Redundant transitions in 0 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 68 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), p0]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-03
Stuttering criterion allowed to conclude after 661 steps with 76 reset in 6 ms.
FORMULA Sudoku-COL-AN03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-LTLFireability-03 finished in 198 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 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.
[2024-06-01 15:42:58] [INFO ] Invariant cache hit.
[2024-06-01 15:42:58] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 15:42:58] [INFO ] Invariant cache hit.
[2024-06-01 15:42:58] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 15:42:58] [INFO ] Redundant transitions in 0 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 62 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-04
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-LTLFireability-04 finished in 169 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(F(!p0))||(F(!p0)&&(!p0||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.
[2024-06-01 15:42:58] [INFO ] Invariant cache hit.
[2024-06-01 15:42:58] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 15:42:58] [INFO ] Invariant cache hit.
[2024-06-01 15:42:58] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-06-01 15:42:58] [INFO ] Redundant transitions in 0 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 65 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 47 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-07
Product exploration explored 100000 steps with 11775 reset in 261 ms.
Product exploration explored 100000 steps with 11759 reset in 223 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 : [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 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN03-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN03-LTLFireability-07 finished in 684 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(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 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-06-01 15:42:58] [INFO ] Invariant cache hit.
[2024-06-01 15:42:58] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 15:42:58] [INFO ] Invariant cache hit.
[2024-06-01 15:42:59] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 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 76 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Product exploration explored 100000 steps with 50000 reset in 186 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 : [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 12 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-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN03-LTLFireability-09 finished in 582 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(G(!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.
[2024-06-01 15:42:59] [INFO ] Invariant cache hit.
[2024-06-01 15:42:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 15:42:59] [INFO ] Invariant cache hit.
[2024-06-01 15:42:59] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 71 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 75 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-LTLFireability-10 finished in 222 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 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.
[2024-06-01 15:42:59] [INFO ] Invariant cache hit.
[2024-06-01 15:42:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 15:42:59] [INFO ] Invariant cache hit.
[2024-06-01 15:42:59] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-01 15:42:59] [INFO ] Redundant transitions in 0 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 74 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-14
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-LTLFireability-14 finished in 157 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 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.
[2024-06-01 15:42:59] [INFO ] Invariant cache hit.
[2024-06-01 15:42:59] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 15:42:59] [INFO ] Invariant cache hit.
[2024-06-01 15:42:59] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 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 56 ms. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-15
Product exploration explored 100000 steps with 25000 reset in 238 ms.
Product exploration explored 100000 steps with 25000 reset in 250 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 : [p0, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 7 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 227 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT 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.
[2024-06-01 15:43:01] [INFO ] Invariant cache hit.
[2024-06-01 15:43:01] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 15:43:01] [INFO ] Invariant cache hit.
[2024-06-01 15:43:01] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 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 56 ms. Remains : 27/27 places, 27/27 transitions.
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 : [p0, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 271 ms.
Product exploration explored 100000 steps with 25000 reset in 250 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT 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.
[2024-06-01 15:43:03] [INFO ] Redundant transitions in 1 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 7 ms. Remains : 27/27 places, 27/27 transitions.
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.
[2024-06-01 15:43:03] [INFO ] Invariant cache hit.
[2024-06-01 15:43:03] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 15:43:03] [INFO ] Invariant cache hit.
[2024-06-01 15:43:03] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 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 56 ms. Remains : 27/27 places, 27/27 transitions.
Treatment of property Sudoku-COL-AN03-LTLFireability-15 finished in 3570 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)))))'
Found a Shortening insensitive property : Sudoku-COL-AN03-LTLFireability-15
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in LI_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.
[2024-06-01 15:43:03] [INFO ] Invariant cache hit.
[2024-06-01 15:43:03] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 15:43:03] [INFO ] Invariant cache hit.
[2024-06-01 15:43:03] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 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 LI_LTL mode , in 1 iterations and 68 ms. Remains : 27/27 places, 27/27 transitions.
Running random walk in product with property : Sudoku-COL-AN03-LTLFireability-15
Product exploration explored 100000 steps with 25000 reset in 229 ms.
Product exploration explored 100000 steps with 25000 reset in 243 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 : [p0, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 28 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT 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.
[2024-06-01 15:43:04] [INFO ] Invariant cache hit.
[2024-06-01 15:43:05] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 15:43:05] [INFO ] Invariant cache hit.
[2024-06-01 15:43:05] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 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 65 ms. Remains : 27/27 places, 27/27 transitions.
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 : [p0, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 30 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 228 ms.
Product exploration explored 100000 steps with 25000 reset in 249 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT 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.
[2024-06-01 15:43:06] [INFO ] Redundant transitions in 1 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 10 ms. Remains : 27/27 places, 27/27 transitions.
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.
[2024-06-01 15:43:06] [INFO ] Invariant cache hit.
[2024-06-01 15:43:06] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 15:43:06] [INFO ] Invariant cache hit.
[2024-06-01 15:43:06] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 58 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 58 ms. Remains : 27/27 places, 27/27 transitions.
Treatment of property Sudoku-COL-AN03-LTLFireability-15 finished in 3291 ms.
[2024-06-01 15:43:06] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:43:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 15:43:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 27 places, 27 transitions and 81 arcs took 3 ms.
Total runtime 12577 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Sudoku-COL-AN03-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717256588267

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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
mcc2024
ltl formula name Sudoku-COL-AN03-LTLFireability-15
ltl formula formula --ltl=/tmp/1118/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 27 places, 27 transitions and 81 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1118/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1118/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1118/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1118/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 29 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 28, there are 6855 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1576
pnml2lts-mc( 0/ 4): unique states count: 1576
pnml2lts-mc( 0/ 4): unique transitions count: 4401
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2968
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1625
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1625 states 4970 transitions, fanout: 3.058
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 27083, Transitions per second: 82833
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 15.7 B/state, compr.: 13.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="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-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 r536-tall-171690532300428"
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 ;