About the Execution of 2023-gold for Sudoku-PT-AN04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 423.451 | 18732.00 | 23133.00 | 1123.10 | TTFTTFFTFFTFFFTF | normal |
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.r417-tall-171690556300373.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 gold2023
Input is Sudoku-PT-AN04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556300373
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 40K Apr 12 11:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 229K Apr 12 11:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 78K Apr 12 11:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 400K Apr 12 11:20 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 22K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 33K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 55K Apr 12 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 305K Apr 12 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 134K Apr 12 11:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 667K Apr 12 11:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K 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 44K 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-AN04-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN04-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN04-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN04-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN04-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN04-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN04-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN04-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN04-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN04-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN04-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN04-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN04-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN04-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN04-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN04-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717145141063
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 08:45:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 08:45:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 08:45:42] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2024-05-31 08:45:42] [INFO ] Transformed 112 places.
[2024-05-31 08:45:42] [INFO ] Transformed 64 transitions.
[2024-05-31 08:45:42] [INFO ] Found NUPN structural information;
[2024-05-31 08:45:42] [INFO ] Parsed PT model containing 112 places and 64 transitions and 256 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 70 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-31 08:45:43] [INFO ] Computed 11 invariants in 14 ms
[2024-05-31 08:45:43] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-31 08:45:43] [INFO ] Invariant cache hit.
[2024-05-31 08:45:43] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-31 08:45:43] [INFO ] Invariant cache hit.
[2024-05-31 08:45:43] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 48/112 places, 64/64 transitions.
Support contains 48 out of 48 places after structural reductions.
[2024-05-31 08:45:43] [INFO ] Flatten gal took : 33 ms
[2024-05-31 08:45:43] [INFO ] Flatten gal took : 33 ms
[2024-05-31 08:45:43] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 693 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 08:45:44] [INFO ] Invariant cache hit.
[2024-05-31 08:45:44] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-AN04-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F((G((p2||X(p2)))||p1))&&X(p0))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:44] [INFO ] Invariant cache hit.
[2024-05-31 08:45:44] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 08:45:44] [INFO ] Invariant cache hit.
[2024-05-31 08:45:44] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-31 08:45:44] [INFO ] Invariant cache hit.
[2024-05-31 08:45:45] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 272 ms. Remains : 48/48 places, 64/64 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s1 1) (EQ s17 1) (EQ s37 1)) (AND (EQ s10 1) (EQ s26 1) (EQ s42 1)) (AND (EQ s12 1) (EQ s31 1) (EQ s44 1)) (AND (EQ s9 1) (EQ s24 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 570 ms.
Product exploration explored 100000 steps with 50000 reset in 513 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 653 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-00 finished in 2472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:47] [INFO ] Invariant cache hit.
[2024-05-31 08:45:47] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-31 08:45:47] [INFO ] Invariant cache hit.
[2024-05-31 08:45:47] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-31 08:45:47] [INFO ] Invariant cache hit.
[2024-05-31 08:45:47] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s1 1) (EQ s17 1) (EQ s37 1)) (AND (EQ s10 1) (EQ s26 1) (EQ s42 1)) (AND (EQ s12 1) (EQ s31 1) (EQ s44 1)) (AND (EQ s9 1) (EQ s24 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 436 ms.
Product exploration explored 100000 steps with 50000 reset in 451 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN04-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-01 finished in 1215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:48] [INFO ] Invariant cache hit.
[2024-05-31 08:45:48] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-31 08:45:48] [INFO ] Invariant cache hit.
[2024-05-31 08:45:48] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-31 08:45:48] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 08:45:48] [INFO ] Invariant cache hit.
[2024-05-31 08:45:48] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s1 1) (EQ s17 1) (EQ s37 1)) (AND (EQ s10 1) (EQ s26 1) (EQ s42 1)) (AND (EQ s12 1) (EQ s31 1) (EQ s44 1)) (AND (EQ s9 1) (EQ s24 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-02 finished in 234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:48] [INFO ] Invariant cache hit.
[2024-05-31 08:45:48] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-31 08:45:48] [INFO ] Invariant cache hit.
[2024-05-31 08:45:48] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-31 08:45:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 08:45:48] [INFO ] Invariant cache hit.
[2024-05-31 08:45:48] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s1 0) (EQ s17 0) (EQ s37 0)) (OR (EQ s10 0) (EQ s26 0) (EQ s42 0)) (OR (EQ s12 0) (EQ s31 0) (EQ s44 0)) (OR (EQ s9 0) (EQ s24 0) (EQ s33 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6958 reset in 499 ms.
Product exploration explored 100000 steps with 6961 reset in 460 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 1698 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-PT-AN04-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-03 finished in 2929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:51] [INFO ] Invariant cache hit.
[2024-05-31 08:45:51] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-31 08:45:51] [INFO ] Invariant cache hit.
[2024-05-31 08:45:51] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-31 08:45:51] [INFO ] Invariant cache hit.
[2024-05-31 08:45:51] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s1 1) (EQ s17 1) (EQ s37 1)) (AND (EQ s10 1) (EQ s26 1) (EQ s42 1)) (AND (EQ s12 1) (EQ s31 1) (EQ s44 1)) (AND (EQ s9 1) (EQ s24 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 467 ms.
Product exploration explored 100000 steps with 50000 reset in 456 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 22 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN04-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-04 finished in 1286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:52] [INFO ] Invariant cache hit.
[2024-05-31 08:45:52] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-31 08:45:52] [INFO ] Invariant cache hit.
[2024-05-31 08:45:52] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-31 08:45:52] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 08:45:52] [INFO ] Invariant cache hit.
[2024-05-31 08:45:52] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s1 1) (EQ s17 1) (EQ s37 1)) (AND (EQ s10 1) (EQ s26 1) (EQ s42 1)) (AND (EQ s12 1) (EQ s31 1) (EQ s44 1)) (AND (EQ s9 1) (EQ s24 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-05 finished in 187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:53] [INFO ] Invariant cache hit.
[2024-05-31 08:45:53] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 08:45:53] [INFO ] Invariant cache hit.
[2024-05-31 08:45:53] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-31 08:45:53] [INFO ] Invariant cache hit.
[2024-05-31 08:45:53] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s1 1) (EQ s17 1) (EQ s37 1)) (AND (EQ s10 1) (EQ s26 1) (EQ s42 1)) (AND (EQ s12 1) (EQ s31 1) (EQ s44 1)) (AND (EQ s9 1) (EQ s24 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-06 finished in 232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)||p0))||F((X(p1)&&F(p2)))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:53] [INFO ] Invariant cache hit.
[2024-05-31 08:45:53] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-31 08:45:53] [INFO ] Invariant cache hit.
[2024-05-31 08:45:53] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-31 08:45:53] [INFO ] Invariant cache hit.
[2024-05-31 08:45:53] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (NOT p1), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (OR (EQ s1 0) (EQ s17 0) (EQ s37 0)) (OR (EQ s10 0) (EQ s26 0) (EQ s42 0)) (OR (EQ s12 0) (EQ s31 0) (EQ s44 0)) (OR (EQ s9 0) (EQ s24 0) (EQ s33 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 450 ms.
Product exploration explored 100000 steps with 50000 reset in 473 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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 p2) p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 21 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN04-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-07 finished in 1443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:54] [INFO ] Invariant cache hit.
[2024-05-31 08:45:54] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 08:45:54] [INFO ] Invariant cache hit.
[2024-05-31 08:45:54] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-31 08:45:54] [INFO ] Invariant cache hit.
[2024-05-31 08:45:54] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s11 1) (EQ s25 1) (EQ s39 1)), p1:(AND (EQ s10 1) (EQ s24 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-09 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(p0 U !p1)||F(X(p0)))))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:55] [INFO ] Invariant cache hit.
[2024-05-31 08:45:55] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-31 08:45:55] [INFO ] Invariant cache hit.
[2024-05-31 08:45:55] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-31 08:45:55] [INFO ] Invariant cache hit.
[2024-05-31 08:45:55] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s22 1) (EQ s40 1)), p1:(AND (EQ s13 1) (EQ s31 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 441 ms.
Product exploration explored 100000 steps with 50000 reset in 465 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 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-PT-AN04-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLFireability-10 finished in 1238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(G(p1)) U (F(p3)&&p2))))))'
Support contains 9 out of 48 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:56] [INFO ] Invariant cache hit.
[2024-05-31 08:45:56] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 08:45:56] [INFO ] Invariant cache hit.
[2024-05-31 08:45:56] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-31 08:45:56] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 08:45:56] [INFO ] Invariant cache hit.
[2024-05-31 08:45:56] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s30 1) (EQ s41 1)), p3:(AND (EQ s4 1) (EQ s23 1) (EQ s44 1)), p2:(AND (EQ s7 1) (EQ s20 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-11 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(!p1)||G(p1)))))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:56] [INFO ] Invariant cache hit.
[2024-05-31 08:45:56] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 08:45:56] [INFO ] Invariant cache hit.
[2024-05-31 08:45:56] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-31 08:45:56] [INFO ] Invariant cache hit.
[2024-05-31 08:45:56] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 183 ms :[false, false, p1, (NOT p1), true]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s23 1) (EQ s44 1)), p0:(AND (EQ s14 1) (EQ s29 1) (EQ s38 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 1 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-12 finished in 377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p1)||p0))))'
Support contains 9 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 08:45:57] [INFO ] Invariant cache hit.
[2024-05-31 08:45:57] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-31 08:45:57] [INFO ] Invariant cache hit.
[2024-05-31 08:45:57] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-31 08:45:57] [INFO ] Invariant cache hit.
[2024-05-31 08:45:57] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (EQ s7 1) (EQ s21 1) (EQ s39 1)) (AND (EQ s13 1) (EQ s30 1) (EQ s41 1))), p1:(OR (AND (EQ s11 1) (EQ s27 1) (EQ s47 1)) (AND (EQ s7 1) (EQ s21...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLFireability-13 finished in 304 ms.
All properties solved by simple procedures.
Total runtime 14838 ms.
BK_STOP 1717145159795
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is Sudoku-PT-AN04, 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 r417-tall-171690556300373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN04.tgz
mv Sudoku-PT-AN04 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 '
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 ;