About the Execution of 2023-gold for Sudoku-PT-AN05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.911 | 3600000.00 | 3362371.00 | 480697.80 | FTTFF?FFFFFTFFFF | 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-171690556300378.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-AN05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556300378
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 46K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 251K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 94K Apr 12 11:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 473K Apr 12 11:31 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 38K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 59K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 224K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 12 11:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 288K Apr 12 11:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 193K Apr 12 11:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 931K Apr 12 11:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.9K 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 80K 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-AN05-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717145211939
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-AN05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 08:46:53] [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:46:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 08:46:53] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-31 08:46:53] [INFO ] Transformed 200 places.
[2024-05-31 08:46:53] [INFO ] Transformed 125 transitions.
[2024-05-31 08:46:53] [INFO ] Found NUPN structural information;
[2024-05-31 08:46:53] [INFO ] Parsed PT model containing 200 places and 125 transitions and 500 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-AN05-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN05-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 13 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2024-05-31 08:46:54] [INFO ] Computed 14 invariants in 15 ms
[2024-05-31 08:46:54] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-31 08:46:54] [INFO ] Invariant cache hit.
[2024-05-31 08:46:54] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2024-05-31 08:46:54] [INFO ] Invariant cache hit.
[2024-05-31 08:46:54] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 584 ms. Remains : 75/200 places, 125/125 transitions.
Support contains 75 out of 75 places after structural reductions.
[2024-05-31 08:46:54] [INFO ] Flatten gal took : 50 ms
[2024-05-31 08:46:54] [INFO ] Flatten gal took : 30 ms
[2024-05-31 08:46:54] [INFO ] Input system was already deterministic with 125 transitions.
Finished random walk after 23 steps, including 1 resets, run visited all 20 properties in 17 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 1 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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((F((X(p2)&&p1))&&p0)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:46:55] [INFO ] Invariant cache hit.
[2024-05-31 08:46:55] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-31 08:46:55] [INFO ] Invariant cache hit.
[2024-05-31 08:46:55] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-31 08:46:55] [INFO ] Invariant cache hit.
[2024-05-31 08:46:55] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 75/75 places, 125/125 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 390 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (OR (EQ s13 0) (EQ s36 0) (EQ s58 0)) (OR (EQ s18 0) (EQ s41 0) (EQ s58 0)) (OR (EQ s21 0) (EQ s47 0) (EQ s61 0)) (OR (EQ s3 0) (EQ s26 0) (EQ s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-00 finished in 651 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(F(p0))||G(p1))))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:46:55] [INFO ] Invariant cache hit.
[2024-05-31 08:46:56] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-31 08:46:56] [INFO ] Invariant cache hit.
[2024-05-31 08:46:56] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-31 08:46:56] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 08:46:56] [INFO ] Invariant cache hit.
[2024-05-31 08:46:56] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 191 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (EQ s13 0) (EQ s36 0) (EQ s58 0)) (OR (EQ s18 0) (EQ s41 0) (EQ s58 0)) (OR (EQ s21 0) (EQ s47 0) (EQ s61 0)) (OR (EQ s3 0) (EQ s26 0) (EQ s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4547 reset in 991 ms.
Product exploration explored 100000 steps with 4546 reset in 978 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 15 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN05-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN05-LTLFireability-02 finished in 2408 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(p1)||p0)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:46:58] [INFO ] Invariant cache hit.
[2024-05-31 08:46:58] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-31 08:46:58] [INFO ] Invariant cache hit.
[2024-05-31 08:46:58] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-31 08:46:58] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 08:46:58] [INFO ] Invariant cache hit.
[2024-05-31 08:46:58] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s13 1) (EQ s36 1) (EQ s58 1)) (AND (EQ s18 1) (EQ s41 1) (EQ s58 1)) (AND (EQ s21 1) (EQ s47 1) (EQ s61 1)) (AND (EQ s3 1) (EQ s26 1) (EQ ...], 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 20 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-04 finished in 291 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(p1))||p0) U G(!p1)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 0 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:46:58] [INFO ] Invariant cache hit.
[2024-05-31 08:46:58] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-31 08:46:58] [INFO ] Invariant cache hit.
[2024-05-31 08:46:58] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-31 08:46:58] [INFO ] Invariant cache hit.
[2024-05-31 08:46:58] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 233 ms :[p1, (NOT p1), false, (NOT p1), true, false, p1]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (EQ s13 1) (EQ s36 1) (EQ s58 1)) (AND (EQ s18 1) (EQ s41 1) (EQ s58 1)) (AND (EQ s21 1) (EQ s47 1) (EQ s61 1)) (AND (EQ s3 1) (EQ s26 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4545 reset in 1182 ms.
Product exploration explored 100000 steps with 4541 reset in 1200 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 142 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[p1, (NOT p1), false, (NOT p1), true, false, p1]
Incomplete random walk after 10000 steps, including 456 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 08:47:02] [INFO ] Invariant cache hit.
[2024-05-31 08:47:02] [INFO ] After 82ms 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 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 11 factoid took 199 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[p1, false, (NOT p1), true, false, p1]
Stuttering acceptance computed with spot in 226 ms :[p1, false, (NOT p1), true, false, p1]
[2024-05-31 08:47:03] [INFO ] Invariant cache hit.
[2024-05-31 08:47:03] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 24 ms returned sat
[2024-05-31 08:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 08:47:03] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 08:47:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 08:47:04] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 9 ms returned sat
[2024-05-31 08:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 08:47:04] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-31 08:47:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-31 08:47:04] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Could not prove EG p1
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:47:04] [INFO ] Invariant cache hit.
[2024-05-31 08:47:04] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 08:47:04] [INFO ] Invariant cache hit.
[2024-05-31 08:47:04] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-31 08:47:04] [INFO ] Invariant cache hit.
[2024-05-31 08:47:04] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 75/75 places, 125/125 transitions.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[p1, false, (NOT p1), true, false, p1]
Finished random walk after 23 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1)), (X (X p0)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 169 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[p1, false, (NOT p1), true, false, p1]
Stuttering acceptance computed with spot in 176 ms :[p1, false, (NOT p1), true, false, p1]
[2024-05-31 08:47:05] [INFO ] Invariant cache hit.
[2024-05-31 08:47:06] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 16 ms returned sat
[2024-05-31 08:47:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 08:47:06] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-31 08:47:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 08:47:06] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 10 ms returned sat
[2024-05-31 08:47:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 08:47:06] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-31 08:47:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-31 08:47:06] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 204 ms :[p1, false, (NOT p1), true, false, p1]
Product exploration explored 100000 steps with 4548 reset in 954 ms.
Product exploration explored 100000 steps with 4546 reset in 988 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 206 ms :[p1, false, (NOT p1), true, false, p1]
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:47:09] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 08:47:09] [INFO ] Invariant cache hit.
[2024-05-31 08:47:09] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 75/75 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin12280627614666959570
[2024-05-31 08:47:09] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12280627614666959570
Running compilation step : cd /tmp/ltsmin12280627614666959570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 437 ms.
Running link step : cd /tmp/ltsmin12280627614666959570;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12280627614666959570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8034847375369512802.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 0 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:47:24] [INFO ] Invariant cache hit.
[2024-05-31 08:47:24] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-31 08:47:24] [INFO ] Invariant cache hit.
[2024-05-31 08:47:24] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-31 08:47:24] [INFO ] Invariant cache hit.
[2024-05-31 08:47:24] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 75/75 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin8050795211834554869
[2024-05-31 08:47:24] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8050795211834554869
Running compilation step : cd /tmp/ltsmin8050795211834554869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 290 ms.
Running link step : cd /tmp/ltsmin8050795211834554869;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8050795211834554869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15583435504065005483.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 08:47:39] [INFO ] Flatten gal took : 10 ms
[2024-05-31 08:47:39] [INFO ] Flatten gal took : 9 ms
[2024-05-31 08:47:39] [INFO ] Time to serialize gal into /tmp/LTL3473930737926215632.gal : 3 ms
[2024-05-31 08:47:39] [INFO ] Time to serialize properties into /tmp/LTL16266684996778349328.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3473930737926215632.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14001912469306086549.hoa' '-atoms' '/tmp/LTL16266684996778349328.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16266684996778349328.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14001912469306086549.hoa
Detected timeout of ITS tools.
[2024-05-31 08:47:55] [INFO ] Flatten gal took : 11 ms
[2024-05-31 08:47:55] [INFO ] Flatten gal took : 11 ms
[2024-05-31 08:47:55] [INFO ] Time to serialize gal into /tmp/LTL17544376565920990946.gal : 3 ms
[2024-05-31 08:47:55] [INFO ] Time to serialize properties into /tmp/LTL5127351925680481597.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17544376565920990946.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5127351925680481597.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((((((((X(X("((((((((((Rows_2_3==1)&&(Cells_2_1==1))&&(Columns_1_3==1))||(((Rows_3_3==1)&&(Cells_3_1==1))&&(Columns_1_3==1)))||((((...20692
Formula 0 simplified : (!"(((((((((Rows_1_2==1)&&(Cells_1_0==1))&&(Columns_0_2==1))||(((Rows_4_2==1)&&(Cells_4_4==1))&&(Columns_4_2==1)))||((((Rows_0_4==1)...20667
Detected timeout of ITS tools.
[2024-05-31 08:48:10] [INFO ] Flatten gal took : 14 ms
[2024-05-31 08:48:10] [INFO ] Applying decomposition
[2024-05-31 08:48:10] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph685626912999750790.txt' '-o' '/tmp/graph685626912999750790.bin' '-w' '/tmp/graph685626912999750790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph685626912999750790.bin' '-l' '-1' '-v' '-w' '/tmp/graph685626912999750790.weights' '-q' '0' '-e' '0.001'
[2024-05-31 08:48:10] [INFO ] Decomposing Gal with order
[2024-05-31 08:48:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 08:48:10] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-31 08:48:10] [INFO ] Flatten gal took : 47 ms
[2024-05-31 08:48:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-31 08:48:10] [INFO ] Time to serialize gal into /tmp/LTL11459066643066538852.gal : 2 ms
[2024-05-31 08:48:10] [INFO ] Time to serialize properties into /tmp/LTL14629508651339870993.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11459066643066538852.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14629508651339870993.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((((((((((X(X("((((((((((u13.Rows_2_3==1)&&(u36.Cells_2_1==1))&&(u58.Columns_1_3==1))||(((u18.Rows_3_3==1)&&(u41.Cells_3_1==1))&&(u58...25042
Formula 0 simplified : (!"(((((((((u7.Rows_1_2==1)&&(u30.Cells_1_0==1))&&(u52.Columns_0_2==1))||(((u22.Rows_4_2==1)&&(u49.Cells_4_4==1))&&(u72.Columns_4_2=...25017
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16709296778276945404
[2024-05-31 08:48:25] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16709296778276945404
Running compilation step : cd /tmp/ltsmin16709296778276945404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 286 ms.
Running link step : cd /tmp/ltsmin16709296778276945404;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16709296778276945404;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(X((LTLAPp1==true)))||(LTLAPp0==true)) U [](!(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN05-LTLFireability-05 finished in 101822 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)&&p0)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:48:40] [INFO ] Invariant cache hit.
[2024-05-31 08:48:40] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 08:48:40] [INFO ] Invariant cache hit.
[2024-05-31 08:48:40] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-31 08:48:40] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 08:48:40] [INFO ] Invariant cache hit.
[2024-05-31 08:48:40] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s13 0) (EQ s36 0) (EQ s58 0)) (OR (EQ s18 0) (EQ s41 0) (EQ s58 0)) (OR (EQ s21 0) (EQ s47 0) (EQ s61 0)) (OR (EQ s3 0) (EQ s26 0) (EQ s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-06 finished in 315 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(G(p0))))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:48:40] [INFO ] Invariant cache hit.
[2024-05-31 08:48:40] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 08:48:40] [INFO ] Invariant cache hit.
[2024-05-31 08:48:40] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-31 08:48:40] [INFO ] Invariant cache hit.
[2024-05-31 08:48:40] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 422 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (EQ s13 1) (EQ s36 1) (EQ s58 1)) (AND (EQ s18 1) (EQ s41 1) (EQ s58 1)) (AND (EQ s21 1) (EQ s47 1) (EQ s61 1)) (AND (EQ s3 1) (EQ s26 1) (EQ ...], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-07 finished in 617 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(F((X(p1)&&p0)))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 14 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:48:41] [INFO ] Invariant cache hit.
[2024-05-31 08:48:41] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-31 08:48:41] [INFO ] Invariant cache hit.
[2024-05-31 08:48:41] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-31 08:48:41] [INFO ] Invariant cache hit.
[2024-05-31 08:48:41] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s6 1) (EQ s34 1) (EQ s71 1)), p1:(AND (EQ s19 1) (EQ s42 1) (EQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 62 steps with 10 reset in 2 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-10 finished in 452 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)))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:48:41] [INFO ] Invariant cache hit.
[2024-05-31 08:48:41] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 08:48:41] [INFO ] Invariant cache hit.
[2024-05-31 08:48:42] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-31 08:48:42] [INFO ] Invariant cache hit.
[2024-05-31 08:48:42] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s4 1) (NEQ s25 1) (NEQ s54 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 12026 reset in 1053 ms.
Product exploration explored 100000 steps with 12008 reset in 1038 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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 (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN05-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN05-LTLFireability-11 finished in 2533 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)&&F(p1))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 12 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:48:44] [INFO ] Invariant cache hit.
[2024-05-31 08:48:44] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 08:48:44] [INFO ] Invariant cache hit.
[2024-05-31 08:48:44] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-31 08:48:44] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 08:48:44] [INFO ] Invariant cache hit.
[2024-05-31 08:48:44] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 278 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s26 1) (EQ s55 1)), p1:(AND (EQ s7 1) (EQ s32 1) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-12 finished in 409 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(G((p0 U p1)))||G(p2))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:48:44] [INFO ] Invariant cache hit.
[2024-05-31 08:48:44] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 08:48:44] [INFO ] Invariant cache hit.
[2024-05-31 08:48:45] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-31 08:48:45] [INFO ] Invariant cache hit.
[2024-05-31 08:48:45] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p2:(AND (EQ s11 1) (EQ s37 1) (EQ s61 1) (OR (EQ s9 0) (EQ s34 0) (EQ s74 0))), p1:(AND (EQ s11 1) (EQ s37 1) (EQ s61 1)), p0:(AND (EQ s9 1) (EQ s34 1) (E...], 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 21 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-13 finished in 446 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(p0)||X(X(X((G(p1) U p2))))))'
Support contains 9 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:48:45] [INFO ] Invariant cache hit.
[2024-05-31 08:48:45] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 08:48:45] [INFO ] Invariant cache hit.
[2024-05-31 08:48:45] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-31 08:48:45] [INFO ] Invariant cache hit.
[2024-05-31 08:48:45] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 411 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=8 dest: 9}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=8 dest: 10}], [{ cond=(NOT p0), acceptance={} source=9 dest: 5}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 9}, { cond=(AND p0 p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (EQ s17 1) (EQ s42 1) (EQ s62 1)), p2:(AND (EQ s9 1) (EQ s32 1) (EQ s64 1)), p1:(AND (EQ s23 1) (EQ s49 1) (EQ s73 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, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 34 steps with 4 reset in 2 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-14 finished in 693 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(G(p1)))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 08:48:45] [INFO ] Invariant cache hit.
[2024-05-31 08:48:46] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-31 08:48:46] [INFO ] Invariant cache hit.
[2024-05-31 08:48:46] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-31 08:48:46] [INFO ] Invariant cache hit.
[2024-05-31 08:48:46] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(AND (EQ s7 1) (EQ s32 1) (EQ s62 1)), p0:(AND (EQ s8 1) (EQ s34 1) (EQ s73 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-15 finished in 516 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(p1))||p0) U G(!p1)))'
[2024-05-31 08:48:46] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13824070442737545514
[2024-05-31 08:48:46] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2024-05-31 08:48:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:48:46] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2024-05-31 08:48:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 08:48:46] [INFO ] Applying decomposition
[2024-05-31 08:48:46] [INFO ] Flatten gal took : 10 ms
[2024-05-31 08:48:46] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2024-05-31 08:48:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2325016534549895110.txt' '-o' '/tmp/graph2325016534549895110.bin' '-w' '/tmp/graph2325016534549895110.weights'
[2024-05-31 08:48:46] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13824070442737545514
Running compilation step : cd /tmp/ltsmin13824070442737545514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2325016534549895110.bin' '-l' '-1' '-v' '-w' '/tmp/graph2325016534549895110.weights' '-q' '0' '-e' '0.001'
[2024-05-31 08:48:46] [INFO ] Decomposing Gal with order
[2024-05-31 08:48:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 08:48:46] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-31 08:48:46] [INFO ] Flatten gal took : 18 ms
[2024-05-31 08:48:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-31 08:48:46] [INFO ] Time to serialize gal into /tmp/LTLFireability16262793922896836624.gal : 2 ms
[2024-05-31 08:48:46] [INFO ] Time to serialize properties into /tmp/LTLFireability10029367752649932431.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16262793922896836624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10029367752649932431.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !(((("(((((((((u13.Rows_2_3==1)&&(u36.Cells_2_1==1))&&(u58.Columns_1_3==1))||(((u18.Rows_3_3==1)&&(u41.Cells_3_1==1))&&(u58.Columns_1_...25038
Formula 0 simplified : (!"(((((((((u13.Rows_2_3==1)&&(u36.Cells_2_1==1))&&(u58.Columns_1_3==1))||(((u18.Rows_3_3==1)&&(u41.Cells_3_1==1))&&(u58.Columns_1_3...25015
Compilation finished in 334 ms.
Running link step : cd /tmp/ltsmin13824070442737545514;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13824070442737545514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(X((LTLAPp1==true)))||(LTLAPp0==true)) U [](!(LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: LTL layer: formula: ((X(X((LTLAPp1==true)))||(LTLAPp0==true)) U [](!(LTLAPp1==true)))
pins2lts-mc-linux64( 1/ 8), 0.006: "((X(X((LTLAPp1==true)))||(LTLAPp0==true)) U [](!(LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.031: There are 128 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.032: State length is 76, there are 141 groups
pins2lts-mc-linux64( 0/ 8), 0.032: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.032: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.032: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.032: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.105: [Blue] ~26 levels ~960 states ~9064 transitions
pins2lts-mc-linux64( 6/ 8), 0.118: [Blue] ~25 levels ~1920 states ~11504 transitions
pins2lts-mc-linux64( 6/ 8), 0.140: [Blue] ~25 levels ~3840 states ~17728 transitions
pins2lts-mc-linux64( 6/ 8), 0.183: [Blue] ~25 levels ~7680 states ~33616 transitions
pins2lts-mc-linux64( 6/ 8), 0.272: [Blue] ~25 levels ~15360 states ~68416 transitions
pins2lts-mc-linux64( 6/ 8), 0.421: [Blue] ~25 levels ~30720 states ~137416 transitions
pins2lts-mc-linux64( 6/ 8), 0.672: [Blue] ~25 levels ~61440 states ~298824 transitions
pins2lts-mc-linux64( 1/ 8), 1.122: [Blue] ~27 levels ~122880 states ~607720 transitions
pins2lts-mc-linux64( 6/ 8), 1.855: [Blue] ~27 levels ~245760 states ~1368528 transitions
pins2lts-mc-linux64( 4/ 8), 2.995: [Blue] ~26 levels ~491520 states ~2824248 transitions
pins2lts-mc-linux64( 2/ 8), 4.799: [Blue] ~27 levels ~983040 states ~5831760 transitions
pins2lts-mc-linux64( 1/ 8), 7.877: [Blue] ~28 levels ~1966080 states ~12235416 transitions
pins2lts-mc-linux64( 2/ 8), 14.028: [Blue] ~27 levels ~3932160 states ~26574744 transitions
pins2lts-mc-linux64( 4/ 8), 26.991: [Blue] ~27 levels ~7864320 states ~55295416 transitions
pins2lts-mc-linux64( 4/ 8), 52.417: [Blue] ~27 levels ~15728640 states ~114575440 transitions
pins2lts-mc-linux64( 2/ 8), 106.975: [Blue] ~27 levels ~31457280 states ~239178440 transitions
pins2lts-mc-linux64( 7/ 8), 178.108: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 178.156:
pins2lts-mc-linux64( 0/ 8), 178.156: Explored 47342503 states 381168349 transitions, fanout: 8.051
pins2lts-mc-linux64( 0/ 8), 178.156: Total exploration time 178.110 sec (178.050 sec minimum, 178.075 sec on average)
pins2lts-mc-linux64( 0/ 8), 178.156: States per second: 265805, Transitions per second: 2140073
pins2lts-mc-linux64( 0/ 8), 178.156:
pins2lts-mc-linux64( 0/ 8), 178.156: State space has 47348000 states, 6253761 are accepting
pins2lts-mc-linux64( 0/ 8), 178.156: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 178.156: blue states: 47342503 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 178.156: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 178.156: all-red states: 6253761 (13.21%), bogus 1 (0.00%)
pins2lts-mc-linux64( 0/ 8), 178.156:
pins2lts-mc-linux64( 0/ 8), 178.156: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 178.156:
pins2lts-mc-linux64( 0/ 8), 178.156: Queue width: 8B, total height: 223, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 178.156: Tree memory: 617.2MB, 13.7 B/state, compr.: 4.5%
pins2lts-mc-linux64( 0/ 8), 178.156: Tree fill ratio (roots/leafs): 35.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 178.156: Stored 125 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 178.156: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 178.156: Est. total memory use: 617.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13824070442737545514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(X((LTLAPp1==true)))||(LTLAPp0==true)) U [](!(LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13824070442737545514;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(X((LTLAPp1==true)))||(LTLAPp0==true)) U [](!(LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-31 09:09:45] [INFO ] Applying decomposition
[2024-05-31 09:09:45] [INFO ] Flatten gal took : 184 ms
[2024-05-31 09:09:46] [INFO ] Decomposing Gal with order
[2024-05-31 09:09:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:09:46] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-31 09:09:46] [INFO ] Flatten gal took : 134 ms
[2024-05-31 09:09:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2024-05-31 09:09:46] [INFO ] Time to serialize gal into /tmp/LTLFireability6883603099964748630.gal : 27 ms
[2024-05-31 09:09:46] [INFO ] Time to serialize properties into /tmp/LTLFireability14609436636669543970.ltl : 25 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6883603099964748630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14609436636669543970.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((("(((((((((u40.Rows_2_3==1)&&(u49.Cells_2_1==1))&&(u25.Columns_1_3==1))||(((u3.Rows_3_3==1)&&(u51.Cells_3_1==1))&&(u25.Columns_1_3...25053
Formula 0 simplified : (!"(((((((((u40.Rows_2_3==1)&&(u49.Cells_2_1==1))&&(u25.Columns_1_3==1))||(((u3.Rows_3_3==1)&&(u51.Cells_3_1==1))&&(u25.Columns_1_3=...25030
Detected timeout of ITS tools.
[2024-05-31 09:30:52] [INFO ] Flatten gal took : 186 ms
[2024-05-31 09:30:53] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-31 09:30:56] [INFO ] Transformed 75 places.
[2024-05-31 09:30:56] [INFO ] Transformed 125 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
java.lang.NullPointerException: Cannot read the array length because "order" is null
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.computeOrderWithGreatSPN(MultiOrderRunner.java:60)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:143)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:855)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 09:30:56] [INFO ] Time to serialize gal into /tmp/LTLFireability916205992016046231.gal : 22 ms
[2024-05-31 09:30:56] [INFO ] Time to serialize properties into /tmp/LTLFireability16697464778036117472.ltl : 26 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability916205992016046231.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16697464778036117472.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((("(((((((((Rows_2_3==1)&&(Cells_2_1==1))&&(Columns_1_3==1))||(((Rows_3_3==1)&&(Cells_3_1==1))&&(Columns_1_3==1)))||((((Rows_4_1==1...20688
Formula 0 simplified : (!"(((((((((Rows_2_3==1)&&(Cells_2_1==1))&&(Columns_1_3==1))||(((Rows_3_3==1)&&(Cells_3_1==1))&&(Columns_1_3==1)))||((((Rows_4_1==1)...20665
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 164816 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15303380 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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-AN05"
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-AN05, 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-171690556300378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN05.tgz
mv Sudoku-PT-AN05 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 ;