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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 127K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 649K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 208K Apr 12 10:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 1009K Apr 12 10:44 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 40K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 101K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 368K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 202K Apr 12 11:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1001K Apr 12 11:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 335K Apr 12 10:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.1K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K 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 132K 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-AN06-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717269104076

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-AN06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:11:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 19:11:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:11:45] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-01 19:11:45] [INFO ] Transformed 324 places.
[2024-06-01 19:11:45] [INFO ] Transformed 216 transitions.
[2024-06-01 19:11:45] [INFO ] Found NUPN structural information;
[2024-06-01 19:11:45] [INFO ] Parsed PT model containing 324 places and 216 transitions and 864 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-AN06-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 108 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 26 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-06-01 19:11:45] [INFO ] Computed 17 invariants in 24 ms
[2024-06-01 19:11:46] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-01 19:11:46] [INFO ] Invariant cache hit.
[2024-06-01 19:11:46] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 325 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 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 369 ms. Remains : 108/324 places, 216/216 transitions.
Support contains 108 out of 108 places after structural reductions.
[2024-06-01 19:11:46] [INFO ] Flatten gal took : 73 ms
[2024-06-01 19:11:46] [INFO ] Flatten gal took : 61 ms
[2024-06-01 19:11:47] [INFO ] Input system was already deterministic with 216 transitions.
Reduction of identical properties reduced properties to check from 22 to 18
RANDOM walk for 40000 steps (1274 resets) in 1458 ms. (27 steps per ms) remains 1/18 properties
BEST_FIRST walk for 40004 steps (20 resets) in 3028 ms. (13 steps per ms) remains 1/1 properties
[2024-06-01 19:11:48] [INFO ] Invariant cache hit.
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 108/324 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 81 ms.
Refiners :[Domain max(s): 0/108 constraints, Generalized P Invariants (flows): 0/17 constraints, State Equation: 0/108 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 425ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Sudoku-PT-AN06-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-AN06-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA Sudoku-PT-AN06-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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(p0)||F(p1))))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:11:49] [INFO ] Invariant cache hit.
[2024-06-01 19:11:49] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 19:11:49] [INFO ] Invariant cache hit.
[2024-06-01 19:11:49] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 151 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 153 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 1974 ms.
Product exploration explored 100000 steps with 50000 reset in 1863 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 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-PT-AN06-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN06-LTLFireability-02 finished in 4598 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(G((F(p0)||p1))))))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:11:53] [INFO ] Invariant cache hit.
[2024-06-01 19:11:53] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 19:11:53] [INFO ] Invariant cache hit.
[2024-06-01 19:11:53] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-06-01 19:11:53] [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 165 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-03
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLFireability-03 finished in 281 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(X(F(p0))))))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:11:53] [INFO ] Invariant cache hit.
[2024-06-01 19:11:54] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 19:11:54] [INFO ] Invariant cache hit.
[2024-06-01 19:11:54] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 131 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 134 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-04
Product exploration explored 100000 steps with 20000 reset in 2679 ms.
Product exploration explored 100000 steps with 20000 reset in 2730 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 97 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 119 steps (0 resets) in 9 ms. (11 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 80 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:12:00] [INFO ] Invariant cache hit.
[2024-06-01 19:12:00] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 19:12:00] [INFO ] Invariant cache hit.
[2024-06-01 19:12:00] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 132 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 134 ms. Remains : 108/108 places, 216/216 transitions.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 73 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 121 steps (0 resets) in 9 ms. (12 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 87 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 2559 ms.
Product exploration explored 100000 steps with 20000 reset in 2521 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:12:07] [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 20 ms. Remains : 108/108 places, 216/216 transitions.
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:12:07] [INFO ] Invariant cache hit.
[2024-06-01 19:12:07] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 19:12:07] [INFO ] Invariant cache hit.
[2024-06-01 19:12:07] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 137 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 138 ms. Remains : 108/108 places, 216/216 transitions.
Treatment of property Sudoku-PT-AN06-LTLFireability-04 finished in 13569 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(X(G((p0 U X(p1)))))) U X(p1))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 18 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:12:07] [INFO ] Invariant cache hit.
[2024-06-01 19:12:07] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-01 19:12:07] [INFO ] Invariant cache hit.
[2024-06-01 19:12:07] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 367 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 385 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-08
Entered a terminal (fully accepting) state of product in 17 steps with 1 reset in 2 ms.
FORMULA Sudoku-PT-AN06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLFireability-08 finished in 726 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(!p0) U p1)))&&G(X(p0))))&&X(p1)))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 17 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:12:08] [INFO ] Invariant cache hit.
[2024-06-01 19:12:08] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-01 19:12:08] [INFO ] Invariant cache hit.
[2024-06-01 19:12:08] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 360 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 378 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-09
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLFireability-09 finished in 604 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(p0)||(p1 U X(X(X((p2||F(p3))))))))'
Support contains 9 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 12 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:12:08] [INFO ] Invariant cache hit.
[2024-06-01 19:12:09] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 19:12:09] [INFO ] Invariant cache hit.
[2024-06-01 19:12:09] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 381 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 394 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 882 ms :[(NOT p3), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-10
Stuttering criterion allowed to conclude after 144 steps with 28 reset in 5 ms.
FORMULA Sudoku-PT-AN06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLFireability-10 finished in 1306 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(((!p1 U (p2||G(!p1)))||p0)))'
Support contains 9 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:12:10] [INFO ] Invariant cache hit.
[2024-06-01 19:12:10] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-01 19:12:10] [INFO ] Invariant cache hit.
[2024-06-01 19:12:10] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-06-01 19:12:10] [INFO ] Redundant transitions in 7 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 379 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-12
Product exploration explored 100000 steps with 11507 reset in 2371 ms.
Product exploration explored 100000 steps with 11417 reset in 2437 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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) p1), (X (NOT p2)), (F (G p0)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (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 5 factoid took 12 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN06-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN06-LTLFireability-12 finished in 5391 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 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:12:15] [INFO ] Invariant cache hit.
[2024-06-01 19:12:15] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 19:12:15] [INFO ] Invariant cache hit.
[2024-06-01 19:12:15] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-06-01 19:12:15] [INFO ] Redundant transitions in 4 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 402 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-13
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLFireability-13 finished in 450 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(G((G(p0)||X((!p1 U (p2||G(!p1)))))))))'
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:12:16] [INFO ] Invariant cache hit.
[2024-06-01 19:12:16] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 19:12:16] [INFO ] Invariant cache hit.
[2024-06-01 19:12:16] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 369 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 371 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-15
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLFireability-15 finished in 665 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(X(F(p0))))))'
Found a Shortening insensitive property : Sudoku-PT-AN06-LTLFireability-04
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:12:16] [INFO ] Invariant cache hit.
[2024-06-01 19:12:17] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 19:12:17] [INFO ] Invariant cache hit.
[2024-06-01 19:12:17] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 128 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 132 ms. Remains : 108/108 places, 216/216 transitions.
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-04
Product exploration explored 100000 steps with 20000 reset in 2644 ms.
Product exploration explored 100000 steps with 20000 reset in 2655 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 80 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 122 steps (0 resets) in 10 ms. (11 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 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:12:23] [INFO ] Invariant cache hit.
[2024-06-01 19:12:23] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 19:12:23] [INFO ] Invariant cache hit.
[2024-06-01 19:12:23] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 128 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 131 ms. Remains : 108/108 places, 216/216 transitions.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 114 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 120 steps (0 resets) in 5 ms. (20 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 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 2635 ms.
Product exploration explored 100000 steps with 20000 reset in 2659 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:12:30] [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 : 108/108 places, 216/216 transitions.
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 0 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 19:12:30] [INFO ] Invariant cache hit.
[2024-06-01 19:12:30] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 19:12:30] [INFO ] Invariant cache hit.
[2024-06-01 19:12:30] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 153 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 155 ms. Remains : 108/108 places, 216/216 transitions.
Treatment of property Sudoku-PT-AN06-LTLFireability-04 finished in 13891 ms.
[2024-06-01 19:12:30] [INFO ] Flatten gal took : 18 ms
[2024-06-01 19:12:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-06-01 19:12:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 216 transitions and 648 arcs took 4 ms.
Total runtime 45349 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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

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