About the Execution of 2023-gold for Sudoku-PT-AN06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6924.968 | 587432.00 | 1911196.00 | 4343.00 | TFTFTFFTFFFTTFFF | 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-171690556300383.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-AN06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556300383
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 127K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 649K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 208K Apr 12 10:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 1009K Apr 12 10:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 40K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 101K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 368K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 202K Apr 12 11:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1001K Apr 12 11:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 335K Apr 12 10:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.1K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 132K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717147053596
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-AN06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 09:17: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 09:17:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 09:17:35] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-05-31 09:17:35] [INFO ] Transformed 324 places.
[2024-05-31 09:17:35] [INFO ] Transformed 216 transitions.
[2024-05-31 09:17:35] [INFO ] Found NUPN structural information;
[2024-05-31 09:17:35] [INFO ] Parsed PT model containing 324 places and 216 transitions and 864 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-AN06-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 108 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 13 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-05-31 09:17:35] [INFO ] Computed 17 invariants in 24 ms
[2024-05-31 09:17:35] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-31 09:17:35] [INFO ] Invariant cache hit.
[2024-05-31 09:17:35] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-31 09:17:35] [INFO ] Invariant cache hit.
[2024-05-31 09:17:36] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 108/324 places, 216/216 transitions.
Support contains 108 out of 108 places after structural reductions.
[2024-05-31 09:17:36] [INFO ] Flatten gal took : 61 ms
[2024-05-31 09:17:36] [INFO ] Flatten gal took : 44 ms
[2024-05-31 09:17:36] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 318 resets, run finished after 961 ms. (steps per millisecond=10 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 690 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 09:17:38] [INFO ] Invariant cache hit.
[2024-05-31 09:17:38] [INFO ] After 57ms 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.
FORMULA Sudoku-PT-AN06-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-AN06-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA Sudoku-PT-AN06-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||F(p1))))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:17:39] [INFO ] Invariant cache hit.
[2024-05-31 09:17:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 09:17:39] [INFO ] Invariant cache hit.
[2024-05-31 09:17:39] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-31 09:17:39] [INFO ] Invariant cache hit.
[2024-05-31 09:17:39] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 401 ms. Remains : 108/108 places, 216/216 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 305 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (EQ s12 1) (EQ s49 1) (EQ s78 1)) (AND (EQ s13 1) (EQ s53 1) (EQ s103 1)) (AND (EQ s28 1) (EQ s64 1) (EQ s100 1)) (AND (EQ s27 1) (EQ s60 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1873 ms.
Product exploration explored 100000 steps with 50000 reset in 1809 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 27 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN06-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN06-LTLFireability-02 finished in 4692 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(G((F(p0)||p1))))))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 11 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:17:43] [INFO ] Invariant cache hit.
[2024-05-31 09:17:43] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-31 09:17:43] [INFO ] Invariant cache hit.
[2024-05-31 09:17:44] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-31 09:17:44] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-31 09:17:44] [INFO ] Invariant cache hit.
[2024-05-31 09:17:44] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s12 1) (EQ s49 1) (EQ s78 1)) (AND (EQ s13 1) (EQ s53 1) (EQ s103 1)) (AND (EQ s28 1) (EQ s64 1) (EQ s100 1)) (AND (EQ s27 1) (EQ s60 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLFireability-03 finished in 425 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(X(X(F(p0))))))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:17:44] [INFO ] Invariant cache hit.
[2024-05-31 09:17:44] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-31 09:17:44] [INFO ] Invariant cache hit.
[2024-05-31 09:17:44] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-31 09:17:44] [INFO ] Invariant cache hit.
[2024-05-31 09:17:44] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (AND (EQ s12 1) (EQ s49 1) (EQ s78 1)) (AND (EQ s13 1) (EQ s53 1) (EQ s103 1)) (AND (EQ s28 1) (EQ s64 1) (EQ s100 1)) (AND (EQ s27 1) (EQ s60 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 2563 ms.
Product exploration explored 100000 steps with 20000 reset in 2614 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:17:50] [INFO ] Invariant cache hit.
[2024-05-31 09:17:50] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-31 09:17:50] [INFO ] Invariant cache hit.
[2024-05-31 09:17:51] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-31 09:17:51] [INFO ] Invariant cache hit.
[2024-05-31 09:17:51] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 108/108 places, 216/216 transitions.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 2462 ms.
Product exploration explored 100000 steps with 20000 reset in 2491 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:17:57] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 09:17:57] [INFO ] Invariant cache hit.
[2024-05-31 09:17:57] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 108/108 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin8880563824567178680
[2024-05-31 09:17:58] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8880563824567178680
Running compilation step : cd /tmp/ltsmin8880563824567178680;'/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 537 ms.
Running link step : cd /tmp/ltsmin8880563824567178680;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8880563824567178680;'/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/stateBased3296184164226421206.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:18:13] [INFO ] Invariant cache hit.
[2024-05-31 09:18:13] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-31 09:18:13] [INFO ] Invariant cache hit.
[2024-05-31 09:18:13] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-31 09:18:13] [INFO ] Invariant cache hit.
[2024-05-31 09:18:13] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 108/108 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin11589275787941290038
[2024-05-31 09:18:13] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11589275787941290038
Running compilation step : cd /tmp/ltsmin11589275787941290038;'/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 405 ms.
Running link step : cd /tmp/ltsmin11589275787941290038;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11589275787941290038;'/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/stateBased5867099612199094846.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 09:18:29] [INFO ] Flatten gal took : 17 ms
[2024-05-31 09:18:29] [INFO ] Flatten gal took : 16 ms
[2024-05-31 09:18:29] [INFO ] Time to serialize gal into /tmp/LTL5300617826845880210.gal : 4 ms
[2024-05-31 09:18:29] [INFO ] Time to serialize properties into /tmp/LTL17240145925205460903.prop : 2 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/LTL5300617826845880210.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8428798590090026232.hoa' '-atoms' '/tmp/LTL17240145925205460903.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...318
Loading property file /tmp/LTL17240145925205460903.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8428798590090026232.hoa
Detected timeout of ITS tools.
[2024-05-31 09:18:44] [INFO ] Flatten gal took : 15 ms
[2024-05-31 09:18:44] [INFO ] Flatten gal took : 15 ms
[2024-05-31 09:18:44] [INFO ] Time to serialize gal into /tmp/LTL11114607855629114048.gal : 2 ms
[2024-05-31 09:18:44] [INFO ] Time to serialize properties into /tmp/LTL16860896845556618028.ltl : 4 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/LTL11114607855629114048.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16860896845556618028.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("(((((((((((Rows_2_0==1)&&(Cells_2_1==1))&&(Columns_1_0==1))||(((Rows_2_1==1)&&(Cells_2_5==1))&&(Columns_5_1==1)))||((((R...11919
Formula 0 simplified : XXXXG!"(((((((((((Rows_2_0==1)&&(Cells_2_1==1))&&(Columns_1_0==1))||(((Rows_2_1==1)&&(Cells_2_5==1))&&(Columns_5_1==1)))||((((Rows_4...11907
Detected timeout of ITS tools.
[2024-05-31 09:18:59] [INFO ] Flatten gal took : 14 ms
[2024-05-31 09:18:59] [INFO ] Applying decomposition
[2024-05-31 09:18:59] [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/graph14552255931086047271.txt' '-o' '/tmp/graph14552255931086047271.bin' '-w' '/tmp/graph14552255931086047271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14552255931086047271.bin' '-l' '-1' '-v' '-w' '/tmp/graph14552255931086047271.weights' '-q' '0' '-e' '0.001'
[2024-05-31 09:18:59] [INFO ] Decomposing Gal with order
[2024-05-31 09:18:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:18:59] [INFO ] Removed a total of 540 redundant transitions.
[2024-05-31 09:18:59] [INFO ] Flatten gal took : 50 ms
[2024-05-31 09:18:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-31 09:18:59] [INFO ] Time to serialize gal into /tmp/LTL5254592811162791079.gal : 3 ms
[2024-05-31 09:18:59] [INFO ] Time to serialize properties into /tmp/LTL11485388831573053288.ltl : 2 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/LTL5254592811162791079.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11485388831573053288.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...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("(((((((((((u12.Rows_2_0==1)&&(u49.Cells_2_1==1))&&(u78.Columns_1_0==1))||(((u13.Rows_2_1==1)&&(u53.Cells_2_5==1))&&(u103...14499
Formula 0 simplified : XXXXG!"(((((((((((u12.Rows_2_0==1)&&(u49.Cells_2_1==1))&&(u78.Columns_1_0==1))||(((u13.Rows_2_1==1)&&(u53.Cells_2_5==1))&&(u103.Colu...14487
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4055509667119012919
[2024-05-31 09:19:14] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4055509667119012919
Running compilation step : cd /tmp/ltsmin4055509667119012919;'/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 426 ms.
Running link step : cd /tmp/ltsmin4055509667119012919;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4055509667119012919;'/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(X(X(<>((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN06-LTLFireability-04 finished in 105313 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(X(X(G((p0 U X(p1)))))) U X(p1))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 17 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:19:29] [INFO ] Invariant cache hit.
[2024-05-31 09:19:29] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-31 09:19:29] [INFO ] Invariant cache hit.
[2024-05-31 09:19:30] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-31 09:19:30] [INFO ] Invariant cache hit.
[2024-05-31 09:19:30] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 537 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s30 1) (EQ s67 1) (EQ s78 1)), p0:(AND (EQ s17 1) (EQ s49 1) (EQ s83 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 18 steps with 3 reset in 2 ms.
FORMULA Sudoku-PT-AN06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLFireability-08 finished in 1027 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((X(!p0) U p1)))&&G(X(p0))))&&X(p1)))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 17 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:19:30] [INFO ] Invariant cache hit.
[2024-05-31 09:19:30] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-31 09:19:30] [INFO ] Invariant cache hit.
[2024-05-31 09:19:31] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-31 09:19:31] [INFO ] Invariant cache hit.
[2024-05-31 09:19:31] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 476 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s17 1) (EQ s50 1) (EQ s89 1)), p0:(AND (EQ s15 1) (EQ s48 1) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLFireability-09 finished in 730 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)||(p1 U X(X(X((p2||F(p3))))))))'
Support contains 9 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:19:31] [INFO ] Invariant cache hit.
[2024-05-31 09:19:31] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-31 09:19:31] [INFO ] Invariant cache hit.
[2024-05-31 09:19:31] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-05-31 09:19:31] [INFO ] Invariant cache hit.
[2024-05-31 09:19:31] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 1441 ms :[(NOT p3), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 9}, { cond=(AND p0 p1), acceptance={} source=4 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 12}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={} source=7 dest: 3}], [{ cond=p1, acceptance={} source=8 dest: 17}, { cond=(NOT p1), acceptance={} source=8 dest: 18}], [{ cond=true, acceptance={} source=9 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=10 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=11 dest: 13}, { cond=(AND p0 (NOT p1)), acceptance={} source=11 dest: 14}, { cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 17}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 18}], [{ cond=p0, acceptance={} source=12 dest: 5}, { cond=(NOT p0), acceptance={} source=12 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=13 dest: 15}, { cond=(AND p0 (NOT p1)), acceptance={} source=13 dest: 16}, { cond=(AND (NOT p0) p1), acceptance={} source=13 dest: 19}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=13 dest: 20}], [{ cond=p0, acceptance={} source=14 dest: 6}, { cond=(NOT p0), acceptance={} source=14 dest: 10}], [{ cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=15 dest: 15}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=15 dest: 16}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=15 dest: 19}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=15 dest: 20}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=16 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=16 dest: 10}], [{ cond=p1, acceptance={} source=17 dest: 19}, { cond=(NOT p1), acceptance={} source=17 dest: 20}], [{ cond=true, acceptance={} source=18 dest: 10}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=19 dest: 19}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=19 dest: 20}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=20 dest: 10}]], initial=4, aps=[p3:(AND (EQ s4 1) (EQ s38 1) (EQ s88 1)), p0:(OR (EQ s8 0) (EQ s46 0) (EQ s98 0)), p2:(AND (EQ s18 1) (EQ s57 1) (EQ s90 1)), p1:(AND (EQ s8 1) (EQ s46 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, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 179 steps with 38 reset in 11 ms.
FORMULA Sudoku-PT-AN06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLFireability-10 finished in 1914 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(((!p1 U (p2||G(!p1)))||p0)))'
Support contains 9 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 11 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:19:33] [INFO ] Invariant cache hit.
[2024-05-31 09:19:33] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-31 09:19:33] [INFO ] Invariant cache hit.
[2024-05-31 09:19:33] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-31 09:19:33] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 09:19:33] [INFO ] Invariant cache hit.
[2024-05-31 09:19:33] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 453 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s53 0) (EQ s106 0)), p2:(AND (NOT (AND (EQ s3 1) (EQ s37 1) (EQ s81 1))) (NOT (AND (EQ s13 1) (EQ s50 1) (EQ s85 1)))), p1:(AND (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11349 reset in 2229 ms.
Product exploration explored 100000 steps with 11504 reset in 2297 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (F (G p0)), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN06-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN06-LTLFireability-12 finished in 5223 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 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:19:38] [INFO ] Invariant cache hit.
[2024-05-31 09:19:38] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-31 09:19:38] [INFO ] Invariant cache hit.
[2024-05-31 09:19:38] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-05-31 09:19:38] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 09:19:38] [INFO ] Invariant cache hit.
[2024-05-31 09:19:38] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 434 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s28 1) (EQ s65 1) (EQ s106 1)) (AND (EQ s15 1) (EQ s53 1) (EQ s105 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLFireability-13 finished in 480 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((G(p0)||X((!p1 U (p2||G(!p1)))))))))'
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:19:39] [INFO ] Invariant cache hit.
[2024-05-31 09:19:39] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-31 09:19:39] [INFO ] Invariant cache hit.
[2024-05-31 09:19:39] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-31 09:19:39] [INFO ] Invariant cache hit.
[2024-05-31 09:19:39] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 428 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 0}, { cond=(AND p0 p2), acceptance={} source=6 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))), acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(AND (EQ s12 1) (EQ s49 1) (EQ s78 1)), p2:(AND (NOT (AND (EQ s26 1) (EQ s61 1) (EQ s80 1))) (NOT (AND (EQ s12 1) (EQ s50 1) (EQ s84 1)))), p1:(AND (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLFireability-15 finished in 683 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(X(X(F(p0))))))'
Found a Shortening insensitive property : Sudoku-PT-AN06-LTLFireability-04
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:19:39] [INFO ] Invariant cache hit.
[2024-05-31 09:19:40] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-31 09:19:40] [INFO ] Invariant cache hit.
[2024-05-31 09:19:40] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-31 09:19:40] [INFO ] Invariant cache hit.
[2024-05-31 09:19:40] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 221 ms. Remains : 108/108 places, 216/216 transitions.
Running random walk in product with property : Sudoku-PT-AN06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (AND (EQ s12 1) (EQ s49 1) (EQ s78 1)) (AND (EQ s13 1) (EQ s53 1) (EQ s103 1)) (AND (EQ s28 1) (EQ s64 1) (EQ s100 1)) (AND (EQ s27 1) (EQ s60 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 2475 ms.
Product exploration explored 100000 steps with 20000 reset in 2495 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:19:46] [INFO ] Invariant cache hit.
[2024-05-31 09:19:46] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-31 09:19:46] [INFO ] Invariant cache hit.
[2024-05-31 09:19:46] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-31 09:19:46] [INFO ] Invariant cache hit.
[2024-05-31 09:19:46] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 108/108 places, 216/216 transitions.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 708 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 2445 ms.
Product exploration explored 100000 steps with 20000 reset in 2494 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:19:53] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 09:19:53] [INFO ] Invariant cache hit.
[2024-05-31 09:19:53] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 108/108 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin15690603986574679278
[2024-05-31 09:19:53] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15690603986574679278
Running compilation step : cd /tmp/ltsmin15690603986574679278;'/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 416 ms.
Running link step : cd /tmp/ltsmin15690603986574679278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15690603986574679278;'/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/stateBased14074220835463211726.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:20:08] [INFO ] Invariant cache hit.
[2024-05-31 09:20:08] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 09:20:08] [INFO ] Invariant cache hit.
[2024-05-31 09:20:08] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-31 09:20:08] [INFO ] Invariant cache hit.
[2024-05-31 09:20:08] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 108/108 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin11851644774693591461
[2024-05-31 09:20:08] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11851644774693591461
Running compilation step : cd /tmp/ltsmin11851644774693591461;'/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 399 ms.
Running link step : cd /tmp/ltsmin11851644774693591461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11851644774693591461;'/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/stateBased3433387946213106357.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 09:20:24] [INFO ] Flatten gal took : 11 ms
[2024-05-31 09:20:24] [INFO ] Flatten gal took : 11 ms
[2024-05-31 09:20:24] [INFO ] Time to serialize gal into /tmp/LTL62471834079912555.gal : 2 ms
[2024-05-31 09:20:24] [INFO ] Time to serialize properties into /tmp/LTL17976896704000128528.prop : 1 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/LTL62471834079912555.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6359304765549301863.hoa' '-atoms' '/tmp/LTL17976896704000128528.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...316
Loading property file /tmp/LTL17976896704000128528.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6359304765549301863.hoa
Detected timeout of ITS tools.
[2024-05-31 09:20:39] [INFO ] Flatten gal took : 10 ms
[2024-05-31 09:20:39] [INFO ] Flatten gal took : 9 ms
[2024-05-31 09:20:39] [INFO ] Time to serialize gal into /tmp/LTL4001964443866708288.gal : 2 ms
[2024-05-31 09:20:39] [INFO ] Time to serialize properties into /tmp/LTL11901169399046377.ltl : 2 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/LTL4001964443866708288.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11901169399046377.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...273
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("(((((((((((Rows_2_0==1)&&(Cells_2_1==1))&&(Columns_1_0==1))||(((Rows_2_1==1)&&(Cells_2_5==1))&&(Columns_5_1==1)))||((((R...11919
Formula 0 simplified : XXXXG!"(((((((((((Rows_2_0==1)&&(Cells_2_1==1))&&(Columns_1_0==1))||(((Rows_2_1==1)&&(Cells_2_5==1))&&(Columns_5_1==1)))||((((Rows_4...11907
Detected timeout of ITS tools.
[2024-05-31 09:20:54] [INFO ] Flatten gal took : 11 ms
[2024-05-31 09:20:54] [INFO ] Applying decomposition
[2024-05-31 09:20:54] [INFO ] Flatten gal took : 11 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/graph7196509760745117878.txt' '-o' '/tmp/graph7196509760745117878.bin' '-w' '/tmp/graph7196509760745117878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7196509760745117878.bin' '-l' '-1' '-v' '-w' '/tmp/graph7196509760745117878.weights' '-q' '0' '-e' '0.001'
[2024-05-31 09:20:54] [INFO ] Decomposing Gal with order
[2024-05-31 09:20:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:20:54] [INFO ] Removed a total of 540 redundant transitions.
[2024-05-31 09:20:54] [INFO ] Flatten gal took : 22 ms
[2024-05-31 09:20:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-31 09:20:54] [INFO ] Time to serialize gal into /tmp/LTL15050091043073550980.gal : 2 ms
[2024-05-31 09:20:54] [INFO ] Time to serialize properties into /tmp/LTL9670545004923444836.ltl : 2 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/LTL15050091043073550980.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9670545004923444836.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...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(F("(((((((((((u12.Rows_2_0==1)&&(u49.Cells_2_1==1))&&(u78.Columns_1_0==1))||(((u13.Rows_2_1==1)&&(u53.Cells_2_5==1))&&(u103...14499
Formula 0 simplified : XXXXG!"(((((((((((u12.Rows_2_0==1)&&(u49.Cells_2_1==1))&&(u78.Columns_1_0==1))||(((u13.Rows_2_1==1)&&(u53.Cells_2_5==1))&&(u103.Colu...14487
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12571795458854777276
[2024-05-31 09:21:09] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12571795458854777276
Running compilation step : cd /tmp/ltsmin12571795458854777276;'/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 416 ms.
Running link step : cd /tmp/ltsmin12571795458854777276;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12571795458854777276;'/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(X(X(<>((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN06-LTLFireability-04 finished in 104762 ms.
[2024-05-31 09:21:24] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14608040293797812984
[2024-05-31 09:21:24] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 09:21:24] [INFO ] Applying decomposition
[2024-05-31 09:21:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:21:24] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 09:21:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:21:24] [INFO ] Flatten gal took : 10 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/graph375370520386044825.txt' '-o' '/tmp/graph375370520386044825.bin' '-w' '/tmp/graph375370520386044825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph375370520386044825.bin' '-l' '-1' '-v' '-w' '/tmp/graph375370520386044825.weights' '-q' '0' '-e' '0.001'
[2024-05-31 09:21:24] [INFO ] Decomposing Gal with order
[2024-05-31 09:21:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:21:24] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 09:21:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:21:24] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14608040293797812984
Running compilation step : cd /tmp/ltsmin14608040293797812984;'/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'
[2024-05-31 09:21:24] [INFO ] Removed a total of 540 redundant transitions.
[2024-05-31 09:21:24] [INFO ] Flatten gal took : 17 ms
[2024-05-31 09:21:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-31 09:21:24] [INFO ] Time to serialize gal into /tmp/LTLFireability16388562047954317418.gal : 2 ms
[2024-05-31 09:21:24] [INFO ] Time to serialize properties into /tmp/LTLFireability17941478633334734819.ltl : 1 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/LTLFireability16388562047954317418.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17941478633334734819.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 : !((X(X(X(X(F("(((((((((((u12.Rows_2_0==1)&&(u49.Cells_2_1==1))&&(u78.Columns_1_0==1))||(((u13.Rows_2_1==1)&&(u53.Cells_2_5==1))&&(u103...14499
Formula 0 simplified : XXXXG!"(((((((((((u12.Rows_2_0==1)&&(u49.Cells_2_1==1))&&(u78.Columns_1_0==1))||(((u13.Rows_2_1==1)&&(u53.Cells_2_5==1))&&(u103.Colu...14487
Compilation finished in 465 ms.
Running link step : cd /tmp/ltsmin14608040293797812984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14608040293797812984;'/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(X(X(<>((LTLAPp0==true))))))' '--buchi-type=spotba'
LTSmin run took 350834 ms.
FORMULA Sudoku-PT-AN06-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 580895 ms.
BK_STOP 1717147641028
--------------------
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-AN06"
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-AN06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556300383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN06.tgz
mv Sudoku-PT-AN06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;