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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 53M
-rw-r--r-- 1 mcc users 604K Apr 12 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 12 11:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.4M Apr 12 11:05 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 308K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 810K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 393K Apr 12 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9M Apr 12 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29M Apr 12 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 207K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 963K 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-PT-AN12-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717273200307

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:20:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:20:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:20:01] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2024-06-01 20:20:01] [INFO ] Transformed 2160 places.
[2024-06-01 20:20:01] [INFO ] Transformed 1728 transitions.
[2024-06-01 20:20:01] [INFO ] Found NUPN structural information;
[2024-06-01 20:20:01] [INFO ] Parsed PT model containing 2160 places and 1728 transitions and 6912 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 142 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN12-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 432 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1728 places and 0 transitions.
Iterating post reduction 0 with 1728 rules applied. Total rules applied 1728 place count 432 transition count 1728
Applied a total of 1728 rules in 55 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2024-06-01 20:20:06] [INFO ] Computed 35 invariants in 108 ms
[2024-06-01 20:20:06] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-06-01 20:20:06] [INFO ] Invariant cache hit.
[2024-06-01 20:20:06] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 1007 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 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1081 ms. Remains : 432/2160 places, 1728/1728 transitions.
Support contains 432 out of 432 places after structural reductions.
[2024-06-01 20:20:07] [INFO ] Flatten gal took : 377 ms
[2024-06-01 20:20:10] [INFO ] Flatten gal took : 416 ms
[2024-06-01 20:20:12] [INFO ] Input system was already deterministic with 1728 transitions.
Reduction of identical properties reduced properties to check from 19 to 17
RANDOM walk for 827 steps (4 resets) in 392 ms. (2 steps per ms) remains 0/17 properties
FORMULA Sudoku-PT-AN12-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-AN12-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-AN12-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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((p0&&X(X(G(p0))))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 4 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:20:14] [INFO ] Invariant cache hit.
[2024-06-01 20:20:15] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 20:20:15] [INFO ] Invariant cache hit.
[2024-06-01 20:20:15] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 731 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 736 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-00
Entered a terminal (fully accepting) state of product in 122 steps with 0 reset in 25 ms.
FORMULA Sudoku-PT-AN12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLFireability-00 finished in 1269 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(G((X(p1)||p0)))&&F(p1))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 5 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:20:16] [INFO ] Invariant cache hit.
[2024-06-01 20:20:16] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 20:20:16] [INFO ] Invariant cache hit.
[2024-06-01 20:20:16] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 741 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 747 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-03
Product exploration timeout after 96790 steps with 767 reset in 10002 ms.
Product exploration timeout after 97400 steps with 772 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 26 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN12-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN12-LTLFireability-03 finished in 37291 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' '!((p0 U X(p0)))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 6 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:20:53] [INFO ] Invariant cache hit.
[2024-06-01 20:20:53] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 20:20:53] [INFO ] Invariant cache hit.
[2024-06-01 20:20:54] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 795 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 802 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-04
Product exploration timeout after 63820 steps with 31910 reset in 10001 ms.
Product exploration timeout after 63820 steps with 31910 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 19 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN12-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN12-LTLFireability-04 finished in 35893 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(p1))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 18 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:21:29] [INFO ] Invariant cache hit.
[2024-06-01 20:21:29] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 20:21:29] [INFO ] Invariant cache hit.
[2024-06-01 20:21:29] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2024-06-01 20:21:30] [INFO ] Redundant transitions in 76 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 802 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-06
Product exploration timeout after 99980 steps with 792 reset in 10001 ms.
Product exploration timeout after 97700 steps with 775 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 509 steps (0 resets) in 118 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 7 factoid took 217 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-PT-AN12-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN12-LTLFireability-06 finished in 36877 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((((p0 U G(p0))&&p0) U (X(p0) U p0))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 3 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:22:06] [INFO ] Invariant cache hit.
[2024-06-01 20:22:06] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 20:22:06] [INFO ] Invariant cache hit.
[2024-06-01 20:22:06] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 667 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 671 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-07
Product exploration timeout after 64260 steps with 32130 reset in 10002 ms.
Product exploration timeout after 64050 steps with 32025 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 19 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-PT-AN12-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN12-LTLFireability-07 finished in 36201 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((X(p1)||p0))||X(F(p2)))))'
Support contains 9 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 96 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:22:42] [INFO ] Invariant cache hit.
[2024-06-01 20:22:44] [INFO ] Implicit Places using invariants in 2450 ms returned []
[2024-06-01 20:22:44] [INFO ] Invariant cache hit.
[2024-06-01 20:22:53] [INFO ] Implicit Places using invariants and state equation in 8109 ms returned []
Implicit Place search using SMT with State Equation took 10562 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 10661 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-08
Product exploration timeout after 55430 steps with 1398 reset in 10002 ms.
Product exploration timeout after 54200 steps with 1434 reset in 10002 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN12-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN12-LTLFireability-08 finished in 45766 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 6 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 53 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:23:28] [INFO ] Invariant cache hit.
[2024-06-01 20:23:30] [INFO ] Implicit Places using invariants in 2326 ms returned []
[2024-06-01 20:23:30] [INFO ] Invariant cache hit.
[2024-06-01 20:23:38] [INFO ] Implicit Places using invariants and state equation in 8286 ms returned []
Implicit Place search using SMT with State Equation took 10622 ms to find 0 implicit places.
[2024-06-01 20:23:38] [INFO ] Redundant transitions in 88 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 10777 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-09
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 16 ms.
FORMULA Sudoku-PT-AN12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLFireability-09 finished in 10845 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((p0||G((F(G(p1))&&F(p2))))))'
Support contains 9 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 61 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:23:39] [INFO ] Invariant cache hit.
[2024-06-01 20:23:41] [INFO ] Implicit Places using invariants in 2315 ms returned []
[2024-06-01 20:23:41] [INFO ] Invariant cache hit.
[2024-06-01 20:23:49] [INFO ] Implicit Places using invariants and state equation in 8331 ms returned []
Implicit Place search using SMT with State Equation took 10653 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 10716 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-10
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 18 ms.
FORMULA Sudoku-PT-AN12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLFireability-10 finished in 10977 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((p0||X(F(p1)))))'
Support contains 6 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 31 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:23:49] [INFO ] Invariant cache hit.
[2024-06-01 20:23:52] [INFO ] Implicit Places using invariants in 2288 ms returned []
[2024-06-01 20:23:52] [INFO ] Invariant cache hit.
[2024-06-01 20:24:00] [INFO ] Implicit Places using invariants and state equation in 7947 ms returned []
Implicit Place search using SMT with State Equation took 10249 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 10284 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-13
Stuttering criterion allowed to conclude after 3574 steps with 1708 reset in 555 ms.
FORMULA Sudoku-PT-AN12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLFireability-13 finished in 10967 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||F(p1))&&(F(p1)||X(p2))))))'
Support contains 9 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 40 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:24:00] [INFO ] Invariant cache hit.
[2024-06-01 20:24:03] [INFO ] Implicit Places using invariants in 2262 ms returned []
[2024-06-01 20:24:03] [INFO ] Invariant cache hit.
[2024-06-01 20:24:11] [INFO ] Implicit Places using invariants and state equation in 8572 ms returned []
Implicit Place search using SMT with State Equation took 10863 ms to find 0 implicit places.
[2024-06-01 20:24:11] [INFO ] Redundant transitions in 28 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 10943 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-14
Stuttering criterion allowed to conclude after 148 steps with 1 reset in 18 ms.
FORMULA Sudoku-PT-AN12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLFireability-14 finished in 11124 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))&&(G(p1)||F(G(p2)))))'
Support contains 8 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 28 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 20:24:12] [INFO ] Invariant cache hit.
[2024-06-01 20:24:14] [INFO ] Implicit Places using invariants in 2252 ms returned []
[2024-06-01 20:24:14] [INFO ] Invariant cache hit.
[2024-06-01 20:24:22] [INFO ] Implicit Places using invariants and state equation in 8547 ms returned []
Implicit Place search using SMT with State Equation took 10815 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 10845 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLFireability-15 finished in 11018 ms.
All properties solved by simple procedures.
Total runtime 261607 ms.
ITS solved all properties within timeout

BK_STOP 1717273463459

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

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