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-171690556500453.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Sudoku-PT-BN16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556500453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 95M
-rw-r--r-- 1 mcc users 1.7M Apr 12 13:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.3M Apr 12 13:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5M Apr 12 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 23M Apr 12 11:56 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 717K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 903K Apr 12 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Apr 12 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4M Apr 12 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31M Apr 12 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 72K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.7M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717161081364

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-BN16
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 13:11:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 13:11:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 13:11:23] [INFO ] Load time of PNML (sax parser for PT used): 263 ms
[2024-05-31 13:11:23] [INFO ] Transformed 5120 places.
[2024-05-31 13:11:23] [INFO ] Transformed 4096 transitions.
[2024-05-31 13:11:23] [INFO ] Found NUPN structural information;
[2024-05-31 13:11:23] [INFO ] Parsed PT model containing 5120 places and 4096 transitions and 20480 arcs in 372 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 179 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-BN16-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1024 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 1024 transition count 4096
Applied a total of 4096 rules in 117 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2024-05-31 13:11:30] [INFO ] Computed 168 invariants in 816 ms
[2024-05-31 13:11:30] [INFO ] Implicit Places using invariants in 1191 ms returned []
[2024-05-31 13:11:30] [INFO ] Invariant cache hit.
[2024-05-31 13:11:31] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 2320 ms to find 0 implicit places.
[2024-05-31 13:11:31] [INFO ] Invariant cache hit.
[2024-05-31 13:11:34] [INFO ] Dead Transitions using invariants and state equation in 3206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5648 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Support contains 1024 out of 1024 places after structural reductions.
[2024-05-31 13:11:37] [INFO ] Flatten gal took : 794 ms
[2024-05-31 13:11:42] [INFO ] Flatten gal took : 892 ms
[2024-05-31 13:11:48] [INFO ] Input system was already deterministic with 4096 transitions.
Finished random walk after 260 steps, including 1 resets, run visited all 23 properties in 173 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
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' '!(F(G(p0)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 34 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:11:50] [INFO ] Invariant cache hit.
[2024-05-31 13:11:50] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-31 13:11:50] [INFO ] Invariant cache hit.
[2024-05-31 13:11:51] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2024-05-31 13:11:51] [INFO ] Redundant transitions in 253 ms returned []
[2024-05-31 13:11:51] [INFO ] Invariant cache hit.
[2024-05-31 13:11:55] [INFO ] Dead Transitions using invariants and state equation in 3178 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4826 ms. Remains : 1024/1024 places, 4096/4096 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 143 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s97 1) (EQ s321 1) (EQ s609 1) (EQ s785 1)) (AND (EQ s185 1) (EQ s409 1) (EQ s693 1) (EQ s857 1)) (AND (EQ s119 1) (EQ s327 1) (EQ s625 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 208 steps with 0 reset in 91 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-02 finished in 5179 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(p1)||p0) U G(p1)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 8 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:11:55] [INFO ] Invariant cache hit.
[2024-05-31 13:11:55] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-31 13:11:55] [INFO ] Invariant cache hit.
[2024-05-31 13:11:56] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1301 ms to find 0 implicit places.
[2024-05-31 13:11:56] [INFO ] Invariant cache hit.
[2024-05-31 13:11:59] [INFO ] Dead Transitions using invariants and state equation in 3241 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4553 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s97 1) (EQ s321 1) (EQ s609 1) (EQ s785 1)) (AND (EQ s185 1) (EQ s409 1) (EQ s693 1) (EQ s857 1)) (AND (EQ s119 1) (EQ s327 1) (EQ s625 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 205 steps with 0 reset in 75 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-03 finished in 4860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 24 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:12:00] [INFO ] Invariant cache hit.
[2024-05-31 13:12:00] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-31 13:12:00] [INFO ] Invariant cache hit.
[2024-05-31 13:12:01] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
[2024-05-31 13:12:01] [INFO ] Redundant transitions in 244 ms returned []
[2024-05-31 13:12:01] [INFO ] Invariant cache hit.
[2024-05-31 13:12:04] [INFO ] Dead Transitions using invariants and state equation in 3045 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4720 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s97 1) (EQ s321 1) (EQ s609 1) (EQ s785 1)) (AND (EQ s185 1) (EQ s409 1) (EQ s693 1) (EQ s857 1)) (AND (EQ s119 1) (EQ s327 1) (EQ s625 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 208 steps with 0 reset in 70 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-05 finished in 4929 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((X((F(G((X(p3)||p2)))&&p1))&&p0)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 7 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:12:05] [INFO ] Invariant cache hit.
[2024-05-31 13:12:05] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-31 13:12:05] [INFO ] Invariant cache hit.
[2024-05-31 13:12:06] [INFO ] Implicit Places using invariants and state equation in 1123 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
[2024-05-31 13:12:06] [INFO ] Invariant cache hit.
[2024-05-31 13:12:09] [INFO ] Dead Transitions using invariants and state equation in 3243 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4629 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s97 0) (EQ s321 0) (EQ s609 0) (EQ s785 0)) (OR (EQ s185 0) (EQ s409 0) (EQ s693 0) (EQ s857 0)) (OR (EQ s119 0) (EQ s327 0) (EQ s625 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 206 steps with 0 reset in 71 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-06 finished in 5004 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(G((p0&&X(p0))))||F(p1)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 13 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:12:10] [INFO ] Invariant cache hit.
[2024-05-31 13:12:10] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-31 13:12:10] [INFO ] Invariant cache hit.
[2024-05-31 13:12:11] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
[2024-05-31 13:12:11] [INFO ] Invariant cache hit.
[2024-05-31 13:12:14] [INFO ] Dead Transitions using invariants and state equation in 3151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4477 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (EQ s97 0) (EQ s321 0) (EQ s609 0) (EQ s785 0)) (OR (EQ s185 0) (EQ s409 0) (EQ s693 0) (EQ s857 0)) (OR (EQ s119 0) (EQ s327 0) (EQ s625 0) (...], 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 timeout after 29970 steps with 141 reset in 10001 ms.
Product exploration timeout after 29580 steps with 140 reset in 10002 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
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)...)
Solver returned unknown.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 27 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-07 finished in 30137 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((p1||G(p2)))||p0)))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 296 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:12:40] [INFO ] Invariant cache hit.
[2024-05-31 13:12:47] [INFO ] Implicit Places using invariants in 6825 ms returned []
[2024-05-31 13:12:47] [INFO ] Invariant cache hit.
[2024-05-31 13:12:55] [INFO ] Implicit Places using invariants and state equation in 8524 ms returned []
Implicit Place search using SMT with State Equation took 15378 ms to find 0 implicit places.
[2024-05-31 13:12:55] [INFO ] Invariant cache hit.
[2024-05-31 13:12:59] [INFO ] Dead Transitions using invariants and state equation in 3223 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18899 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(OR (AND (EQ s32 1) (EQ s256 1) (EQ s544 1) (EQ s768 1)) (AND (EQ s66 1) (EQ s322 1) (EQ s578 1) (EQ s802 1))), p2:(OR (EQ s65 0) (EQ s353 0) (EQ s585 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 19270 steps with 9635 reset in 10001 ms.
Product exploration timeout after 19190 steps with 9595 reset in 10005 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
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 p2) p1), (X p0), (F (G (NOT p0))), (F (G p2)), (F (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 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-08 finished in 40132 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(G(p0)))'
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 150 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:13:20] [INFO ] Invariant cache hit.
[2024-05-31 13:13:27] [INFO ] Implicit Places using invariants in 7071 ms returned []
[2024-05-31 13:13:27] [INFO ] Invariant cache hit.
[2024-05-31 13:13:36] [INFO ] Implicit Places using invariants and state equation in 8990 ms returned []
Implicit Place search using SMT with State Equation took 16065 ms to find 0 implicit places.
[2024-05-31 13:13:36] [INFO ] Invariant cache hit.
[2024-05-31 13:13:39] [INFO ] Dead Transitions using invariants and state equation in 3107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19340 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-09 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 (EQ s181 0) (EQ s405 0) (EQ s695 0) (EQ s885 0) (AND (EQ s158 1) (EQ s430 1) (EQ s664 1) (EQ s910 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 1079 steps with 5 reset in 355 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-09 finished in 19806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)&&X(p1)))))))'
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 278 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:13:40] [INFO ] Invariant cache hit.
[2024-05-31 13:13:47] [INFO ] Implicit Places using invariants in 6680 ms returned []
[2024-05-31 13:13:47] [INFO ] Invariant cache hit.
[2024-05-31 13:13:56] [INFO ] Implicit Places using invariants and state equation in 8881 ms returned []
Implicit Place search using SMT with State Equation took 15576 ms to find 0 implicit places.
[2024-05-31 13:13:56] [INFO ] Invariant cache hit.
[2024-05-31 13:13:59] [INFO ] Dead Transitions using invariants and state equation in 3066 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18930 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={0} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s203 0) (EQ s491 0) (EQ s712 0) (EQ s907 0)), p1:(AND (EQ s177 1) (EQ s385 1) (EQ s689 1) (EQ s785 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 30520 steps with 188 reset in 10004 ms.
Product exploration timeout after 30410 steps with 183 reset in 10005 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 683 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 106 steps, including 0 resets, run visited all 3 properties in 64 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 183 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-31 13:14:21] [INFO ] Invariant cache hit.
[2024-05-31 13:14:29] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 4184 ms returned sat
[2024-05-31 13:14:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 13:14:36] [INFO ] [Real]Absence check using state equation in 7667 ms returned unknown
Could not prove EG (NOT p0)
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 146 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:14:37] [INFO ] Invariant cache hit.
[2024-05-31 13:14:43] [INFO ] Implicit Places using invariants in 6931 ms returned []
[2024-05-31 13:14:43] [INFO ] Invariant cache hit.
[2024-05-31 13:14:52] [INFO ] Implicit Places using invariants and state equation in 8913 ms returned []
Implicit Place search using SMT with State Equation took 15844 ms to find 0 implicit places.
[2024-05-31 13:14:52] [INFO ] Invariant cache hit.
[2024-05-31 13:14:55] [INFO ] Dead Transitions using invariants and state equation in 3087 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19098 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 1061 steps, including 5 resets, run visited all 3 properties in 347 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-31 13:14:58] [INFO ] Invariant cache hit.
[2024-05-31 13:15:05] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 4260 ms returned sat
[2024-05-31 13:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 13:15:13] [INFO ] [Real]Absence check using state equation in 7578 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 30510 steps with 184 reset in 10003 ms.
Product exploration timeout after 29590 steps with 187 reset in 10004 ms.
Built C files in :
/tmp/ltsmin11578769747595094890
[2024-05-31 13:15:33] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11578769747595094890
Running compilation step : cd /tmp/ltsmin11578769747595094890;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11578769747595094890;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11578769747595094890;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 184 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:15:37] [INFO ] Invariant cache hit.
[2024-05-31 13:15:44] [INFO ] Implicit Places using invariants in 6912 ms returned []
[2024-05-31 13:15:44] [INFO ] Invariant cache hit.
[2024-05-31 13:15:53] [INFO ] Implicit Places using invariants and state equation in 9522 ms returned []
Implicit Place search using SMT with State Equation took 16447 ms to find 0 implicit places.
[2024-05-31 13:15:53] [INFO ] Invariant cache hit.
[2024-05-31 13:15:57] [INFO ] Dead Transitions using invariants and state equation in 3105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19763 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Built C files in :
/tmp/ltsmin14714512159970670691
[2024-05-31 13:15:57] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14714512159970670691
Running compilation step : cd /tmp/ltsmin14714512159970670691;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14714512159970670691;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14714512159970670691;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 13:16:01] [INFO ] Flatten gal took : 169 ms
[2024-05-31 13:16:01] [INFO ] Flatten gal took : 164 ms
[2024-05-31 13:16:01] [INFO ] Time to serialize gal into /tmp/LTL13938682096672430732.gal : 46 ms
[2024-05-31 13:16:01] [INFO ] Time to serialize properties into /tmp/LTL9704223225804083799.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13938682096672430732.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16460433551899242616.hoa' '-atoms' '/tmp/LTL9704223225804083799.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/LTL9704223225804083799.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16460433551899242616.hoa
Detected timeout of ITS tools.
[2024-05-31 13:16:17] [INFO ] Flatten gal took : 178 ms
[2024-05-31 13:16:17] [INFO ] Flatten gal took : 185 ms
[2024-05-31 13:16:17] [INFO ] Time to serialize gal into /tmp/LTL6025409469085444012.gal : 39 ms
[2024-05-31 13:16:17] [INFO ] Time to serialize properties into /tmp/LTL14634484742056224205.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/LTL6025409469085444012.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14634484742056224205.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 : !((X(X(X(F((G("(((Rows_12_11==0)||(Regions_14_11==0))||((Cells_12_8==0)||(Columns_8_11==0)))"))&&(X("(((Rows_11_1==1)&&(Regions_8_1==1...204
Formula 0 simplified : XXXG(F!"(((Rows_12_11==0)||(Regions_14_11==0))||((Cells_12_8==0)||(Columns_8_11==0)))" | X!"(((Rows_11_1==1)&&(Regions_8_1==1))&&((C...190
Detected timeout of ITS tools.
[2024-05-31 13:16:33] [INFO ] Flatten gal took : 174 ms
[2024-05-31 13:16:33] [INFO ] Applying decomposition
[2024-05-31 13:16:33] [INFO ] Flatten gal took : 255 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/graph8108732272348584360.txt' '-o' '/tmp/graph8108732272348584360.bin' '-w' '/tmp/graph8108732272348584360.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8108732272348584360.bin' '-l' '-1' '-v' '-w' '/tmp/graph8108732272348584360.weights' '-q' '0' '-e' '0.001'
[2024-05-31 13:16:33] [INFO ] Decomposing Gal with order
[2024-05-31 13:16:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 13:16:34] [INFO ] Removed a total of 15360 redundant transitions.
[2024-05-31 13:16:34] [INFO ] Flatten gal took : 665 ms
[2024-05-31 13:16:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 39 ms.
[2024-05-31 13:16:35] [INFO ] Time to serialize gal into /tmp/LTL7819737719052078879.gal : 42 ms
[2024-05-31 13:16:35] [INFO ] Time to serialize properties into /tmp/LTL469789577408134967.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/LTL7819737719052078879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL469789577408134967.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("(((u203.Rows_12_11==0)||(u491.Regions_14_11==0))||((u712.Cells_12_8==0)||(u907.Columns_8_11==0)))"))&&(X("(((u177.Rows_...244
Formula 0 simplified : XXXG(F!"(((u203.Rows_12_11==0)||(u491.Regions_14_11==0))||((u712.Cells_12_8==0)||(u907.Columns_8_11==0)))" | X!"(((u177.Rows_11_1==1...230
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12457890859064815337
[2024-05-31 13:16:50] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12457890859064815337
Running compilation step : cd /tmp/ltsmin12457890859064815337;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12457890859064815337;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12457890859064815337;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-PT-BN16-LTLFireability-10 finished in 193110 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(((!p1 U (p2 U X(p2)))&&p0))))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 143 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:16:53] [INFO ] Invariant cache hit.
[2024-05-31 13:17:00] [INFO ] Implicit Places using invariants in 6587 ms returned []
[2024-05-31 13:17:00] [INFO ] Invariant cache hit.
[2024-05-31 13:17:08] [INFO ] Implicit Places using invariants and state equation in 8693 ms returned []
Implicit Place search using SMT with State Equation took 15309 ms to find 0 implicit places.
[2024-05-31 13:17:08] [INFO ] Invariant cache hit.
[2024-05-31 13:17:11] [INFO ] Dead Transitions using invariants and state equation in 3070 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18544 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(AND p0 p2 p1), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(AND (EQ s228 1) (EQ s452 1) (EQ s736 1) (EQ s772 1) (EQ s14 1) (EQ s286 1) (EQ s519 1) (EQ s894 1)), p1:(AND (EQ s14 1) (EQ s286 1) (EQ s519 1) (EQ s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 295 steps with 27 reset in 123 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-11 finished in 18924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p0)))&&(F(p2)||p1))))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 141 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:17:12] [INFO ] Invariant cache hit.
[2024-05-31 13:17:19] [INFO ] Implicit Places using invariants in 6932 ms returned []
[2024-05-31 13:17:19] [INFO ] Invariant cache hit.
[2024-05-31 13:17:29] [INFO ] Implicit Places using invariants and state equation in 9845 ms returned []
Implicit Place search using SMT with State Equation took 16802 ms to find 0 implicit places.
[2024-05-31 13:17:29] [INFO ] Invariant cache hit.
[2024-05-31 13:17:32] [INFO ] Dead Transitions using invariants and state equation in 3063 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20029 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s127 0) (EQ s367 0) (EQ s635 0) (EQ s959 0)), p2:(OR (EQ s76 0) (EQ s332 0) (EQ s577 0) (EQ s796 0)), p0:(AND (EQ s42 1) (EQ s282 1) (EQ s550 1...], nbAcceptance=0, 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 2364 steps with 68 reset in 1408 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-13 finished in 21688 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((p0||F(p1))))'
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 158 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:17:34] [INFO ] Invariant cache hit.
[2024-05-31 13:17:40] [INFO ] Implicit Places using invariants in 6681 ms returned []
[2024-05-31 13:17:40] [INFO ] Invariant cache hit.
[2024-05-31 13:17:49] [INFO ] Implicit Places using invariants and state equation in 8514 ms returned []
Implicit Place search using SMT with State Equation took 15220 ms to find 0 implicit places.
[2024-05-31 13:17:49] [INFO ] Invariant cache hit.
[2024-05-31 13:17:52] [INFO ] Dead Transitions using invariants and state equation in 3484 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18873 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-14 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 (EQ s215 0) (EQ s471 0) (EQ s724 0) (EQ s839 0)), p0:(AND (EQ s196 1) (EQ s484 1) (EQ s715 1) (EQ s948 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 timeout after 18360 steps with 6499 reset in 10002 ms.
Product exploration timeout after 18330 steps with 6552 reset in 10002 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 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-BN16-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-14 finished in 40036 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(F((p1&&F(p2))))||p0)))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 185 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:18:14] [INFO ] Invariant cache hit.
[2024-05-31 13:18:20] [INFO ] Implicit Places using invariants in 6717 ms returned []
[2024-05-31 13:18:20] [INFO ] Invariant cache hit.
[2024-05-31 13:18:30] [INFO ] Implicit Places using invariants and state equation in 9792 ms returned []
Implicit Place search using SMT with State Equation took 16511 ms to find 0 implicit places.
[2024-05-31 13:18:30] [INFO ] Redundant transitions in 150 ms returned []
[2024-05-31 13:18:30] [INFO ] Invariant cache hit.
[2024-05-31 13:18:33] [INFO ] Dead Transitions using invariants and state equation in 3174 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20044 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s3 1) (NEQ s291 1) (NEQ s521 1) (NEQ s915 1)), p1:(OR (NEQ s3 1) (NEQ s291 1) (NEQ s521 1) (NEQ s915 1)), p2:(OR (NEQ s199 1) (NEQ s487 1) (NE...], 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 timeout after 17780 steps with 259 reset in 10003 ms.
Product exploration timeout after 17090 steps with 247 reset in 10005 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-15 finished in 41217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)&&X(p1)))))))'
Found a Shortening insensitive property : Sudoku-PT-BN16-LTLFireability-10
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 160 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:18:55] [INFO ] Invariant cache hit.
[2024-05-31 13:19:02] [INFO ] Implicit Places using invariants in 6810 ms returned []
[2024-05-31 13:19:02] [INFO ] Invariant cache hit.
[2024-05-31 13:19:11] [INFO ] Implicit Places using invariants and state equation in 8753 ms returned []
Implicit Place search using SMT with State Equation took 15586 ms to find 0 implicit places.
[2024-05-31 13:19:11] [INFO ] Invariant cache hit.
[2024-05-31 13:19:14] [INFO ] Dead Transitions using invariants and state equation in 3079 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 18840 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={0} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s203 0) (EQ s491 0) (EQ s712 0) (EQ s907 0)), p1:(AND (EQ s177 1) (EQ s385 1) (EQ s689 1) (EQ s785 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 30630 steps with 184 reset in 10009 ms.
Product exploration timeout after 29810 steps with 183 reset in 10006 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 180 steps, including 0 resets, run visited all 3 properties in 90 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 665 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-31 13:19:36] [INFO ] Invariant cache hit.
[2024-05-31 13:19:44] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 4094 ms returned sat
[2024-05-31 13:19:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 13:19:51] [INFO ] [Real]Absence check using state equation in 7703 ms returned unknown
Could not prove EG (NOT p0)
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 140 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:19:52] [INFO ] Invariant cache hit.
[2024-05-31 13:19:58] [INFO ] Implicit Places using invariants in 6506 ms returned []
[2024-05-31 13:19:58] [INFO ] Invariant cache hit.
[2024-05-31 13:20:07] [INFO ] Implicit Places using invariants and state equation in 9038 ms returned []
Implicit Place search using SMT with State Equation took 15560 ms to find 0 implicit places.
[2024-05-31 13:20:07] [INFO ] Invariant cache hit.
[2024-05-31 13:20:10] [INFO ] Dead Transitions using invariants and state equation in 3112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18836 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 312 steps, including 1 resets, run visited all 3 properties in 128 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 353 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-31 13:20:12] [INFO ] Invariant cache hit.
[2024-05-31 13:20:20] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 4203 ms returned sat
[2024-05-31 13:20:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 13:20:27] [INFO ] [Real]Absence check using state equation in 7595 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 30960 steps with 190 reset in 10006 ms.
Product exploration timeout after 30780 steps with 176 reset in 10003 ms.
Built C files in :
/tmp/ltsmin15322466999135680557
[2024-05-31 13:20:48] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15322466999135680557
Running compilation step : cd /tmp/ltsmin15322466999135680557;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15322466999135680557;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15322466999135680557;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 144 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-31 13:20:51] [INFO ] Invariant cache hit.
[2024-05-31 13:20:58] [INFO ] Implicit Places using invariants in 6869 ms returned []
[2024-05-31 13:20:58] [INFO ] Invariant cache hit.
[2024-05-31 13:21:06] [INFO ] Implicit Places using invariants and state equation in 7999 ms returned []
Implicit Place search using SMT with State Equation took 14880 ms to find 0 implicit places.
[2024-05-31 13:21:06] [INFO ] Invariant cache hit.
[2024-05-31 13:21:09] [INFO ] Dead Transitions using invariants and state equation in 2981 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18022 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Built C files in :
/tmp/ltsmin5576758468119464920
[2024-05-31 13:21:09] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5576758468119464920
Running compilation step : cd /tmp/ltsmin5576758468119464920;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5576758468119464920;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5576758468119464920;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 13:21:13] [INFO ] Flatten gal took : 189 ms
[2024-05-31 13:21:14] [INFO ] Flatten gal took : 154 ms
[2024-05-31 13:21:14] [INFO ] Time to serialize gal into /tmp/LTL5145572426515192902.gal : 53 ms
[2024-05-31 13:21:14] [INFO ] Time to serialize properties into /tmp/LTL7727742388701838925.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/LTL5145572426515192902.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10110237680189402613.hoa' '-atoms' '/tmp/LTL7727742388701838925.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7727742388701838925.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10110237680189402613.hoa
Detected timeout of ITS tools.
[2024-05-31 13:21:30] [INFO ] Flatten gal took : 153 ms
[2024-05-31 13:21:30] [INFO ] Flatten gal took : 174 ms
[2024-05-31 13:21:30] [INFO ] Time to serialize gal into /tmp/LTL4123795341705124455.gal : 31 ms
[2024-05-31 13:21:30] [INFO ] Time to serialize properties into /tmp/LTL10009346931804586040.ltl : 50 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/LTL4123795341705124455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10009346931804586040.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 : !((X(X(X(F((G("(((Rows_12_11==0)||(Regions_14_11==0))||((Cells_12_8==0)||(Columns_8_11==0)))"))&&(X("(((Rows_11_1==1)&&(Regions_8_1==1...204
Formula 0 simplified : XXXG(F!"(((Rows_12_11==0)||(Regions_14_11==0))||((Cells_12_8==0)||(Columns_8_11==0)))" | X!"(((Rows_11_1==1)&&(Regions_8_1==1))&&((C...190
Detected timeout of ITS tools.
[2024-05-31 13:21:45] [INFO ] Flatten gal took : 151 ms
[2024-05-31 13:21:45] [INFO ] Applying decomposition
[2024-05-31 13:21:45] [INFO ] Flatten gal took : 153 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/graph7082809017989474031.txt' '-o' '/tmp/graph7082809017989474031.bin' '-w' '/tmp/graph7082809017989474031.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7082809017989474031.bin' '-l' '-1' '-v' '-w' '/tmp/graph7082809017989474031.weights' '-q' '0' '-e' '0.001'
[2024-05-31 13:21:46] [INFO ] Decomposing Gal with order
[2024-05-31 13:21:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 13:21:46] [INFO ] Removed a total of 15360 redundant transitions.
[2024-05-31 13:21:46] [INFO ] Flatten gal took : 322 ms
[2024-05-31 13:21:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2024-05-31 13:21:47] [INFO ] Time to serialize gal into /tmp/LTL11509643635158919680.gal : 41 ms
[2024-05-31 13:21:47] [INFO ] Time to serialize properties into /tmp/LTL12512266823401475701.ltl : 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/LTL11509643635158919680.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12512266823401475701.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("(((u203.Rows_12_11==0)||(u491.Regions_14_11==0))||((u712.Cells_12_8==0)||(u907.Columns_8_11==0)))"))&&(X("(((u177.Rows_...244
Formula 0 simplified : XXXG(F!"(((u203.Rows_12_11==0)||(u491.Regions_14_11==0))||((u712.Cells_12_8==0)||(u907.Columns_8_11==0)))" | X!"(((u177.Rows_11_1==1...230
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2968989918052507078
[2024-05-31 13:22:02] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2968989918052507078
Running compilation step : cd /tmp/ltsmin2968989918052507078;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2968989918052507078;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2968989918052507078;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-PT-BN16-LTLFireability-10 finished in 190194 ms.
[2024-05-31 13:22:05] [INFO ] Flatten gal took : 148 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin646173905891441174
[2024-05-31 13:22:05] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2024-05-31 13:22:05] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin646173905891441174
Running compilation step : cd /tmp/ltsmin646173905891441174;'/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 13:22:05] [INFO ] Applying decomposition
[2024-05-31 13:22:05] [INFO ] Flatten gal took : 152 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/graph52800556043040918.txt' '-o' '/tmp/graph52800556043040918.bin' '-w' '/tmp/graph52800556043040918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph52800556043040918.bin' '-l' '-1' '-v' '-w' '/tmp/graph52800556043040918.weights' '-q' '0' '-e' '0.001'
[2024-05-31 13:22:06] [INFO ] Decomposing Gal with order
[2024-05-31 13:22:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 13:22:06] [INFO ] Removed a total of 15360 redundant transitions.
[2024-05-31 13:22:06] [INFO ] Flatten gal took : 204 ms
[2024-05-31 13:22:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2024-05-31 13:22:06] [INFO ] Time to serialize gal into /tmp/LTLFireability17048276075114160567.gal : 16 ms
[2024-05-31 13:22:06] [INFO ] Time to serialize properties into /tmp/LTLFireability15149275905210449531.ltl : 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/LTLFireability17048276075114160567.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15149275905210449531.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("(((u203.Rows_12_11==0)||(u491.Regions_14_11==0))||((u712.Cells_12_8==0)||(u907.Columns_8_11==0)))"))&&(X("(((u177.Rows_...244
Formula 0 simplified : XXXG(F!"(((u203.Rows_12_11==0)||(u491.Regions_14_11==0))||((u712.Cells_12_8==0)||(u907.Columns_8_11==0)))" | X!"(((u177.Rows_11_1==1...230
Compilation finished in 12391 ms.
Running link step : cd /tmp/ltsmin646173905891441174;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin646173905891441174;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>(([]((LTLAPp0==true))&&X((LTLAPp1==true)))))))' '--buchi-type=spotba'
LTSmin run took 8364 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 663454 ms.

BK_STOP 1717161749856

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-BN16"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-BN16.tgz
mv Sudoku-PT-BN16 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 ;