Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r485-tall-167912699100236.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r485-tall-167912699100236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 36M
-rw-r--r-- 1 mcc users 411K Feb 26 09:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Feb 26 09:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Feb 26 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.4M Feb 26 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 162K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 543K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 487K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 673K Feb 26 10:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.2M Feb 26 10:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3M Feb 26 09:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16M Feb 26 09:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 74K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 184K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 564K Mar 5 18:23 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 1679189794473

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 01:36:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 01:36:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 01:36:36] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-19 01:36:36] [INFO ] Transformed 1300 places.
[2023-03-19 01:36:36] [INFO ] Transformed 1000 transitions.
[2023-03-19 01:36:36] [INFO ] Parsed PT model containing 1300 places and 1000 transitions and 4000 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 69 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLFireability-14 FALSE 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 29 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2023-03-19 01:36:37] [INFO ] Computed 29 place invariants in 63 ms
[2023-03-19 01:36:38] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-19 01:36:38] [INFO ] Invariant cache hit.
[2023-03-19 01:36:38] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2023-03-19 01:36:38] [INFO ] Invariant cache hit.
[2023-03-19 01:36:38] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 997 ms. Remains : 300/1300 places, 1000/1000 transitions.
Support contains 300 out of 300 places after structural reductions.
[2023-03-19 01:36:39] [INFO ] Flatten gal took : 243 ms
[2023-03-19 01:36:40] [INFO ] Flatten gal took : 231 ms
[2023-03-19 01:36:42] [INFO ] Input system was already deterministic with 1000 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 691 ms. (steps per millisecond=14 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4233 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:36:47] [INFO ] Invariant cache hit.
[2023-03-19 01:36:50] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||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.
[2023-03-19 01:36:51] [INFO ] Invariant cache hit.
[2023-03-19 01:36:51] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-19 01:36:51] [INFO ] Invariant cache hit.
[2023-03-19 01:36:52] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-19 01:36:52] [INFO ] Invariant cache hit.
[2023-03-19 01:36:52] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], 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, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 9420 ms.
Product exploration explored 100000 steps with 50000 reset in 9321 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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLFireability-00 finished in 24372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 5 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:37:16] [INFO ] Invariant cache hit.
[2023-03-19 01:37:16] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-19 01:37:16] [INFO ] Invariant cache hit.
[2023-03-19 01:37:16] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-19 01:37:16] [INFO ] Invariant cache hit.
[2023-03-19 01:37:16] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 660 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (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, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 9236 ms.
Product exploration explored 100000 steps with 50000 reset in 9304 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), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN10-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLFireability-01 finished in 23162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(!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.
[2023-03-19 01:37:39] [INFO ] Invariant cache hit.
[2023-03-19 01:37:39] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-19 01:37:39] [INFO ] Invariant cache hit.
[2023-03-19 01:37:39] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-19 01:37:39] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-19 01:37:39] [INFO ] Invariant cache hit.
[2023-03-19 01:37:39] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 705 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), p0]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], 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, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1145 reset in 5909 ms.
Product exploration explored 100000 steps with 1146 reset in 6001 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 : []
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Finished random walk after 89 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(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 14 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:37:56] [INFO ] Invariant cache hit.
[2023-03-19 01:37:56] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-19 01:37:56] [INFO ] Invariant cache hit.
[2023-03-19 01:37:56] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-19 01:37:56] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-19 01:37:56] [INFO ] Invariant cache hit.
[2023-03-19 01:37:57] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 686 ms. 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, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 84 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 9 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-02 finished in 22701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(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 10 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:38:01] [INFO ] Invariant cache hit.
[2023-03-19 01:38:01] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-19 01:38:01] [INFO ] Invariant cache hit.
[2023-03-19 01:38:02] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-19 01:38:02] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-19 01:38:02] [INFO ] Invariant cache hit.
[2023-03-19 01:38:02] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 639 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (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-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 9 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-03 finished in 749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(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 3 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:38:02] [INFO ] Invariant cache hit.
[2023-03-19 01:38:02] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-19 01:38:02] [INFO ] Invariant cache hit.
[2023-03-19 01:38:03] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-19 01:38:03] [INFO ] Invariant cache hit.
[2023-03-19 01:38:03] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 622 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-04 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 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 87 steps with 0 reset in 14 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-04 finished in 846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&(p1 U !p0)) U X(G(!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.
[2023-03-19 01:38:03] [INFO ] Invariant cache hit.
[2023-03-19 01:38:03] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-19 01:38:03] [INFO ] Invariant cache hit.
[2023-03-19 01:38:03] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-19 01:38:03] [INFO ] Invariant cache hit.
[2023-03-19 01:38:04] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 613 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 147 ms :[p0, true, p0, p0]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, 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, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1148 reset in 6778 ms.
Product exploration explored 100000 steps with 1145 reset in 6837 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 p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 450 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[p0, p0, p0, true]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 633 ms. (steps per millisecond=15 ) properties (out of 3) seen :2
Interrupted Best-First random walk after 7758 steps, including 2 resets, run timeout after 5606 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 1 properties.
[2023-03-19 01:38:29] [INFO ] Invariant cache hit.
[2023-03-19 01:38:33] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 368 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 117 ms :[p0, p0, p0, true]
[2023-03-19 01:38:35] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:38:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG p0
Could not prove EG 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 1 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:38:53] [INFO ] Invariant cache hit.
[2023-03-19 01:38:53] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-19 01:38:53] [INFO ] Invariant cache hit.
[2023-03-19 01:38:53] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-19 01:38:53] [INFO ] Invariant cache hit.
[2023-03-19 01:38:54] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 636 ms. 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, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[p0, p0, p0, true]
Finished random walk after 88 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=14 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0, true]
[2023-03-19 01:39:00] [INFO ] Invariant cache hit.
Could not prove EG p0
Stuttering acceptance computed with spot in 117 ms :[p0, p0, p0, true]
Product exploration explored 100000 steps with 1148 reset in 6226 ms.
Product exploration explored 100000 steps with 1147 reset in 6270 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 110 ms :[p0, p0, p0, true]
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 10 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:39:27] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-19 01:39:27] [INFO ] Invariant cache hit.
[2023-03-19 01:39:28] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 300/300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin12549422224655371716
[2023-03-19 01:39:28] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12549422224655371716
Running compilation step : cd /tmp/ltsmin12549422224655371716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2053 ms.
Running link step : cd /tmp/ltsmin12549422224655371716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 150 ms.
Running LTSmin : cd /tmp/ltsmin12549422224655371716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4291118889127883876.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 2 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:39:43] [INFO ] Invariant cache hit.
[2023-03-19 01:39:43] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-19 01:39:43] [INFO ] Invariant cache hit.
[2023-03-19 01:39:43] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-19 01:39:43] [INFO ] Invariant cache hit.
[2023-03-19 01:39:43] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 617 ms. Remains : 300/300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin8231872805357908977
[2023-03-19 01:39:43] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8231872805357908977
Running compilation step : cd /tmp/ltsmin8231872805357908977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1872 ms.
Running link step : cd /tmp/ltsmin8231872805357908977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8231872805357908977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5837388836610391202.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 01:39:59] [INFO ] Flatten gal took : 49 ms
[2023-03-19 01:39:59] [INFO ] Flatten gal took : 43 ms
[2023-03-19 01:39:59] [INFO ] Time to serialize gal into /tmp/LTL10071459277567096636.gal : 11 ms
[2023-03-19 01:39:59] [INFO ] Time to serialize properties into /tmp/LTL2693777830365228558.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10071459277567096636.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13610759086312330211.hoa' '-atoms' '/tmp/LTL2693777830365228558.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2693777830365228558.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13610759086312330211.hoa
Detected timeout of ITS tools.
[2023-03-19 01:40:15] [INFO ] Flatten gal took : 82 ms
[2023-03-19 01:40:15] [INFO ] Flatten gal took : 81 ms
[2023-03-19 01:40:15] [INFO ] Time to serialize gal into /tmp/LTL7889712487348387329.gal : 6 ms
[2023-03-19 01:40:15] [INFO ] Time to serialize properties into /tmp/LTL3453639203826705428.ltl : 39 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7889712487348387329.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3453639203826705428.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((("((((((((((((((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_...275046
Formula 0 simplified : (!"(((((((((((((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_2_4...275032
Detected timeout of ITS tools.
[2023-03-19 01:40:30] [INFO ] Flatten gal took : 79 ms
[2023-03-19 01:40:30] [INFO ] Applying decomposition
[2023-03-19 01:40:30] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8825254820566202034.txt' '-o' '/tmp/graph8825254820566202034.bin' '-w' '/tmp/graph8825254820566202034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8825254820566202034.bin' '-l' '-1' '-v' '-w' '/tmp/graph8825254820566202034.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:40:30] [INFO ] Decomposing Gal with order
[2023-03-19 01:40:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:40:30] [INFO ] Removed a total of 2700 redundant transitions.
[2023-03-19 01:40:30] [INFO ] Flatten gal took : 200 ms
[2023-03-19 01:40:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2023-03-19 01:40:31] [INFO ] Time to serialize gal into /tmp/LTL5441921967946145067.gal : 10 ms
[2023-03-19 01:40:31] [INFO ] Time to serialize properties into /tmp/LTL1235211633583653929.ltl : 26 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5441921967946145067.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1235211633583653929.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((("((((((((((((((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....344546
Formula 0 simplified : (!"(((((((((((((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.Col...344532
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3224925457917464108
[2023-03-19 01:40:46] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3224925457917464108
Running compilation step : cd /tmp/ltsmin3224925457917464108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2681 ms.
Running link step : cd /tmp/ltsmin3224925457917464108;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin3224925457917464108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((((LTLAPp0==true) U !(LTLAPp1==true))&&(LTLAPp1==true)) U X([](!(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN10-LTLFireability-05 finished in 177764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(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.
[2023-03-19 01:41:01] [INFO ] Invariant cache hit.
[2023-03-19 01:41:01] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 01:41:01] [INFO ] Invariant cache hit.
[2023-03-19 01:41:01] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-19 01:41:01] [INFO ] Invariant cache hit.
[2023-03-19 01:41:01] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 639 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], 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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 11 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-06 finished in 921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!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 10 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:41:02] [INFO ] Invariant cache hit.
[2023-03-19 01:41:02] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-19 01:41:02] [INFO ] Invariant cache hit.
[2023-03-19 01:41:02] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-19 01:41:02] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-19 01:41:02] [INFO ] Invariant cache hit.
[2023-03-19 01:41:02] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 640 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-07 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 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-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1147 reset in 6205 ms.
Product exploration explored 100000 steps with 1146 reset in 6335 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 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN10-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLFireability-07 finished in 17280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 12 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 71 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:41:19] [INFO ] Invariant cache hit.
[2023-03-19 01:41:19] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-19 01:41:19] [INFO ] Invariant cache hit.
[2023-03-19 01:41:20] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
[2023-03-19 01:41:20] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-19 01:41:20] [INFO ] Invariant cache hit.
[2023-03-19 01:41:20] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1383 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s76 1) (GEQ s171 1) (GEQ s216 1) (GEQ s70 1) (GEQ s178 1) (GEQ s280 1)), p0:(OR (AND (GEQ s68 1) (GEQ s167 1) (GEQ s278 1)) (AND (GEQ s11 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 11 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-08 finished in 1474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
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 19 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:41:20] [INFO ] Invariant cache hit.
[2023-03-19 01:41:21] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-19 01:41:21] [INFO ] Invariant cache hit.
[2023-03-19 01:41:22] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
[2023-03-19 01:41:22] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-19 01:41:22] [INFO ] Invariant cache hit.
[2023-03-19 01:41:22] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1388 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (LT s36 1) (LT s130 1) (LT s206 1)), p0:(OR (LT s79 1) (LT s177 1) (LT s279 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 95230 steps with 3463 reset in 10001 ms.
Product exploration timeout after 94630 steps with 3464 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 p1) (NOT p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 229 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLFireability-09 finished in 25212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(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 17 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:41:46] [INFO ] Invariant cache hit.
[2023-03-19 01:41:46] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-19 01:41:46] [INFO ] Invariant cache hit.
[2023-03-19 01:41:47] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
[2023-03-19 01:41:47] [INFO ] Invariant cache hit.
[2023-03-19 01:41:47] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1336 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-10 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:(AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 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 21 steps with 0 reset in 8 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-10 finished in 1451 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)&&p0))||F((X(p1)&&p2))))'
Support contains 9 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.
[2023-03-19 01:41:47] [INFO ] Invariant cache hit.
[2023-03-19 01:41:47] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-19 01:41:47] [INFO ] Invariant cache hit.
[2023-03-19 01:41:48] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
[2023-03-19 01:41:48] [INFO ] Invariant cache hit.
[2023-03-19 01:41:48] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1305 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s92 1) (GEQ s191 1) (GEQ s212 1)), p1:(OR (LT s70 1) (LT s176 1) (LT s260 1)), p0:(AND (GEQ s84 1) (GEQ s182 1) (GEQ s224 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 11 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-11 finished in 1568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(X(!p1)&&F(!p2))||X(G(!p1)))))'
Support contains 9 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.
[2023-03-19 01:41:49] [INFO ] Invariant cache hit.
[2023-03-19 01:41:49] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-19 01:41:49] [INFO ] Invariant cache hit.
[2023-03-19 01:41:50] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
[2023-03-19 01:41:50] [INFO ] Invariant cache hit.
[2023-03-19 01:41:50] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1298 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) p1), p1, (AND p1 p2), (AND (NOT p0) p1), true, p2, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s58 1) (GEQ s155 1) (GEQ s258 1)), p2:(AND (GEQ s13 1) (GEQ s116 1) (GEQ s263 1)), p1:(AND (GEQ s70 1) (GEQ s172 1) (GEQ s220 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38 steps with 1 reset in 8 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-12 finished in 1570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(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.
[2023-03-19 01:41:50] [INFO ] Invariant cache hit.
[2023-03-19 01:41:51] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-19 01:41:51] [INFO ] Invariant cache hit.
[2023-03-19 01:41:51] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
[2023-03-19 01:41:51] [INFO ] Invariant cache hit.
[2023-03-19 01:41:52] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1311 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (GEQ s18 1) (GEQ s111 1) (GEQ s218 1) (GEQ s22 1) (GEQ s129 1) (GEQ s292 1)), p0:(AND (GEQ s22 1) (GEQ s129 1) (GEQ s292 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 7 reset in 4 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-15 finished in 1454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&(p1 U !p0)) U X(G(!p0))))'
Found a Lengthening insensitive property : Sudoku-PT-AN10-LTLFireability-05
Stuttering acceptance computed with spot in 112 ms :[p0, true, p0, p0]
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LI_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.
[2023-03-19 01:41:52] [INFO ] Invariant cache hit.
[2023-03-19 01:41:52] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-19 01:41:52] [INFO ] Invariant cache hit.
[2023-03-19 01:41:52] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-19 01:41:52] [INFO ] Invariant cache hit.
[2023-03-19 01:41:53] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 614 ms. Remains : 300/300 places, 1000/1000 transitions.
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=2, 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, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1147 reset in 6999 ms.
Product exploration explored 100000 steps with 1146 reset in 6963 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 p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 334 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[p0, p0, p0, true]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 3) seen :2
Interrupted Best-First random walk after 7758 steps, including 2 resets, run timeout after 5636 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 1 properties.
[2023-03-19 01:42:18] [INFO ] Invariant cache hit.
[2023-03-19 01:42:22] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 382 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 413 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 126 ms :[p0, p0, p0, true]
[2023-03-19 01:42:24] [INFO ] Invariant cache hit.
Could not prove EG 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 1 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:42:39] [INFO ] Invariant cache hit.
[2023-03-19 01:42:39] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-19 01:42:39] [INFO ] Invariant cache hit.
[2023-03-19 01:42:40] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-19 01:42:40] [INFO ] Invariant cache hit.
[2023-03-19 01:42:40] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 604 ms. 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, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[p0, p0, p0, true]
Finished random walk after 86 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 205 ms :[p0, p0, p0, true]
[2023-03-19 01:42:46] [INFO ] Invariant cache hit.
Could not prove EG p0
Stuttering acceptance computed with spot in 133 ms :[p0, p0, p0, true]
Product exploration explored 100000 steps with 1146 reset in 6292 ms.
Product exploration explored 100000 steps with 1146 reset in 6317 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 126 ms :[p0, p0, p0, true]
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.
[2023-03-19 01:43:14] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-19 01:43:14] [INFO ] Invariant cache hit.
[2023-03-19 01:43:15] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 322 ms. Remains : 300/300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin5862806882468436871
[2023-03-19 01:43:15] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5862806882468436871
Running compilation step : cd /tmp/ltsmin5862806882468436871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1980 ms.
Running link step : cd /tmp/ltsmin5862806882468436871;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5862806882468436871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3552285314427614572.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.
[2023-03-19 01:43:30] [INFO ] Invariant cache hit.
[2023-03-19 01:43:30] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-19 01:43:30] [INFO ] Invariant cache hit.
[2023-03-19 01:43:30] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-19 01:43:30] [INFO ] Invariant cache hit.
[2023-03-19 01:43:31] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 623 ms. Remains : 300/300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin2472351544475398946
[2023-03-19 01:43:31] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2472351544475398946
Running compilation step : cd /tmp/ltsmin2472351544475398946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1974 ms.
Running link step : cd /tmp/ltsmin2472351544475398946;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2472351544475398946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13175104697285580036.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 01:43:46] [INFO ] Flatten gal took : 37 ms
[2023-03-19 01:43:46] [INFO ] Flatten gal took : 36 ms
[2023-03-19 01:43:46] [INFO ] Time to serialize gal into /tmp/LTL6090899730571965782.gal : 4 ms
[2023-03-19 01:43:46] [INFO ] Time to serialize properties into /tmp/LTL12476837692776670380.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6090899730571965782.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6691864895574633200.hoa' '-atoms' '/tmp/LTL12476837692776670380.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12476837692776670380.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6691864895574633200.hoa
Detected timeout of ITS tools.
[2023-03-19 01:44:01] [INFO ] Flatten gal took : 75 ms
[2023-03-19 01:44:02] [INFO ] Flatten gal took : 75 ms
[2023-03-19 01:44:02] [INFO ] Time to serialize gal into /tmp/LTL2163137577266015593.gal : 4 ms
[2023-03-19 01:44:02] [INFO ] Time to serialize properties into /tmp/LTL16801119256306063445.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2163137577266015593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16801119256306063445.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((("((((((((((((((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_...275046
Formula 0 simplified : (!"(((((((((((((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_2_4...275032
Detected timeout of ITS tools.
[2023-03-19 01:44:17] [INFO ] Flatten gal took : 76 ms
[2023-03-19 01:44:17] [INFO ] Applying decomposition
[2023-03-19 01:44:17] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12486331137432882069.txt' '-o' '/tmp/graph12486331137432882069.bin' '-w' '/tmp/graph12486331137432882069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12486331137432882069.bin' '-l' '-1' '-v' '-w' '/tmp/graph12486331137432882069.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:44:17] [INFO ] Decomposing Gal with order
[2023-03-19 01:44:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:44:17] [INFO ] Removed a total of 2700 redundant transitions.
[2023-03-19 01:44:17] [INFO ] Flatten gal took : 109 ms
[2023-03-19 01:44:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2023-03-19 01:44:17] [INFO ] Time to serialize gal into /tmp/LTL10457711307906550190.gal : 5 ms
[2023-03-19 01:44:17] [INFO ] Time to serialize properties into /tmp/LTL16539339708134985444.ltl : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10457711307906550190.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16539339708134985444.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((((("((((((((((((((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....344546
Formula 0 simplified : (!"(((((((((((((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.Col...344532
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11276770409677857696
[2023-03-19 01:44:32] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11276770409677857696
Running compilation step : cd /tmp/ltsmin11276770409677857696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2730 ms.
Running link step : cd /tmp/ltsmin11276770409677857696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11276770409677857696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((((LTLAPp0==true) U !(LTLAPp1==true))&&(LTLAPp1==true)) U X([](!(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN10-LTLFireability-05 finished in 175648 ms.
[2023-03-19 01:44:47] [INFO ] Flatten gal took : 67 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8728581410124585401
[2023-03-19 01:44:48] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2023-03-19 01:44:48] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:44:48] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2023-03-19 01:44:48] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:44:48] [INFO ] Applying decomposition
[2023-03-19 01:44:48] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2124935225451936221.txt' '-o' '/tmp/graph2124935225451936221.bin' '-w' '/tmp/graph2124935225451936221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2124935225451936221.bin' '-l' '-1' '-v' '-w' '/tmp/graph2124935225451936221.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:44:48] [INFO ] Decomposing Gal with order
[2023-03-19 01:44:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:44:48] [INFO ] Removed a total of 2700 redundant transitions.
[2023-03-19 01:44:48] [INFO ] Flatten gal took : 119 ms
[2023-03-19 01:44:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2023-03-19 01:44:48] [INFO ] Time to serialize gal into /tmp/LTLFireability9707865107088564402.gal : 4 ms
[2023-03-19 01:44:48] [INFO ] Time to serialize properties into /tmp/LTLFireability4428833226216377115.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9707865107088564402.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4428833226216377115.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(((((((((((((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.Co...344546
Formula 0 simplified : (!"(((((((((((((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.Col...344532
[2023-03-19 01:44:48] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2023-03-19 01:44:48] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:44:48] [INFO ] Built C files in 776ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8728581410124585401
Running compilation step : cd /tmp/ltsmin8728581410124585401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 3819 ms.
Running link step : cd /tmp/ltsmin8728581410124585401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin8728581410124585401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true)&&((LTLAPp1==true) U !(LTLAPp0==true))) U 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( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.107: LTL layer: formula: (((LTLAPp0==true)&&((LTLAPp1==true) U !(LTLAPp0==true))) U X([](!(LTLAPp0==true))))
pins2lts-mc-linux64( 0/ 8), 0.107: "(((LTLAPp0==true)&&((LTLAPp1==true) U !(LTLAPp0==true))) U X([](!(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.107: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.110: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.112: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.114: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.115: buchi has 4 states
pins2lts-mc-linux64( 7/ 8), 0.115: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.135: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.139: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.144: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.148: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.335: DFS-FIFO for weak LTL, using special progress label 1003
pins2lts-mc-linux64( 0/ 8), 0.335: There are 1004 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.335: State length is 301, there are 1009 groups
pins2lts-mc-linux64( 0/ 8), 0.335: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.335: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.335: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.335: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 1.476: ~90 levels ~960 states ~214056 transitions
pins2lts-mc-linux64( 6/ 8), 1.499: ~90 levels ~1920 states ~217648 transitions
pins2lts-mc-linux64( 3/ 8), 1.545: ~88 levels ~3840 states ~225232 transitions
pins2lts-mc-linux64( 7/ 8), 1.633: ~84 levels ~7680 states ~236840 transitions
pins2lts-mc-linux64( 7/ 8), 1.819: ~84 levels ~15360 states ~277272 transitions
pins2lts-mc-linux64( 3/ 8), 2.216: ~88 levels ~30720 states ~366680 transitions
pins2lts-mc-linux64( 1/ 8), 3.063: ~89 levels ~61440 states ~547192 transitions
pins2lts-mc-linux64( 3/ 8), 4.744: ~88 levels ~122880 states ~930904 transitions
pins2lts-mc-linux64( 3/ 8), 8.031: ~88 levels ~245760 states ~1741040 transitions
pins2lts-mc-linux64( 3/ 8), 14.585: ~88 levels ~491520 states ~3422840 transitions
pins2lts-mc-linux64( 3/ 8), 28.052: ~88 levels ~983040 states ~7078896 transitions
pins2lts-mc-linux64( 3/ 8), 54.668: ~90 levels ~1966080 states ~14418536 transitions
pins2lts-mc-linux64( 4/ 8), 110.427: ~87 levels ~3932160 states ~30834368 transitions
pins2lts-mc-linux64( 2/ 8), 223.014: ~90 levels ~7864320 states ~64656808 transitions
pins2lts-mc-linux64( 2/ 8), 455.119: ~90 levels ~15728640 states ~134548192 transitions
pins2lts-mc-linux64( 4/ 8), 625.497: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 625.557:
pins2lts-mc-linux64( 0/ 8), 625.557: mean standard work distribution: 1.4% (states) 1.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 625.557:
pins2lts-mc-linux64( 0/ 8), 625.557: Explored 20711842 states 185028240 transitions, fanout: 8.933
pins2lts-mc-linux64( 0/ 8), 625.557: Total exploration time 625.220 sec (625.150 sec minimum, 625.181 sec on average)
pins2lts-mc-linux64( 0/ 8), 625.557: States per second: 33127, Transitions per second: 295941
pins2lts-mc-linux64( 0/ 8), 625.557:
pins2lts-mc-linux64( 0/ 8), 625.557: Progress states detected: 5155
pins2lts-mc-linux64( 0/ 8), 625.557: Redundant explorations: -0.9987
pins2lts-mc-linux64( 0/ 8), 625.557:
pins2lts-mc-linux64( 0/ 8), 625.557: Queue width: 8B, total height: 5880, memory: 0.04MB
pins2lts-mc-linux64( 0/ 8), 625.557: Tree memory: 415.6MB, 20.8 B/state, compr.: 1.7%
pins2lts-mc-linux64( 0/ 8), 625.557: Tree fill ratio (roots/leafs): 15.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 625.557: Stored 1044 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 625.557: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 625.557: Est. total memory use: 415.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8728581410124585401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true)&&((LTLAPp1==true) U !(LTLAPp0==true))) U X([](!(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8728581410124585401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true)&&((LTLAPp1==true) U !(LTLAPp0==true))) U X([](!(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-19 02:07:34] [INFO ] Flatten gal took : 373 ms
[2023-03-19 02:07:34] [INFO ] Time to serialize gal into /tmp/LTLFireability5012795704910505883.gal : 30 ms
[2023-03-19 02:07:34] [INFO ] Time to serialize properties into /tmp/LTLFireability8583604009607279913.ltl : 97 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5012795704910505883.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8583604009607279913.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !(((("(((((((((((((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_2_...275046
Formula 0 simplified : (!"(((((((((((((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_2_4...275032
Detected timeout of ITS tools.
[2023-03-19 02:30:25] [INFO ] Flatten gal took : 866 ms
[2023-03-19 02:30:26] [INFO ] Input system was already deterministic with 1000 transitions.
[2023-03-19 02:30:26] [INFO ] Transformed 300 places.
[2023-03-19 02:30:26] [INFO ] Transformed 1000 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
java.lang.NullPointerException: Cannot read the array length because "order" is null
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.computeOrderWithGreatSPN(MultiOrderRunner.java:60)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:143)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:815)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 02:30:29] [INFO ] Time to serialize gal into /tmp/LTLFireability17835958713271617212.gal : 10 ms
[2023-03-19 02:30:29] [INFO ] Time to serialize properties into /tmp/LTLFireability2745841038114760275.ltl : 142 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17835958713271617212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2745841038114760275.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((("(((((((((((((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_2_...275046
Formula 0 simplified : (!"(((((((((((((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_2_4...275032
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 7830532 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16231336 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-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-5348"
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 r485-tall-167912699100236"
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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;