About the Execution of ITS-Tools for Sudoku-COL-AN14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16221.451 | 3600000.00 | 3643287.00 | 566331.30 | TTTTFFT?TFTFTFTT | 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-165303545300148.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-COL-AN14, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545300148
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 7.6K Apr 30 12:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 30 12:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 11:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 11:43 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 3.7K May 9 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN14-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN14-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653081120697
Running Version 202205111006
[2022-05-20 21:12:01] [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-20 21:12:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:12:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-20 21:12:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 21:12:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 503 ms
[2022-05-20 21:12:02] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 3332 PT places and 2744.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-COL-AN14-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 21:12:02] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 8 ms.
[2022-05-20 21:12:02] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
All 15 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [N(14), N(14)] of place Rows breaks symmetries in sort N
[2022-05-20 21:12:03] [INFO ] Unfolded HLPN to a Petri net with 3332 places and 2744 transitions 10976 arcs in 53 ms.
[2022-05-20 21:12:03] [INFO ] Unfolded 15 HLPN properties in 14 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-AN14-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 588 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 61 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:12:14] [INFO ] Computed 41 place invariants in 231 ms
[2022-05-20 21:12:15] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:12:15] [INFO ] Computed 41 place invariants in 209 ms
[2022-05-20 21:12:16] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:12:16] [INFO ] Computed 41 place invariants in 123 ms
[2022-05-20 21:12:17] [INFO ] Dead Transitions using invariants and state equation in 1064 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/3332 places, 2744/2744 transitions.
Support contains 588 out of 588 places after structural reductions.
[2022-05-20 21:12:19] [INFO ] Flatten gal took : 809 ms
[2022-05-20 21:12:25] [INFO ] Flatten gal took : 1023 ms
[2022-05-20 21:12:31] [INFO ] Input system was already deterministic with 2744 transitions.
Finished random walk after 174 steps, including 0 resets, run visited all 2 properties in 75 ms. (steps per millisecond=2 )
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X(F((F(p0)||p0)))))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 14 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:12:34] [INFO ] Computed 41 place invariants in 105 ms
[2022-05-20 21:12:34] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:12:34] [INFO ] Computed 41 place invariants in 95 ms
[2022-05-20 21:12:35] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:12:35] [INFO ] Computed 41 place invariants in 103 ms
[2022-05-20 21:12:36] [INFO ] Dead Transitions using invariants and state equation in 1026 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-00 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s134 1) (LT s328 1) (LT s484 1)) (OR (LT s113 1) (LT s316 1) (LT s505 1)) (OR (LT s113 1) (LT s320 1) (LT s561 1)) (OR (LT s134 1) (LT s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 65350 steps with 379 reset in 10002 ms.
Product exploration timeout after 64350 steps with 373 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 57 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN14-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN14-LTLFireability-00 finished in 25214 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F(X((G(p0)&&X(G(p0))))))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 21 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:12:59] [INFO ] Computed 41 place invariants in 119 ms
[2022-05-20 21:12:59] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:12:59] [INFO ] Computed 41 place invariants in 95 ms
[2022-05-20 21:13:00] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
[2022-05-20 21:13:00] [INFO ] Redundant transitions in 155 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:13:00] [INFO ] Computed 41 place invariants in 94 ms
[2022-05-20 21:13:01] [INFO ] Dead Transitions using invariants and state equation in 1039 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s134 1) (LT s328 1) (LT s484 1)) (OR (LT s113 1) (LT s316 1) (LT s505 1)) (OR (LT s113 1) (LT s320 1) (LT s561 1)) (OR (LT s134 1) (LT s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 63670 steps with 369 reset in 10004 ms.
Product exploration timeout after 61730 steps with 357 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN14-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN14-LTLFireability-01 finished in 24841 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!(F(X(p0)) U X(p0)))||!(p0 U p0))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 8 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:13:24] [INFO ] Computed 41 place invariants in 106 ms
[2022-05-20 21:13:24] [INFO ] Implicit Places using invariants in 219 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:13:24] [INFO ] Computed 41 place invariants in 91 ms
[2022-05-20 21:13:25] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:13:25] [INFO ] Computed 41 place invariants in 99 ms
[2022-05-20 21:13:26] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (AND (GEQ s134 1) (GEQ s328 1) (GEQ s484 1)) (AND (GEQ s113 1) (GEQ s316 1) (GEQ s505 1)) (AND (GEQ s113 1) (GEQ s320 1) (GEQ s561 1)) (AND (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN14-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLFireability-05 finished in 2389 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 19 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:13:26] [INFO ] Computed 41 place invariants in 90 ms
[2022-05-20 21:13:26] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:13:26] [INFO ] Computed 41 place invariants in 94 ms
[2022-05-20 21:13:27] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
[2022-05-20 21:13:27] [INFO ] Redundant transitions in 142 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:13:27] [INFO ] Computed 41 place invariants in 98 ms
[2022-05-20 21:13:28] [INFO ] Dead Transitions using invariants and state equation in 1032 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s134 1) (LT s328 1) (LT s484 1)) (OR (LT s113 1) (LT s316 1) (LT s505 1)) (OR (LT s113 1) (LT s320 1) (LT s561 1)) (OR (LT s134 1) (LT s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 65420 steps with 380 reset in 10001 ms.
Product exploration timeout after 64670 steps with 375 reset in 10003 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN14-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN14-LTLFireability-06 finished in 24769 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(G(p0)) U p0)||X(!p0))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 20 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:13:51] [INFO ] Computed 41 place invariants in 100 ms
[2022-05-20 21:13:51] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:13:51] [INFO ] Computed 41 place invariants in 96 ms
[2022-05-20 21:13:52] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
[2022-05-20 21:13:52] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:13:52] [INFO ] Computed 41 place invariants in 113 ms
[2022-05-20 21:13:53] [INFO ] Dead Transitions using invariants and state equation in 1042 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p0), false, false]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (AND (GEQ s134 1) (GEQ s328 1) (GEQ s484 1)) (AND (GEQ s113 1) (GEQ s316 1) (GEQ s505 1)) (AND (GEQ s113 1) (GEQ s320 1) (GEQ s561 1)) (AND (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 64360 steps with 373 reset in 10003 ms.
Product exploration timeout after 63460 steps with 368 reset in 10004 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 4 states, 7 edges and 1 AP to 4 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), false, false]
Finished random walk after 170 steps, including 0 resets, run visited all 1 properties in 31 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 4 states, 7 edges and 1 AP to 4 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), false, false]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), false, false]
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 21 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:14:16] [INFO ] Computed 41 place invariants in 106 ms
[2022-05-20 21:14:16] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:14:17] [INFO ] Computed 41 place invariants in 97 ms
[2022-05-20 21:14:17] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2022-05-20 21:14:17] [INFO ] Redundant transitions in 66 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:14:18] [INFO ] Computed 41 place invariants in 99 ms
[2022-05-20 21:14:18] [INFO ] Dead Transitions using invariants and state equation in 976 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 4 states, 7 edges and 1 AP to 4 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), false, false]
Finished random walk after 175 steps, including 0 resets, run visited all 1 properties in 30 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 4 states, 7 edges and 1 AP to 4 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), false, false]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), false, false]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), false, false]
Product exploration timeout after 64440 steps with 374 reset in 10004 ms.
Product exploration timeout after 63970 steps with 371 reset in 10002 ms.
Built C files in :
/tmp/ltsmin17701846659680570812
[2022-05-20 21:14:42] [INFO ] Too many transitions (2744) to apply POR reductions. Disabling POR matrices.
[2022-05-20 21:14:42] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17701846659680570812
Running compilation step : cd /tmp/ltsmin17701846659680570812;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17701846659680570812;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17701846659680570812;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 38 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:14:45] [INFO ] Computed 41 place invariants in 92 ms
[2022-05-20 21:14:45] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:14:45] [INFO ] Computed 41 place invariants in 96 ms
[2022-05-20 21:14:46] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
[2022-05-20 21:14:46] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:14:46] [INFO ] Computed 41 place invariants in 100 ms
[2022-05-20 21:14:47] [INFO ] Dead Transitions using invariants and state equation in 1011 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Built C files in :
/tmp/ltsmin1442590396553551411
[2022-05-20 21:14:47] [INFO ] Too many transitions (2744) to apply POR reductions. Disabling POR matrices.
[2022-05-20 21:14:47] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1442590396553551411
Running compilation step : cd /tmp/ltsmin1442590396553551411;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1442590396553551411;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1442590396553551411;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 21:14:52] [INFO ] Flatten gal took : 291 ms
[2022-05-20 21:14:52] [INFO ] Flatten gal took : 256 ms
[2022-05-20 21:14:52] [INFO ] Time to serialize gal into /tmp/LTL13637397853760531758.gal : 32 ms
[2022-05-20 21:14:52] [INFO ] Time to serialize properties into /tmp/LTL1670519088092258569.ltl : 57 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/LTL13637397853760531758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1670519088092258569.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/LTL1363739...267
Read 1 LTL properties
Checking formula 0 : !((G(((X(G("(((((((((((((((Rows_134>=1)&&(Cells_132>=1))&&(Columns_92>=1))||(((Rows_113>=1)&&(Cells_120>=1))&&(Columns_113>=1)))||((((...430711
Formula 0 simplified : !G((XG"(((((((((((((((Rows_134>=1)&&(Cells_132>=1))&&(Columns_92>=1))||(((Rows_113>=1)&&(Cells_120>=1))&&(Columns_113>=1)))||((((Row...430700
Detected timeout of ITS tools.
[2022-05-20 21:15:07] [INFO ] Flatten gal took : 237 ms
[2022-05-20 21:15:07] [INFO ] Applying decomposition
[2022-05-20 21:15:08] [INFO ] Flatten gal took : 183 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/graph10113344300562275785.txt' '-o' '/tmp/graph10113344300562275785.bin' '-w' '/tmp/graph10113344300562275785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10113344300562275785.bin' '-l' '-1' '-v' '-w' '/tmp/graph10113344300562275785.weights' '-q' '0' '-e' '0.001'
[2022-05-20 21:15:08] [INFO ] Decomposing Gal with order
[2022-05-20 21:15:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:15:09] [INFO ] Removed a total of 7644 redundant transitions.
[2022-05-20 21:15:09] [INFO ] Flatten gal took : 473 ms
[2022-05-20 21:15:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 27 ms.
[2022-05-20 21:15:09] [INFO ] Time to serialize gal into /tmp/LTL2991541670782374635.gal : 22 ms
[2022-05-20 21:15:09] [INFO ] Time to serialize properties into /tmp/LTL959794091867463543.ltl : 53 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/LTL2991541670782374635.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL959794091867463543.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/LTL2991541...244
Read 1 LTL properties
Checking formula 0 : !((G(((X(G("(((((((((((((((u134.Rows_134>=1)&&(u328.Cells_132>=1))&&(u484.Columns_92>=1))||(((u113.Rows_113>=1)&&(u316.Cells_120>=1))&...549571
Formula 0 simplified : !G((XG"(((((((((((((((u134.Rows_134>=1)&&(u328.Cells_132>=1))&&(u484.Columns_92>=1))||(((u113.Rows_113>=1)&&(u316.Cells_120>=1))&&(u...549560
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13915259122344658919
[2022-05-20 21:15:24] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13915259122344658919
Running compilation step : cd /tmp/ltsmin13915259122344658919;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13915259122344658919;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13915259122344658919;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Sudoku-COL-AN14-LTLFireability-07 finished in 96483 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&X(F(!(F(G(p0)) U X(G(!p0)))))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 7 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:15:27] [INFO ] Computed 41 place invariants in 124 ms
[2022-05-20 21:15:28] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:15:28] [INFO ] Computed 41 place invariants in 93 ms
[2022-05-20 21:15:28] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:15:29] [INFO ] Computed 41 place invariants in 91 ms
[2022-05-20 21:15:30] [INFO ] Dead Transitions using invariants and state equation in 1181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 623 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(AND (OR (LT s134 1) (LT s328 1) (LT s484 1)) (OR (LT s113 1) (LT s316 1) (LT s505 1)) (OR (LT s113 1) (LT s320 1) (LT s561 1)) (OR (LT s134 1) (LT s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN14-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLFireability-09 finished in 3107 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&!p0)))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 28 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:15:31] [INFO ] Computed 41 place invariants in 97 ms
[2022-05-20 21:15:31] [INFO ] Implicit Places using invariants in 191 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:15:31] [INFO ] Computed 41 place invariants in 92 ms
[2022-05-20 21:15:31] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
[2022-05-20 21:15:32] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:15:32] [INFO ] Computed 41 place invariants in 106 ms
[2022-05-20 21:15:33] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, p0, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s134 1) (LT s328 1) (LT s484 1)) (OR (LT s113 1) (LT s316 1) (LT s505 1)) (OR (LT s113 1) (LT s320 1) (LT s561 1)) (OR (LT s134 1) (LT s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 63130 steps with 366 reset in 10004 ms.
Product exploration timeout after 62770 steps with 364 reset in 10005 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 3 states, 5 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN14-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN14-LTLFireability-10 finished in 25085 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(G(F(X(X(X(F((F(p0)&&p0))))))) U p0))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 18 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:15:56] [INFO ] Computed 41 place invariants in 101 ms
[2022-05-20 21:15:56] [INFO ] Implicit Places using invariants in 208 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:15:56] [INFO ] Computed 41 place invariants in 97 ms
[2022-05-20 21:15:57] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2022-05-20 21:15:57] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:15:57] [INFO ] Computed 41 place invariants in 96 ms
[2022-05-20 21:15:58] [INFO ] Dead Transitions using invariants and state equation in 1037 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s134 1) (GEQ s328 1) (GEQ s484 1)) (AND (GEQ s113 1) (GEQ s316 1) (GEQ s505 1)) (AND (GEQ s113 1) (GEQ s320 1) (GEQ s561 1)) (AND (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 63690 steps with 369 reset in 10001 ms.
Product exploration timeout after 63230 steps with 367 reset in 10003 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN14-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN14-LTLFireability-12 finished in 24628 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((p0 U !p0) U !p0)))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 5 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:16:20] [INFO ] Computed 41 place invariants in 101 ms
[2022-05-20 21:16:20] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:16:20] [INFO ] Computed 41 place invariants in 107 ms
[2022-05-20 21:16:21] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:16:21] [INFO ] Computed 41 place invariants in 95 ms
[2022-05-20 21:16:22] [INFO ] Dead Transitions using invariants and state equation in 967 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s134 1) (GEQ s328 1) (GEQ s484 1)) (AND (GEQ s113 1) (GEQ s316 1) (GEQ s505 1)) (AND (GEQ s113 1) (GEQ s320 1) (GEQ s561 1)) (AND (GEQ s1...], 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 171 steps with 0 reset in 30 ms.
FORMULA Sudoku-COL-AN14-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLFireability-13 finished in 2261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p0)&&X(G(F(G(X(!(G(p0) U p0))))))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 18 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:16:22] [INFO ] Computed 41 place invariants in 96 ms
[2022-05-20 21:16:23] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:16:23] [INFO ] Computed 41 place invariants in 103 ms
[2022-05-20 21:16:23] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
[2022-05-20 21:16:24] [INFO ] Redundant transitions in 66 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:16:24] [INFO ] Computed 41 place invariants in 100 ms
[2022-05-20 21:16:25] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, true, p0]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s134 1) (GEQ s328 1) (GEQ s484 1)) (AND (GEQ s113 1) (GEQ s316 1) (GEQ s505 1)) (AND (GEQ s113 1) (GEQ s320 1) (GEQ s561 1)) (AND (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 63520 steps with 368 reset in 10002 ms.
Product exploration timeout after 62580 steps with 363 reset in 10003 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 3 states, 5 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN14-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN14-LTLFireability-14 finished in 24582 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||F(((F(G(p0))||F(!p0))&&p1))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 5 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:16:47] [INFO ] Computed 41 place invariants in 101 ms
[2022-05-20 21:16:47] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:16:47] [INFO ] Computed 41 place invariants in 93 ms
[2022-05-20 21:16:48] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-20 21:16:48] [INFO ] Computed 41 place invariants in 104 ms
[2022-05-20 21:16:49] [INFO ] Dead Transitions using invariants and state equation in 991 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN14-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s134 1) (LT s328 1) (LT s484 1)) (OR (LT s113 1) (LT s316 1) (LT s505 1)) (OR (LT s113 1) (LT s320 1) (LT s561 1)) (OR (LT s134 1) (LT s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 41790 steps with 20895 reset in 10001 ms.
Product exploration timeout after 41290 steps with 20645 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN14-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN14-LTLFireability-15 finished in 26365 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(G(p0)) U p0)||X(!p0))))'
[2022-05-20 21:17:14] [INFO ] Flatten gal took : 197 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12294275786082926252
[2022-05-20 21:17:14] [INFO ] Too many transitions (2744) to apply POR reductions. Disabling POR matrices.
[2022-05-20 21:17:14] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12294275786082926252
Running compilation step : cd /tmp/ltsmin12294275786082926252;'/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-20 21:17:14] [INFO ] Applying decomposition
[2022-05-20 21:17:14] [INFO ] Flatten gal took : 189 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/graph17803288534917167456.txt' '-o' '/tmp/graph17803288534917167456.bin' '-w' '/tmp/graph17803288534917167456.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17803288534917167456.bin' '-l' '-1' '-v' '-w' '/tmp/graph17803288534917167456.weights' '-q' '0' '-e' '0.001'
[2022-05-20 21:17:15] [INFO ] Decomposing Gal with order
[2022-05-20 21:17:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:17:15] [INFO ] Removed a total of 7644 redundant transitions.
[2022-05-20 21:17:15] [INFO ] Flatten gal took : 294 ms
[2022-05-20 21:17:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2022-05-20 21:17:15] [INFO ] Time to serialize gal into /tmp/LTLFireability6988180162718207007.gal : 13 ms
[2022-05-20 21:17:15] [INFO ] Time to serialize properties into /tmp/LTLFireability11350845946510631150.ltl : 35 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/LTLFireability6988180162718207007.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11350845946510631150.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...268
Read 1 LTL properties
Checking formula 0 : !((G(((X(G("(((((((((((((((u134.Rows_134>=1)&&(u328.Cells_132>=1))&&(u484.Columns_92>=1))||(((u113.Rows_113>=1)&&(u316.Cells_120>=1))&...549571
Formula 0 simplified : !G((XG"(((((((((((((((u134.Rows_134>=1)&&(u328.Cells_132>=1))&&(u484.Columns_92>=1))||(((u113.Rows_113>=1)&&(u316.Cells_120>=1))&&(u...549560
Compilation finished in 7650 ms.
Running link step : cd /tmp/ltsmin12294275786082926252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 696 ms.
Running LTSmin : cd /tmp/ltsmin12294275786082926252;'/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([]((LTLAPp0==true))) U (LTLAPp0==true))||X(!(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: LTL layer: formula: [](((X([]((LTLAPp0==true))) U (LTLAPp0==true))||X(!(LTLAPp0==true))))
pins2lts-mc-linux64( 0/ 8), 0.013: "[](((X([]((LTLAPp0==true))) U (LTLAPp0==true))||X(!(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.016: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.057: buchi has 4 states
pins2lts-mc-linux64( 0/ 8), 0.077: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.601: DFS-FIFO for weak LTL, using special progress label 2746
pins2lts-mc-linux64( 0/ 8), 0.602: There are 2747 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.602: State length is 589, there are 2751 groups
pins2lts-mc-linux64( 0/ 8), 0.602: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.602: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.602: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.602: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 15.974: ~1 levels ~960 states ~2566976 transitions
pins2lts-mc-linux64( 0/ 8), 27.758: ~1 levels ~1920 states ~5124880 transitions
pins2lts-mc-linux64( 0/ 8), 52.284: ~1 levels ~3840 states ~10240544 transitions
pins2lts-mc-linux64( 0/ 8), 100.372: ~1 levels ~7680 states ~20471568 transitions
pins2lts-mc-linux64( 0/ 8), 197.057: ~1 levels ~15360 states ~40933840 transitions
pins2lts-mc-linux64( 1/ 8), 218.934: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 295.419:
pins2lts-mc-linux64( 0/ 8), 295.420: mean standard work distribution: 0.6% (states) 0.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 295.420:
pins2lts-mc-linux64( 0/ 8), 295.420: Explored 16826 states 44929409 transitions, fanout: 2670.237
pins2lts-mc-linux64( 0/ 8), 295.420: Total exploration time 294.810 sec (220.760 sec minimum, 267.992 sec on average)
pins2lts-mc-linux64( 0/ 8), 295.420: States per second: 57, Transitions per second: 152401
pins2lts-mc-linux64( 0/ 8), 295.420:
pins2lts-mc-linux64( 0/ 8), 295.420: Progress states detected: 33684030
pins2lts-mc-linux64( 0/ 8), 295.420: Redundant explorations: -99.9501
pins2lts-mc-linux64( 0/ 8), 295.420:
pins2lts-mc-linux64( 0/ 8), 295.420: Queue width: 8B, total height: 37374688, memory: 285.15MB
pins2lts-mc-linux64( 0/ 8), 295.420: Tree memory: 513.0MB, 16.0 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 295.420: Tree fill ratio (roots/leafs): 25.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 295.420: Stored 3093 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 295.420: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 295.420: Est. total memory use: 798.2MB (~1309.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12294275786082926252;'/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([]((LTLAPp0==true))) U (LTLAPp0==true))||X(!(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12294275786082926252;'/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([]((LTLAPp0==true))) U (LTLAPp0==true))||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-20 21:39:01] [INFO ] Applying decomposition
[2022-05-20 21:39:02] [INFO ] Flatten gal took : 961 ms
[2022-05-20 21:39:03] [INFO ] Decomposing Gal with order
[2022-05-20 21:39:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 21:39:05] [INFO ] Removed a total of 6874 redundant transitions.
[2022-05-20 21:39:05] [INFO ] Flatten gal took : 1457 ms
[2022-05-20 21:39:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1001 ms.
[2022-05-20 21:39:06] [INFO ] Time to serialize gal into /tmp/LTLFireability2733258904965872462.gal : 20 ms
[2022-05-20 21:39:07] [INFO ] Time to serialize properties into /tmp/LTLFireability6097688657318596850.ltl : 29 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/LTLFireability2733258904965872462.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6097688657318596850.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...267
Read 1 LTL properties
Checking formula 0 : !((G(((X(G("(((((((((((((((NN134.Rows_134>=1)&&(NN132.Cells_132>=1))&&(NN92.Columns_92>=1))||(((NN113.Rows_113>=1)&&(NN120.Cells_120>=...565027
Formula 0 simplified : !G((XG"(((((((((((((((NN134.Rows_134>=1)&&(NN132.Cells_132>=1))&&(NN92.Columns_92>=1))||(((NN113.Rows_113>=1)&&(NN120.Cells_120>=1))...565016
Detected timeout of ITS tools.
[2022-05-20 22:01:02] [INFO ] Flatten gal took : 1310 ms
[2022-05-20 22:01:05] [INFO ] Input system was already deterministic with 2744 transitions.
[2022-05-20 22:01:05] [INFO ] Transformed 588 places.
[2022-05-20 22:01:05] [INFO ] Transformed 2744 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-20 22:01:05] [INFO ] Time to serialize gal into /tmp/LTLFireability2632349612088614960.gal : 13 ms
[2022-05-20 22:01:05] [INFO ] Time to serialize properties into /tmp/LTLFireability6148237364455594057.ltl : 24 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/LTLFireability2632349612088614960.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6148237364455594057.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 : !((G(((X(G("(((((((((((((((Rows_134>=1)&&(Cells_132>=1))&&(Columns_92>=1))||(((Rows_113>=1)&&(Cells_120>=1))&&(Columns_113>=1)))||((((...430711
Formula 0 simplified : !G((XG"(((((((((((((((Rows_134>=1)&&(Cells_132>=1))&&(Columns_92>=1))||(((Rows_113>=1)&&(Cells_120>=1))&&(Columns_113>=1)))||((((Row...430700
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-COL-AN14"
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-COL-AN14, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r258-tall-165303545300148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN14.tgz
mv Sudoku-COL-AN14 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;