About the Execution of ITS-Tools for Sudoku-PT-AN10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16225.392 | 3600000.00 | 3436326.00 | 466120.30 | FTT?TFFTFTFTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545500276.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-PT-AN10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545500276
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.2M
-rw-r--r-- 1 mcc users 270K Apr 30 12:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Apr 30 12:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 694K Apr 30 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.3M Apr 30 12:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 210K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 725K May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 440K May 9 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M May 9 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 36K May 9 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 92K May 9 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 564K May 10 09:34 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-AN10-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653105478136
Running Version 202205111006
[2022-05-21 03:57:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 03:57:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 03:57:59] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2022-05-21 03:57:59] [INFO ] Transformed 1300 places.
[2022-05-21 03:57:59] [INFO ] Transformed 1000 transitions.
[2022-05-21 03:57:59] [INFO ] Parsed PT model containing 1300 places and 1000 transitions in 278 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 101 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 32 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:00] [INFO ] Computed 29 place invariants in 71 ms
[2022-05-21 03:58:00] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:00] [INFO ] Computed 29 place invariants in 37 ms
[2022-05-21 03:58:01] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:01] [INFO ] Computed 29 place invariants in 34 ms
[2022-05-21 03:58:01] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/1300 places, 1000/1000 transitions.
Support contains 300 out of 300 places after structural reductions.
[2022-05-21 03:58:02] [INFO ] Flatten gal took : 206 ms
[2022-05-21 03:58:03] [INFO ] Flatten gal took : 227 ms
[2022-05-21 03:58:04] [INFO ] Input system was already deterministic with 1000 transitions.
Finished random walk after 85 steps, including 0 resets, run visited all 18 properties in 38 ms. (steps per millisecond=2 )
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G(X(X(X(p0))))))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 2 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:05] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-21 03:58:05] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:05] [INFO ] Computed 29 place invariants in 14 ms
[2022-05-21 03:58:06] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:06] [INFO ] Computed 29 place invariants in 29 ms
[2022-05-21 03:58:06] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 89 steps with 0 reset in 13 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-00 finished in 1888 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(X(p0))))))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 9 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:07] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-21 03:58:07] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:07] [INFO ] Computed 29 place invariants in 13 ms
[2022-05-21 03:58:07] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:07] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-21 03:58:07] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-03 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 (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 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 timeout after 68160 steps with 13632 reset in 10001 ms.
Product exploration timeout after 67460 steps with 13492 reset in 10002 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
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 478 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 5 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:33] [INFO ] Computed 29 place invariants in 22 ms
[2022-05-21 03:58:33] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:33] [INFO ] Computed 29 place invariants in 21 ms
[2022-05-21 03:58:33] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:33] [INFO ] Computed 29 place invariants in 21 ms
[2022-05-21 03:58:34] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
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 124 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 71170 steps with 14234 reset in 10001 ms.
Product exploration timeout after 70760 steps with 14152 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2022-05-21 03:58:59] [INFO ] Redundant transitions in 78 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:59] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-21 03:59:00] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Product exploration timeout after 69920 steps with 13984 reset in 10002 ms.
Product exploration timeout after 69970 steps with 13994 reset in 10002 ms.
Built C files in :
/tmp/ltsmin3508801150035520937
[2022-05-21 03:59:20] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3508801150035520937
Running compilation step : cd /tmp/ltsmin3508801150035520937;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2554 ms.
Running link step : cd /tmp/ltsmin3508801150035520937;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin3508801150035520937;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11605826893824098748.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 6 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:59:35] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-21 03:59:35] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:59:35] [INFO ] Computed 29 place invariants in 26 ms
[2022-05-21 03:59:35] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:59:35] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-21 03:59:35] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin13116165970320692340
[2022-05-21 03:59:35] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13116165970320692340
Running compilation step : cd /tmp/ltsmin13116165970320692340;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2179 ms.
Running link step : cd /tmp/ltsmin13116165970320692340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13116165970320692340;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6387992073305200231.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 03:59:51] [INFO ] Flatten gal took : 66 ms
[2022-05-21 03:59:51] [INFO ] Flatten gal took : 56 ms
[2022-05-21 03:59:51] [INFO ] Time to serialize gal into /tmp/LTL11337196698321634926.gal : 11 ms
[2022-05-21 03:59:51] [INFO ] Time to serialize properties into /tmp/LTL13449309896884836761.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11337196698321634926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13449309896884836761.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1133719...268
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X(X("(((((((((((((Rows_8_2>=1)&&(Cells_8_1>=1))&&(Columns_1_2>=1))||(((Rows_1_5>=1)&&(Cells_1_9>=1))&&(Columns_9_5>=1)))||(((...55039
Formula 0 simplified : !XFXXX"(((((((((((((Rows_8_2>=1)&&(Cells_8_1>=1))&&(Columns_1_2>=1))||(((Rows_1_5>=1)&&(Cells_1_9>=1))&&(Columns_9_5>=1)))||((((Rows...55027
Detected timeout of ITS tools.
[2022-05-21 04:00:06] [INFO ] Flatten gal took : 55 ms
[2022-05-21 04:00:06] [INFO ] Applying decomposition
[2022-05-21 04:00:06] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8434299847100729343.txt' '-o' '/tmp/graph8434299847100729343.bin' '-w' '/tmp/graph8434299847100729343.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8434299847100729343.bin' '-l' '-1' '-v' '-w' '/tmp/graph8434299847100729343.weights' '-q' '0' '-e' '0.001'
[2022-05-21 04:00:06] [INFO ] Decomposing Gal with order
[2022-05-21 04:00:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 04:00:07] [INFO ] Removed a total of 2700 redundant transitions.
[2022-05-21 04:00:07] [INFO ] Flatten gal took : 132 ms
[2022-05-21 04:00:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-21 04:00:07] [INFO ] Time to serialize gal into /tmp/LTL71501509054135952.gal : 9 ms
[2022-05-21 04:00:07] [INFO ] Time to serialize properties into /tmp/LTL3288226387286627383.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL71501509054135952.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3288226387286627383.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7150150...243
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X(X("(((((((((((((u82.Rows_8_2>=1)&&(u181.Cells_8_1>=1))&&(u212.Columns_1_2>=1))||(((u15.Rows_1_5>=1)&&(u119.Cells_1_9>=1))&&...68939
Formula 0 simplified : !XFXXX"(((((((((((((u82.Rows_8_2>=1)&&(u181.Cells_8_1>=1))&&(u212.Columns_1_2>=1))||(((u15.Rows_1_5>=1)&&(u119.Cells_1_9>=1))&&(u295...68927
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5128071273113441763
[2022-05-21 04:00:22] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5128071273113441763
Running compilation step : cd /tmp/ltsmin5128071273113441763;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2044 ms.
Running link step : cd /tmp/ltsmin5128071273113441763;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5128071273113441763;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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-AN10-LTLFireability-03 finished in 150347 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((G(X(p0)) U !X((p0 U p0))))&&p0)))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:00:37] [INFO ] Computed 29 place invariants in 21 ms
[2022-05-21 04:00:37] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:00:37] [INFO ] Computed 29 place invariants in 22 ms
[2022-05-21 04:00:37] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2022-05-21 04:00:37] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:00:37] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-21 04:00:38] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, p0]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1145 reset in 6098 ms.
Product exploration explored 100000 steps with 1147 reset in 6184 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN10-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLFireability-04 finished in 17498 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(p1))||p0)) U !p1))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:00:54] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-21 04:00:54] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:00:54] [INFO ] Computed 29 place invariants in 13 ms
[2022-05-21 04:00:55] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:00:55] [INFO ] Computed 29 place invariants in 14 ms
[2022-05-21 04:00:55] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 205 ms :[p1, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 84 steps with 0 reset in 8 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-05 finished in 987 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(!(F((F(X(p1))||p0)) U F(X(X(p1))))))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:00:55] [INFO ] Computed 29 place invariants in 13 ms
[2022-05-21 04:00:55] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:00:55] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-21 04:00:56] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:00:56] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-21 04:00:56] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, p1, p1, p1]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-06 finished in 878 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 61 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:00:56] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-21 04:00:57] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:00:57] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-21 04:00:57] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:00:57] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-21 04:00:58] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s24 1) (LT s122 1) (LT s224 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-08 finished in 1610 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0))))||X((F(p2)&&p1))))'
Support contains 12 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:00:58] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-21 04:00:58] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:00:58] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-21 04:00:59] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:00:59] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-21 04:00:59] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 878 ms :[(AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p2:(OR (LT s4 1) (LT s100 1) (LT s204 1)), p1:(AND (GEQ s8 1) (GEQ s101 1) (GEQ s218 1) (GEQ s86 1) (GEQ s185 1) (GEQ s256 1)), p0:(OR (LT s65 1) (LT s165...], 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][false, false, false, false, false, false]]
Product exploration timeout after 80090 steps with 4672 reset in 10002 ms.
Product exploration timeout after 78630 steps with 4629 reset in 10001 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), true, (F (G p2)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X p1), (X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 363 ms. Reduced automaton from 6 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLFireability-09 finished in 26501 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 24 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:24] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-21 04:01:25] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:25] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-21 04:01:25] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
[2022-05-21 04:01:25] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:25] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-21 04:01:26] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s34 1) (GEQ s132 1) (GEQ s224 1)), p1:(OR (LT s38 1) (LT s130 1) (LT s208 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1401 steps with 15 reset in 89 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-10 finished in 1706 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0 U p1))))))'
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:26] [INFO ] Computed 29 place invariants in 16 ms
[2022-05-21 04:01:26] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:26] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-21 04:01:27] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:27] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-21 04:01:27] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s15 1) (GEQ s111 1) (GEQ s215 1)), p0:(AND (GEQ s1 1) (GEQ s102 1) (GEQ s221 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 12 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-12 finished in 1719 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(!(p0 U p1))||p2))))'
Support contains 12 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:28] [INFO ] Computed 29 place invariants in 21 ms
[2022-05-21 04:01:28] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:28] [INFO ] Computed 29 place invariants in 22 ms
[2022-05-21 04:01:29] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:29] [INFO ] Computed 29 place invariants in 13 ms
[2022-05-21 04:01:29] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (OR (LT s51 1) (LT s159 1) (LT s291 1)) (OR (AND (GEQ s73 1) (GEQ s171 1) (GEQ s213 1)) (AND (GEQ s74 1) (GEQ s179 1) (GEQ s294 1)))), p0:(AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 99340 steps with 2781 reset in 10001 ms.
Product exploration timeout after 99010 steps with 2719 reset in 10001 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p0 p1), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN10-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLFireability-13 finished in 25559 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(F(p0)))&&G(X(p1))&&p1)))'
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:53] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-21 04:01:54] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:54] [INFO ] Computed 29 place invariants in 15 ms
[2022-05-21 04:01:54] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:54] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-21 04:01:55] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (LT s16 1) (LT s119 1) (LT s296 1)), p0:(OR (LT s1 1) (LT s103 1) (LT s231 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-14 finished in 1637 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 9 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 21 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:55] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-21 04:01:55] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:55] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-21 04:01:56] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
[2022-05-21 04:01:56] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:56] [INFO ] Computed 29 place invariants in 15 ms
[2022-05-21 04:01:56] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s69 1) (LT s167 1) (LT s279 1)), p1:(OR (AND (GEQ s70 1) (GEQ s175 1) (GEQ s250 1)) (AND (GEQ s73 1) (GEQ s172 1) (GEQ s223 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1236 steps with 38 reset in 122 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-15 finished in 1736 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(X(p0))))))'
Found a CL insensitive property : Sudoku-PT-AN10-LTLFireability-03
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:57] [INFO ] Computed 29 place invariants in 15 ms
[2022-05-21 04:01:57] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:57] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-21 04:01:57] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:01:57] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-21 04:01:58] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-03 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 (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 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 timeout after 69580 steps with 13916 reset in 10001 ms.
Product exploration timeout after 68030 steps with 13606 reset in 10001 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
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 110 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 325 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 90 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=10 )
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 692 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 5 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:02:23] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-21 04:02:23] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:02:23] [INFO ] Computed 29 place invariants in 16 ms
[2022-05-21 04:02:23] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:02:24] [INFO ] Computed 29 place invariants in 15 ms
[2022-05-21 04:02:24] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
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 122 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 89 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 69520 steps with 13904 reset in 10001 ms.
Product exploration timeout after 70020 steps with 14004 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2022-05-21 04:02:49] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:02:49] [INFO ] Computed 29 place invariants in 14 ms
[2022-05-21 04:02:49] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Product exploration timeout after 69880 steps with 13976 reset in 10002 ms.
Product exploration timeout after 68240 steps with 13648 reset in 10001 ms.
Built C files in :
/tmp/ltsmin18230059782139189800
[2022-05-21 04:03:10] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18230059782139189800
Running compilation step : cd /tmp/ltsmin18230059782139189800;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2527 ms.
Running link step : cd /tmp/ltsmin18230059782139189800;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin18230059782139189800;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10516990662568946526.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 4 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:03:25] [INFO ] Computed 29 place invariants in 22 ms
[2022-05-21 04:03:25] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:03:25] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-21 04:03:25] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 04:03:25] [INFO ] Computed 29 place invariants in 14 ms
[2022-05-21 04:03:25] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin8626941149041257252
[2022-05-21 04:03:25] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8626941149041257252
Running compilation step : cd /tmp/ltsmin8626941149041257252;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2134 ms.
Running link step : cd /tmp/ltsmin8626941149041257252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8626941149041257252;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10432011492933315699.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 04:03:41] [INFO ] Flatten gal took : 53 ms
[2022-05-21 04:03:41] [INFO ] Flatten gal took : 53 ms
[2022-05-21 04:03:41] [INFO ] Time to serialize gal into /tmp/LTL4463455682810293949.gal : 4 ms
[2022-05-21 04:03:41] [INFO ] Time to serialize properties into /tmp/LTL10993588325889912423.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4463455682810293949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10993588325889912423.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4463455...267
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X(X("(((((((((((((Rows_8_2>=1)&&(Cells_8_1>=1))&&(Columns_1_2>=1))||(((Rows_1_5>=1)&&(Cells_1_9>=1))&&(Columns_9_5>=1)))||(((...55039
Formula 0 simplified : !XFXXX"(((((((((((((Rows_8_2>=1)&&(Cells_8_1>=1))&&(Columns_1_2>=1))||(((Rows_1_5>=1)&&(Cells_1_9>=1))&&(Columns_9_5>=1)))||((((Rows...55027
Detected timeout of ITS tools.
[2022-05-21 04:03:56] [INFO ] Flatten gal took : 46 ms
[2022-05-21 04:03:56] [INFO ] Applying decomposition
[2022-05-21 04:03:56] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1202481101614291066.txt' '-o' '/tmp/graph1202481101614291066.bin' '-w' '/tmp/graph1202481101614291066.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1202481101614291066.bin' '-l' '-1' '-v' '-w' '/tmp/graph1202481101614291066.weights' '-q' '0' '-e' '0.001'
[2022-05-21 04:03:56] [INFO ] Decomposing Gal with order
[2022-05-21 04:03:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 04:03:56] [INFO ] Removed a total of 2700 redundant transitions.
[2022-05-21 04:03:56] [INFO ] Flatten gal took : 81 ms
[2022-05-21 04:03:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-21 04:03:56] [INFO ] Time to serialize gal into /tmp/LTL1176304825668151282.gal : 6 ms
[2022-05-21 04:03:56] [INFO ] Time to serialize properties into /tmp/LTL7254941234317237983.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1176304825668151282.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7254941234317237983.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1176304...245
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X(X("(((((((((((((u82.Rows_8_2>=1)&&(u181.Cells_8_1>=1))&&(u212.Columns_1_2>=1))||(((u15.Rows_1_5>=1)&&(u119.Cells_1_9>=1))&&...68939
Formula 0 simplified : !XFXXX"(((((((((((((u82.Rows_8_2>=1)&&(u181.Cells_8_1>=1))&&(u212.Columns_1_2>=1))||(((u15.Rows_1_5>=1)&&(u119.Cells_1_9>=1))&&(u295...68927
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5097135869259343452
[2022-05-21 04:04:11] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5097135869259343452
Running compilation step : cd /tmp/ltsmin5097135869259343452;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2101 ms.
Running link step : cd /tmp/ltsmin5097135869259343452;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5097135869259343452;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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-AN10-LTLFireability-03 finished in 149861 ms.
[2022-05-21 04:04:27] [INFO ] Flatten gal took : 49 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7989163664813872257
[2022-05-21 04:04:27] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2022-05-21 04:04:27] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 04:04:27] [INFO ] Applying decomposition
[2022-05-21 04:04:27] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2022-05-21 04:04:27] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 04:04:27] [INFO ] Flatten gal took : 88 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7639519580074998291.txt' '-o' '/tmp/graph7639519580074998291.bin' '-w' '/tmp/graph7639519580074998291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7639519580074998291.bin' '-l' '-1' '-v' '-w' '/tmp/graph7639519580074998291.weights' '-q' '0' '-e' '0.001'
[2022-05-21 04:04:27] [INFO ] Decomposing Gal with order
[2022-05-21 04:04:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 04:04:27] [INFO ] Removed a total of 2700 redundant transitions.
[2022-05-21 04:04:27] [INFO ] Flatten gal took : 71 ms
[2022-05-21 04:04:27] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2022-05-21 04:04:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-21 04:04:27] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 04:04:27] [INFO ] Built C files in 408ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7989163664813872257
Running compilation step : cd /tmp/ltsmin7989163664813872257;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-21 04:04:27] [INFO ] Time to serialize gal into /tmp/LTLFireability13327896702116414974.gal : 249 ms
[2022-05-21 04:04:27] [INFO ] Time to serialize properties into /tmp/LTLFireability13062337465201068696.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13327896702116414974.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13062337465201068696.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X(X("(((((((((((((u82.Rows_8_2>=1)&&(u181.Cells_8_1>=1))&&(u212.Columns_1_2>=1))||(((u15.Rows_1_5>=1)&&(u119.Cells_1_9>=1))&&...68939
Formula 0 simplified : !XFXXX"(((((((((((((u82.Rows_8_2>=1)&&(u181.Cells_8_1>=1))&&(u212.Columns_1_2>=1))||(((u15.Rows_1_5>=1)&&(u119.Cells_1_9>=1))&&(u295...68927
Compilation finished in 3296 ms.
Running link step : cd /tmp/ltsmin7989163664813872257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin7989163664813872257;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(X(X((LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.042: LTL layer: formula: X(<>(X(X(X((LTLAPp0==true))))))
pins2lts-mc-linux64( 1/ 8), 0.042: "X(<>(X(X(X((LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.051: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.115: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.190: DFS-FIFO for weak LTL, using special progress label 1002
pins2lts-mc-linux64( 0/ 8), 0.190: There are 1003 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.190: State length is 301, there are 1005 groups
pins2lts-mc-linux64( 0/ 8), 0.190: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.190: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.190: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.190: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 3.758: ~1 levels ~960 states ~933344 transitions
pins2lts-mc-linux64( 0/ 8), 5.826: ~1 levels ~1920 states ~1866464 transitions
pins2lts-mc-linux64( 2/ 8), 9.733: ~1 levels ~3840 states ~3640416 transitions
pins2lts-mc-linux64( 0/ 8), 17.347: ~1 levels ~7680 states ~7309760 transitions
pins2lts-mc-linux64( 0/ 8), 32.580: ~1 levels ~15360 states ~14563600 transitions
pins2lts-mc-linux64( 0/ 8), 63.032: ~1 levels ~30720 states ~29071344 transitions
pins2lts-mc-linux64( 6/ 8), 111.134: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 131.033:
pins2lts-mc-linux64( 0/ 8), 131.033: mean standard work distribution: 0.8% (states) 0.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 131.033:
pins2lts-mc-linux64( 0/ 8), 131.033: Explored 52531 states 49641015 transitions, fanout: 944.985
pins2lts-mc-linux64( 0/ 8), 131.033: Total exploration time 130.830 sec (111.240 sec minimum, 122.946 sec on average)
pins2lts-mc-linux64( 0/ 8), 131.033: States per second: 402, Transitions per second: 379431
pins2lts-mc-linux64( 0/ 8), 131.033:
pins2lts-mc-linux64( 0/ 8), 131.033: Progress states detected: 36665963
pins2lts-mc-linux64( 0/ 8), 131.033: Redundant explorations: -99.8567
pins2lts-mc-linux64( 0/ 8), 131.033:
pins2lts-mc-linux64( 0/ 8), 131.033: Queue width: 8B, total height: 37098812, memory: 283.04MB
pins2lts-mc-linux64( 0/ 8), 131.033: Tree memory: 535.8MB, 15.3 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 131.033: Tree fill ratio (roots/leafs): 27.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 131.033: Stored 1011 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 131.033: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 131.033: Est. total memory use: 818.8MB (~1307.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7989163664813872257;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(X(X((LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7989163664813872257;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(X(X((LTLAPp0==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-21 04:26:40] [INFO ] Flatten gal took : 323 ms
[2022-05-21 04:26:40] [INFO ] Time to serialize gal into /tmp/LTLFireability12231412552444799413.gal : 32 ms
[2022-05-21 04:26:40] [INFO ] Time to serialize properties into /tmp/LTLFireability13021027655203918950.ltl : 30 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12231412552444799413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13021027655203918950.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...290
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X(X("(((((((((((((Rows_8_2>=1)&&(Cells_8_1>=1))&&(Columns_1_2>=1))||(((Rows_1_5>=1)&&(Cells_1_9>=1))&&(Columns_9_5>=1)))||(((...55039
Formula 0 simplified : !XFXXX"(((((((((((((Rows_8_2>=1)&&(Cells_8_1>=1))&&(Columns_1_2>=1))||(((Rows_1_5>=1)&&(Cells_1_9>=1))&&(Columns_9_5>=1)))||((((Rows...55027
Detected timeout of ITS tools.
[2022-05-21 04:49:09] [INFO ] Flatten gal took : 272 ms
[2022-05-21 04:49:11] [INFO ] Input system was already deterministic with 1000 transitions.
[2022-05-21 04:49:11] [INFO ] Transformed 300 places.
[2022-05-21 04:49:11] [INFO ] Transformed 1000 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
java.lang.NullPointerException
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.computeOrderWithGreatSPN(MultiOrderRunner.java:57)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:135)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:737)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-21 04:49:12] [INFO ] Time to serialize gal into /tmp/LTLFireability12636986634394786348.gal : 8 ms
[2022-05-21 04:49:12] [INFO ] Time to serialize properties into /tmp/LTLFireability340482029221969694.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12636986634394786348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability340482029221969694.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(X(X(X("(((((((((((((Rows_8_2>=1)&&(Cells_8_1>=1))&&(Columns_1_2>=1))||(((Rows_1_5>=1)&&(Cells_1_9>=1))&&(Columns_9_5>=1)))||(((...55039
Formula 0 simplified : !XFXXX"(((((((((((((Rows_8_2>=1)&&(Cells_8_1>=1))&&(Columns_1_2>=1))||(((Rows_1_5>=1)&&(Cells_1_9>=1))&&(Columns_9_5>=1)))||((((Rows...55027
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-AN10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN10, 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 r258-tall-165303545500276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN10.tgz
mv Sudoku-PT-AN10 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 ;