About the Execution of 2023-gold for Sudoku-PT-AN14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12433.012 | 354489.00 | 390812.00 | 3932.80 | TFFFTTTTTFFFFTFF | 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-171690556400423.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-AN14, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556400423
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 1.2M Apr 12 12:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Apr 12 12:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1M Apr 12 10:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 15M Apr 12 10:17 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 702K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.2M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.2M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5M Apr 12 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.0M Apr 12 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6M Apr 12 12:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22M Apr 12 12:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 98K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 237K Apr 23 08:01 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 1.5M 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-AN14-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717156473810
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-AN14
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 11:54:35] [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 11:54:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 11:54:35] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2024-05-31 11:54:35] [INFO ] Transformed 3332 places.
[2024-05-31 11:54:35] [INFO ] Transformed 2744 transitions.
[2024-05-31 11:54:35] [INFO ] Found NUPN structural information;
[2024-05-31 11:54:35] [INFO ] Parsed PT model containing 3332 places and 2744 transitions and 10976 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 181 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN14-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 588 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 57 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2024-05-31 11:54:38] [INFO ] Computed 41 invariants in 183 ms
[2024-05-31 11:54:38] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-31 11:54:38] [INFO ] Invariant cache hit.
[2024-05-31 11:54:39] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
[2024-05-31 11:54:39] [INFO ] Invariant cache hit.
[2024-05-31 11:54:41] [INFO ] Dead Transitions using invariants and state equation in 1926 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3298 ms. Remains : 588/3332 places, 2744/2744 transitions.
Support contains 588 out of 588 places after structural reductions.
[2024-05-31 11:54:42] [INFO ] Flatten gal took : 512 ms
[2024-05-31 11:54:46] [INFO ] Flatten gal took : 470 ms
[2024-05-31 11:54:49] [INFO ] Input system was already deterministic with 2744 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1736 ms. (steps per millisecond=5 ) properties (out of 25) seen :24
Interrupted Best-First random walk after 4746 steps, including 0 resets, run timeout after 5701 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 1 properties.
[2024-05-31 11:54:57] [INFO ] Invariant cache hit.
[2024-05-31 11:55:06] [INFO ] After 1839ms 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-AN14-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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' '!(X(p0))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 6 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:55:07] [INFO ] Invariant cache hit.
[2024-05-31 11:55:07] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-31 11:55:07] [INFO ] Invariant cache hit.
[2024-05-31 11:55:08] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
[2024-05-31 11:55:08] [INFO ] Invariant cache hit.
[2024-05-31 11:55:09] [INFO ] Dead Transitions using invariants and state equation in 1762 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2634 ms. Remains : 588/588 places, 2744/2744 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 181 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-00 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 s134 1) (EQ s328 1) (EQ s484 1)) (AND (EQ s113 1) (EQ s316 1) (EQ s505 1)) (AND (EQ s113 1) (EQ s320 1) (EQ s561 1)) (AND (EQ s134 1) (EQ ...], 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 timeout after 36700 steps with 18350 reset in 10001 ms.
Product exploration timeout after 37110 steps with 18555 reset in 10003 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 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-AN14-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-00 finished in 25315 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(((p1 U X((p1&&F(!p1))))||p0))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 5 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:55:32] [INFO ] Invariant cache hit.
[2024-05-31 11:55:32] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-31 11:55:32] [INFO ] Invariant cache hit.
[2024-05-31 11:55:33] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2024-05-31 11:55:33] [INFO ] Invariant cache hit.
[2024-05-31 11:55:35] [INFO ] Dead Transitions using invariants and state equation in 1832 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2664 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s134 1) (EQ s328 1) (EQ s484 1)) (AND (EQ s113 1) (EQ s316 1) (EQ s505 1)) (AND (EQ s113 1) (EQ s320 1) (EQ s561 1)) (AND (EQ s134 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 167 steps with 0 reset in 34 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-03 finished in 3178 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))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 27 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:55:35] [INFO ] Invariant cache hit.
[2024-05-31 11:55:35] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-31 11:55:35] [INFO ] Invariant cache hit.
[2024-05-31 11:55:36] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2024-05-31 11:55:36] [INFO ] Redundant transitions in 156 ms returned []
[2024-05-31 11:55:36] [INFO ] Invariant cache hit.
[2024-05-31 11:55:38] [INFO ] Dead Transitions using invariants and state equation in 1835 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2861 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s134 0) (EQ s328 0) (EQ s484 0)) (OR (EQ s113 0) (EQ s316 0) (EQ s505 0)) (OR (EQ s113 0) (EQ s320 0) (EQ s561 0)) (OR (EQ s134 0) (EQ s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 58840 steps with 341 reset in 10001 ms.
Product exploration timeout after 57580 steps with 334 reset in 10003 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN14-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-04 finished in 23673 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))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 23 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:55:59] [INFO ] Invariant cache hit.
[2024-05-31 11:55:59] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-31 11:55:59] [INFO ] Invariant cache hit.
[2024-05-31 11:56:00] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
[2024-05-31 11:56:00] [INFO ] Redundant transitions in 137 ms returned []
[2024-05-31 11:56:00] [INFO ] Invariant cache hit.
[2024-05-31 11:56:02] [INFO ] Dead Transitions using invariants and state equation in 1832 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2855 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 39 ms :[p0]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s134 1) (EQ s328 1) (EQ s484 1)) (AND (EQ s113 1) (EQ s316 1) (EQ s505 1)) (AND (EQ s113 1) (EQ s320 1) (EQ s561 1)) (AND (EQ s134 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 58470 steps with 339 reset in 10004 ms.
Product exploration timeout after 58360 steps with 338 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN14-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-05 finished in 25379 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)||G(p1))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 17 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:56:24] [INFO ] Invariant cache hit.
[2024-05-31 11:56:24] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-31 11:56:24] [INFO ] Invariant cache hit.
[2024-05-31 11:56:25] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
[2024-05-31 11:56:25] [INFO ] Redundant transitions in 52 ms returned []
[2024-05-31 11:56:25] [INFO ] Invariant cache hit.
[2024-05-31 11:56:27] [INFO ] Dead Transitions using invariants and state equation in 1805 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2733 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (NEQ s134 1) (NEQ s328 1) (NEQ s484 1)) (OR (NEQ s113 1) (NEQ s316 1) (NEQ s505 1)) (OR (NEQ s113 1) (NEQ s320 1) (NEQ s561 1)) (OR (NEQ s134 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 48740 steps with 282 reset in 10001 ms.
Product exploration timeout after 48630 steps with 282 reset in 10004 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN14-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-06 finished in 25411 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 3 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 167 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:56:50] [INFO ] Invariant cache hit.
[2024-05-31 11:56:53] [INFO ] Implicit Places using invariants in 2978 ms returned []
[2024-05-31 11:56:53] [INFO ] Invariant cache hit.
[2024-05-31 11:57:13] [INFO ] Implicit Places using invariants and state equation in 20544 ms returned []
Implicit Place search using SMT with State Equation took 23528 ms to find 0 implicit places.
[2024-05-31 11:57:13] [INFO ] Redundant transitions in 55 ms returned []
[2024-05-31 11:57:13] [INFO ] Invariant cache hit.
[2024-05-31 11:57:15] [INFO ] Dead Transitions using invariants and state equation in 1745 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25509 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-08 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 (NEQ s84 1) (NEQ s282 1) (NEQ s420 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 59890 steps with 347 reset in 10001 ms.
Product exploration timeout after 59410 steps with 344 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN14-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-08 finished in 46159 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) U X(((X(p2)&&p1) U p2)))))'
Support contains 6 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 101 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:57:36] [INFO ] Invariant cache hit.
[2024-05-31 11:57:39] [INFO ] Implicit Places using invariants in 3006 ms returned []
[2024-05-31 11:57:39] [INFO ] Invariant cache hit.
[2024-05-31 11:57:52] [INFO ] Implicit Places using invariants and state equation in 12748 ms returned []
Implicit Place search using SMT with State Equation took 15759 ms to find 0 implicit places.
[2024-05-31 11:57:52] [INFO ] Invariant cache hit.
[2024-05-31 11:57:53] [INFO ] Dead Transitions using invariants and state equation in 1795 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17658 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p2) p1), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=7 dest: 6}]], initial=0, aps=[p0:(AND (EQ s153 1) (EQ s341 1) (EQ s475 1)), p2:(AND (EQ s30 1) (EQ s227 1) (EQ s436 1)), p1:(AND (EQ s153 1) (EQ s341 1) (EQ s475 1))], 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, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 120 steps with 34 reset in 49 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-09 finished in 18027 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||G((p1 U p2))))))'
Support contains 9 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 78 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:57:54] [INFO ] Invariant cache hit.
[2024-05-31 11:57:57] [INFO ] Implicit Places using invariants in 3089 ms returned []
[2024-05-31 11:57:57] [INFO ] Invariant cache hit.
[2024-05-31 11:58:14] [INFO ] Implicit Places using invariants and state equation in 17065 ms returned []
Implicit Place search using SMT with State Equation took 20157 ms to find 0 implicit places.
[2024-05-31 11:58:14] [INFO ] Redundant transitions in 59 ms returned []
[2024-05-31 11:58:14] [INFO ] Invariant cache hit.
[2024-05-31 11:58:16] [INFO ] Dead Transitions using invariants and state equation in 1781 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22087 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s112 1) (EQ s315 1) (EQ s490 1)), p2:(AND (EQ s55 1) (EQ s247 1) (EQ s531 1)), p1:(AND (EQ s48 1) (EQ s248 1) (EQ s538 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 175 steps with 0 reset in 30 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-10 finished in 22502 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(X((p0&&G(p1)&&F(p2)))))'
Support contains 12 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 62 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:58:16] [INFO ] Invariant cache hit.
[2024-05-31 11:58:19] [INFO ] Implicit Places using invariants in 2970 ms returned []
[2024-05-31 11:58:19] [INFO ] Invariant cache hit.
[2024-05-31 11:58:32] [INFO ] Implicit Places using invariants and state equation in 12678 ms returned []
Implicit Place search using SMT with State Equation took 15650 ms to find 0 implicit places.
[2024-05-31 11:58:32] [INFO ] Invariant cache hit.
[2024-05-31 11:58:34] [INFO ] Dead Transitions using invariants and state equation in 1815 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17530 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(OR (EQ s195 0) (EQ s383 0) (EQ s475 0)), p2:(OR (EQ s149 0) (EQ s340 0) (EQ s457 0)), p0:(OR (AND (EQ s132 1) (EQ s323 1) (EQ s412 1)) (AND (EQ s143 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-11 finished in 17767 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((F(p0)||X(F(p1)))))'
Support contains 6 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 62 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:58:34] [INFO ] Invariant cache hit.
[2024-05-31 11:58:37] [INFO ] Implicit Places using invariants in 3098 ms returned []
[2024-05-31 11:58:37] [INFO ] Invariant cache hit.
[2024-05-31 11:58:56] [INFO ] Implicit Places using invariants and state equation in 18464 ms returned []
Implicit Place search using SMT with State Equation took 21570 ms to find 0 implicit places.
[2024-05-31 11:58:56] [INFO ] Invariant cache hit.
[2024-05-31 11:58:57] [INFO ] Dead Transitions using invariants and state equation in 1695 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23331 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s146 1) (EQ s339 1) (EQ s440 1)), p1:(AND (EQ s37 1) (EQ s230 1) (EQ s485 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, null][false, false, false]]
Stuttering criterion allowed to conclude after 12381 steps with 6062 reset in 3370 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-12 finished in 26848 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((X(F(p0))&&G(p1))))'
Support contains 6 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 63 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:59:01] [INFO ] Invariant cache hit.
[2024-05-31 11:59:04] [INFO ] Implicit Places using invariants in 3074 ms returned []
[2024-05-31 11:59:04] [INFO ] Invariant cache hit.
[2024-05-31 11:59:22] [INFO ] Implicit Places using invariants and state equation in 17640 ms returned []
Implicit Place search using SMT with State Equation took 20716 ms to find 0 implicit places.
[2024-05-31 11:59:22] [INFO ] Invariant cache hit.
[2024-05-31 11:59:24] [INFO ] Dead Transitions using invariants and state equation in 1818 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22600 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s163 0) (EQ s357 0) (EQ s499 0)), p0:(OR (EQ s17 0) (EQ s214 0) (EQ s451 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 50060 steps with 393 reset in 10003 ms.
Product exploration timeout after 48900 steps with 396 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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) (NOT p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1)]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN14-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-13 finished in 43337 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&&F(p1)))))'
Support contains 6 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 58 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:59:44] [INFO ] Invariant cache hit.
[2024-05-31 11:59:47] [INFO ] Implicit Places using invariants in 2975 ms returned []
[2024-05-31 11:59:47] [INFO ] Invariant cache hit.
[2024-05-31 12:00:02] [INFO ] Implicit Places using invariants and state equation in 14693 ms returned []
Implicit Place search using SMT with State Equation took 17669 ms to find 0 implicit places.
[2024-05-31 12:00:02] [INFO ] Invariant cache hit.
[2024-05-31 12:00:04] [INFO ] Dead Transitions using invariants and state equation in 1801 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19534 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s235 0) (EQ s554 0)), p1:(AND (EQ s38 1) (EQ s233 1) (EQ s528 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-14 finished in 19696 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&&(p1||G(p2)||X(G(p3))))))'
Support contains 12 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 57 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 12:00:04] [INFO ] Invariant cache hit.
[2024-05-31 12:00:07] [INFO ] Implicit Places using invariants in 2962 ms returned []
[2024-05-31 12:00:07] [INFO ] Invariant cache hit.
[2024-05-31 12:00:24] [INFO ] Implicit Places using invariants and state equation in 16842 ms returned []
Implicit Place search using SMT with State Equation took 19805 ms to find 0 implicit places.
[2024-05-31 12:00:24] [INFO ] Invariant cache hit.
[2024-05-31 12:00:26] [INFO ] Dead Transitions using invariants and state equation in 1786 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21649 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2)), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-15 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=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 0}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 3}, { cond=(AND p2 p3), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(OR (EQ s69 0) (EQ s262 0) (EQ s545 0)), p1:(AND (EQ s180 1) (EQ s374 1) (EQ s544 1)), p2:(OR (EQ s119 0) (EQ s318 0) (EQ s539 0)), p3:(OR (EQ s166 0) ...], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-15 finished in 21877 ms.
All properties solved by simple procedures.
Total runtime 350836 ms.
BK_STOP 1717156828299
--------------------
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-AN14"
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-AN14, 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-171690556400423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN14.tgz
mv Sudoku-PT-AN14 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 ;