Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r417-tall-171690556100277.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Sudoku-COL-AN05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556100277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 6.0K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 11:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 11:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 11:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 11:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 11:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717132640877

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN05
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-31 05:17:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 05:17:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 05:17:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 05:17:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 05:17:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 2905 ms
[2024-05-31 05:17:25] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 200 PT places and 125.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 05:17:25] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 6 ms.
[2024-05-31 05:17:25] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-COL-AN05-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10016 steps, including 370 resets, run finished after 55 ms. (steps per millisecond=182 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 17 ms. (steps per millisecond=589 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1 rows 4 cols
[2024-05-31 05:17:25] [INFO ] Computed 3 invariants in 7 ms
[2024-05-31 05:17:25] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 05:17:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 05:17:25] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2024-05-31 05:17:25] [INFO ] Flatten gal took : 13 ms
[2024-05-31 05:17:25] [INFO ] Flatten gal took : 1 ms
Domain [N(5), N(5)] of place Rows breaks symmetries in sort N
[2024-05-31 05:17:25] [INFO ] Unfolded HLPN to a Petri net with 200 places and 125 transitions 500 arcs in 11 ms.
[2024-05-31 05:17:25] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 200 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2024-05-31 05:17:26] [INFO ] Computed 75 invariants in 12 ms
[2024-05-31 05:17:26] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-31 05:17:26] [INFO ] Invariant cache hit.
[2024-05-31 05:17:26] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-05-31 05:17:26] [INFO ] Invariant cache hit.
[2024-05-31 05:17:26] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 200/200 places, 125/125 transitions.
Support contains 200 out of 200 places after structural reductions.
[2024-05-31 05:17:26] [INFO ] Flatten gal took : 22 ms
[2024-05-31 05:17:26] [INFO ] Flatten gal took : 19 ms
[2024-05-31 05:17:26] [INFO ] Input system was already deterministic with 125 transitions.
Incomplete random walk after 10000 steps, including 455 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 05:17:27] [INFO ] Invariant cache hit.
[2024-05-31 05:17:27] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 05:17:27] [INFO ] [Nat]Absence check using 75 positive place invariants in 20 ms returned sat
[2024-05-31 05:17:27] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p0&&F(p1)))||(p0&&G(F(p1))&&F(!p0))))))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:17:27] [INFO ] Invariant cache hit.
[2024-05-31 05:17:27] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 05:17:27] [INFO ] Invariant cache hit.
[2024-05-31 05:17:27] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-31 05:17:27] [INFO ] Invariant cache hit.
[2024-05-31 05:17:28] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 200/200 places, 125/125 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 458 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 0}]], initial=7, aps=[p1:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24) (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-02 finished in 851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 18 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:17:28] [INFO ] Invariant cache hit.
[2024-05-31 05:17:28] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 05:17:28] [INFO ] Invariant cache hit.
[2024-05-31 05:17:28] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-31 05:17:28] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 05:17:28] [INFO ] Invariant cache hit.
[2024-05-31 05:17:28] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 326 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174) (ADD s25 s26 s27...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-03 finished in 376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:17:28] [INFO ] Invariant cache hit.
[2024-05-31 05:17:28] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 05:17:28] [INFO ] Invariant cache hit.
[2024-05-31 05:17:29] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-31 05:17:29] [INFO ] Invariant cache hit.
[2024-05-31 05:17:29] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GT (ADD s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199) (ADD s25 s26 s27...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-05 finished in 453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&(p1||X(F(p0))))))))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:17:29] [INFO ] Invariant cache hit.
[2024-05-31 05:17:29] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 05:17:29] [INFO ] Invariant cache hit.
[2024-05-31 05:17:29] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-31 05:17:29] [INFO ] Invariant cache hit.
[2024-05-31 05:17:29] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 1 (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174)), p1:(LEQ 1 (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1365 ms.
Product exploration explored 100000 steps with 33333 reset in 1369 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 25 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN05-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLCardinality-06 finished in 3335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:17:32] [INFO ] Invariant cache hit.
[2024-05-31 05:17:32] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-31 05:17:32] [INFO ] Invariant cache hit.
[2024-05-31 05:17:32] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-31 05:17:32] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 05:17:32] [INFO ] Invariant cache hit.
[2024-05-31 05:17:32] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-07 finished in 396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 50 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 5 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2024-05-31 05:17:33] [INFO ] Computed 14 invariants in 7 ms
[2024-05-31 05:17:33] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 05:17:33] [INFO ] Invariant cache hit.
[2024-05-31 05:17:33] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-31 05:17:33] [INFO ] Invariant cache hit.
[2024-05-31 05:17:33] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 1 (ADD s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74)), p0:(LEQ 3 (ADD s25 s26 s27 s28 s29 s...], 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]]
Entered a terminal (fully accepting) state of product in 2330 steps with 106 reset in 25 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-10 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2024-05-31 05:17:33] [INFO ] Computed 75 invariants in 1 ms
[2024-05-31 05:17:33] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 05:17:33] [INFO ] Invariant cache hit.
[2024-05-31 05:17:33] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-31 05:17:33] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 05:17:33] [INFO ] Invariant cache hit.
[2024-05-31 05:17:33] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174) (ADD s25 s26 s27...], 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 4547 reset in 1230 ms.
Product exploration explored 100000 steps with 4554 reset in 1250 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 49 ms :[p0]
[2024-05-31 05:17:36] [INFO ] Invariant cache hit.
[2024-05-31 05:17:36] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2024-05-31 05:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:17:36] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-31 05:17:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:17:37] [INFO ] [Nat]Absence check using 75 positive place invariants in 35 ms returned sat
[2024-05-31 05:17:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:17:37] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2024-05-31 05:17:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-31 05:17:37] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Could not prove EG p0
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:17:37] [INFO ] Invariant cache hit.
[2024-05-31 05:17:37] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 05:17:37] [INFO ] Invariant cache hit.
[2024-05-31 05:17:37] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-31 05:17:37] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 05:17:37] [INFO ] Invariant cache hit.
[2024-05-31 05:17:37] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 337 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[p0]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p0]
Stuttering acceptance computed with spot in 42 ms :[p0]
[2024-05-31 05:17:38] [INFO ] Invariant cache hit.
[2024-05-31 05:17:38] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2024-05-31 05:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:17:38] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-31 05:17:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:17:38] [INFO ] [Nat]Absence check using 75 positive place invariants in 35 ms returned sat
[2024-05-31 05:17:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:17:38] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-31 05:17:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-31 05:17:38] [INFO ] Added : 0 causal constraints over 0 iterations in 36 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 32 ms :[p0]
Product exploration explored 100000 steps with 4556 reset in 1167 ms.
Product exploration explored 100000 steps with 4549 reset in 1214 ms.
Built C files in :
/tmp/ltsmin17689840454358918546
[2024-05-31 05:17:41] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2024-05-31 05:17:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:17:41] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2024-05-31 05:17:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:17:41] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2024-05-31 05:17:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:17:41] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17689840454358918546
Running compilation step : cd /tmp/ltsmin17689840454358918546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 534 ms.
Running link step : cd /tmp/ltsmin17689840454358918546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17689840454358918546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2554718783621010165.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:17:56] [INFO ] Invariant cache hit.
[2024-05-31 05:17:56] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-31 05:17:56] [INFO ] Invariant cache hit.
[2024-05-31 05:17:56] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-31 05:17:56] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 05:17:56] [INFO ] Invariant cache hit.
[2024-05-31 05:17:56] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 200/200 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin7692010265963729128
[2024-05-31 05:17:56] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2024-05-31 05:17:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:17:56] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2024-05-31 05:17:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:17:56] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2024-05-31 05:17:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:17:56] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7692010265963729128
Running compilation step : cd /tmp/ltsmin7692010265963729128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 286 ms.
Running link step : cd /tmp/ltsmin7692010265963729128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7692010265963729128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11690028896093548166.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 05:18:11] [INFO ] Flatten gal took : 14 ms
[2024-05-31 05:18:11] [INFO ] Flatten gal took : 13 ms
[2024-05-31 05:18:11] [INFO ] Time to serialize gal into /tmp/LTL6918095975602658481.gal : 4 ms
[2024-05-31 05:18:11] [INFO ] Time to serialize properties into /tmp/LTL13165890203085194891.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6918095975602658481.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13702759972046029487.hoa' '-atoms' '/tmp/LTL13165890203085194891.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13165890203085194891.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13702759972046029487.hoa
Detected timeout of ITS tools.
[2024-05-31 05:18:26] [INFO ] Flatten gal took : 11 ms
[2024-05-31 05:18:26] [INFO ] Flatten gal took : 10 ms
[2024-05-31 05:18:26] [INFO ] Time to serialize gal into /tmp/LTL3169423054753918390.gal : 2 ms
[2024-05-31 05:18:26] [INFO ] Time to serialize properties into /tmp/LTL15483780610415452330.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3169423054753918390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15483780610415452330.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...1687
Formula 0 simplified : GF!"((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Cell...1681
Detected timeout of ITS tools.
[2024-05-31 05:18:41] [INFO ] Flatten gal took : 15 ms
[2024-05-31 05:18:41] [INFO ] Applying decomposition
[2024-05-31 05:18:41] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17177502282358086622.txt' '-o' '/tmp/graph17177502282358086622.bin' '-w' '/tmp/graph17177502282358086622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17177502282358086622.bin' '-l' '-1' '-v' '-w' '/tmp/graph17177502282358086622.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:18:41] [INFO ] Decomposing Gal with order
[2024-05-31 05:18:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:18:42] [INFO ] Removed a total of 180 redundant transitions.
[2024-05-31 05:18:42] [INFO ] Flatten gal took : 58 ms
[2024-05-31 05:18:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-31 05:18:42] [INFO ] Time to serialize gal into /tmp/LTL2975345031895613351.gal : 3 ms
[2024-05-31 05:18:42] [INFO ] Time to serialize properties into /tmp/LTL9684316859367802179.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2975345031895613351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9684316859367802179.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((gu44.Cells_0+gu44.Cells_1)+(gu44.Cells_2+gu44.Cells_3))+((gu44.Cells_4+gu44.Cells_5)+(gu44.Cells_6+gu44.Cells_7)))+(((gu...2437
Formula 0 simplified : GF!"((((((gu44.Cells_0+gu44.Cells_1)+(gu44.Cells_2+gu44.Cells_3))+((gu44.Cells_4+gu44.Cells_5)+(gu44.Cells_6+gu44.Cells_7)))+(((gu44...2431
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15646170807615311135
[2024-05-31 05:18:57] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15646170807615311135
Running compilation step : cd /tmp/ltsmin15646170807615311135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 266 ms.
Running link step : cd /tmp/ltsmin15646170807615311135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15646170807615311135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN05-LTLCardinality-11 finished in 98901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 10 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:19:12] [INFO ] Invariant cache hit.
[2024-05-31 05:19:12] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-31 05:19:12] [INFO ] Invariant cache hit.
[2024-05-31 05:19:12] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-31 05:19:12] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 05:19:12] [INFO ] Invariant cache hit.
[2024-05-31 05:19:12] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 338 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 90 steps with 5 reset in 5 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-12 finished in 478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(F(G(p1))&&(p0 U p1)))))'
Support contains 50 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 3 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2024-05-31 05:19:12] [INFO ] Computed 14 invariants in 2 ms
[2024-05-31 05:19:12] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 05:19:12] [INFO ] Invariant cache hit.
[2024-05-31 05:19:12] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-31 05:19:12] [INFO ] Invariant cache hit.
[2024-05-31 05:19:12] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 3 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49)), p0:(LEQ 2 (ADD s50 s51 s52 s53 s54 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33443 reset in 1270 ms.
Product exploration explored 100000 steps with 33415 reset in 1259 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 496 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Finished random walk after 3682 steps, including 168 resets, run visited all 5 properties in 79 ms. (steps per millisecond=46 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 320 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 50 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:19:17] [INFO ] Invariant cache hit.
[2024-05-31 05:19:17] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-31 05:19:17] [INFO ] Invariant cache hit.
[2024-05-31 05:19:17] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-31 05:19:17] [INFO ] Invariant cache hit.
[2024-05-31 05:19:17] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 75/75 places, 125/125 transitions.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 154 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Finished random walk after 307 steps, including 13 resets, run visited all 5 properties in 15 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 334 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 33313 reset in 1280 ms.
Product exploration explored 100000 steps with 33417 reset in 1293 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 50 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-31 05:19:22] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 05:19:22] [INFO ] Invariant cache hit.
[2024-05-31 05:19:22] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 75/75 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin10019765251110776610
[2024-05-31 05:19:22] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10019765251110776610
Running compilation step : cd /tmp/ltsmin10019765251110776610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 229 ms.
Running link step : cd /tmp/ltsmin10019765251110776610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10019765251110776610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15713704507660949330.hoa' '--buchi-type=spotba'
LTSmin run took 1266 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-COL-AN05-LTLCardinality-13 finished in 11226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G((p0||G(p1)))||(G(p2)&&(p0||G(p1))))))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2024-05-31 05:19:24] [INFO ] Computed 75 invariants in 2 ms
[2024-05-31 05:19:24] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 05:19:24] [INFO ] Invariant cache hit.
[2024-05-31 05:19:24] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-31 05:19:24] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 05:19:24] [INFO ] Invariant cache hit.
[2024-05-31 05:19:24] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 268 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(LEQ 3 (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174)), p1:(GT (ADD...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 213 steps with 9 reset in 7 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-14 finished in 499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 25 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 6 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2024-05-31 05:19:24] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 05:19:24] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 05:19:24] [INFO ] Invariant cache hit.
[2024-05-31 05:19:24] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-31 05:19:24] [INFO ] Invariant cache hit.
[2024-05-31 05:19:24] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 830 ms.
Product exploration explored 100000 steps with 50000 reset in 872 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN05-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLCardinality-15 finished in 2068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
[2024-05-31 05:19:26] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
[2024-05-31 05:19:26] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin13932899983274606020
[2024-05-31 05:19:26] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2024-05-31 05:19:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:19:26] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2024-05-31 05:19:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:19:26] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2024-05-31 05:19:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:19:26] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13932899983274606020
Running compilation step : cd /tmp/ltsmin13932899983274606020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-31 05:19:26] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2294163512862703132.txt' '-o' '/tmp/graph2294163512862703132.bin' '-w' '/tmp/graph2294163512862703132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2294163512862703132.bin' '-l' '-1' '-v' '-w' '/tmp/graph2294163512862703132.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:19:26] [INFO ] Decomposing Gal with order
[2024-05-31 05:19:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:19:26] [INFO ] Removed a total of 150 redundant transitions.
[2024-05-31 05:19:26] [INFO ] Flatten gal took : 30 ms
[2024-05-31 05:19:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 3 ms.
[2024-05-31 05:19:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality8280977024886429504.gal : 2 ms
[2024-05-31 05:19:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality4723639997973386359.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8280977024886429504.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4723639997973386359.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((gu35.Cells_0+gu35.Cells_1)+(gu35.Cells_2+gu35.Cells_3))+((gu35.Cells_4+gu35.Cells_5)+(gu35.Cells_6+gu35.Cells_7)))+(((gu...2437
Formula 0 simplified : GF!"((((((gu35.Cells_0+gu35.Cells_1)+(gu35.Cells_2+gu35.Cells_3))+((gu35.Cells_4+gu35.Cells_5)+(gu35.Cells_6+gu35.Cells_7)))+(((gu35...2431
Compilation finished in 352 ms.
Running link step : cd /tmp/ltsmin13932899983274606020;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin13932899983274606020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Initializing POR dependencies: labels 126, guards 125
pins2lts-mc-linux64( 4/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.045: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.045: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.082: LTL layer: formula: <>([](!(LTLAPp0==true)))
pins2lts-mc-linux64( 3/ 8), 0.083: "<>([](!(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.083: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.201: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.217: There are 127 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.218: State length is 201, there are 129 groups
pins2lts-mc-linux64( 0/ 8), 0.218: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.218: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.218: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.218: Visible groups: 0 / 129, labels: 1 / 127
pins2lts-mc-linux64( 0/ 8), 0.218: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.218: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.349: [Blue] ~22 levels ~960 states ~9552 transitions
pins2lts-mc-linux64( 1/ 8), 0.365: [Blue] ~22 levels ~1920 states ~13096 transitions
pins2lts-mc-linux64( 1/ 8), 0.398: [Blue] ~22 levels ~3840 states ~21880 transitions
pins2lts-mc-linux64( 5/ 8), 0.465: [Blue] ~24 levels ~7680 states ~37672 transitions
pins2lts-mc-linux64( 1/ 8), 0.580: [Blue] ~22 levels ~15360 states ~72784 transitions
pins2lts-mc-linux64( 1/ 8), 0.813: [Blue] ~22 levels ~30720 states ~154152 transitions
pins2lts-mc-linux64( 1/ 8), 1.257: [Blue] ~22 levels ~61440 states ~315496 transitions
pins2lts-mc-linux64( 1/ 8), 2.000: [Blue] ~22 levels ~122880 states ~654528 transitions
pins2lts-mc-linux64( 1/ 8), 3.568: [Blue] ~22 levels ~245760 states ~1412256 transitions
pins2lts-mc-linux64( 1/ 8), 6.287: [Blue] ~23 levels ~491520 states ~2845616 transitions
pins2lts-mc-linux64( 0/ 8), 11.547: [Blue] ~24 levels ~983040 states ~6091784 transitions
pins2lts-mc-linux64( 2/ 8), 21.793: [Blue] ~24 levels ~1966080 states ~12861704 transitions
pins2lts-mc-linux64( 3/ 8), 42.674: [Blue] ~26 levels ~3932160 states ~26779368 transitions
pins2lts-mc-linux64( 6/ 8), 87.296: [Blue] ~24 levels ~7864320 states ~56407728 transitions
pins2lts-mc-linux64( 2/ 8), 170.068: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 170.113:
pins2lts-mc-linux64( 0/ 8), 170.113: Explored 13701381 states 104243009 transitions, fanout: 7.608
pins2lts-mc-linux64( 0/ 8), 170.113: Total exploration time 169.890 sec (169.840 sec minimum, 169.865 sec on average)
pins2lts-mc-linux64( 0/ 8), 170.113: States per second: 80649, Transitions per second: 613591
pins2lts-mc-linux64( 0/ 8), 170.113:
pins2lts-mc-linux64( 0/ 8), 170.113: State space has 13706771 states, 61 are accepting
pins2lts-mc-linux64( 0/ 8), 170.114: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 170.114: blue states: 13701381 (99.96%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 170.114: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 170.114: all-red states: 61 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 170.114:
pins2lts-mc-linux64( 0/ 8), 170.114: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 170.114:
pins2lts-mc-linux64( 0/ 8), 170.114: Queue width: 8B, total height: 202, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 170.114: Tree memory: 360.6MB, 27.6 B/state, compr.: 3.4%
pins2lts-mc-linux64( 0/ 8), 170.114: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 170.114: Stored 125 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 170.114: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 170.114: Est. total memory use: 360.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13932899983274606020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13932899983274606020;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(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.
[2024-05-31 05:40:25] [INFO ] Applying decomposition
[2024-05-31 05:40:25] [INFO ] Flatten gal took : 126 ms
[2024-05-31 05:40:25] [INFO ] Decomposing Gal with order
[2024-05-31 05:40:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:40:25] [INFO ] Removed a total of 205 redundant transitions.
[2024-05-31 05:40:25] [INFO ] Flatten gal took : 159 ms
[2024-05-31 05:40:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2024-05-31 05:40:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality6300282864395847057.gal : 25 ms
[2024-05-31 05:40:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality4769339017409519544.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6300282864395847057.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4769339017409519544.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))+(((gN...2717
Formula 0 simplified : GF!"((((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))+(((gNN8...2711
Detected timeout of ITS tools.
[2024-05-31 06:01:27] [INFO ] Flatten gal took : 248 ms
[2024-05-31 06:01:27] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-31 06:01:28] [INFO ] Transformed 200 places.
[2024-05-31 06:01:28] [INFO ] Transformed 125 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 06:01:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality8581835311575274485.gal : 11 ms
[2024-05-31 06:01:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality1689067835275175239.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8581835311575274485.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1689067835275175239.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...1687
Formula 0 simplified : GF!"((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Cell...1681
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 136324 kB
After kill :
MemTotal: 16393216 kB
MemFree: 12316388 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-COL-AN05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Sudoku-COL-AN05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556100277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN05.tgz
mv Sudoku-COL-AN05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;