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.r400-tall-171690532900668.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 itstools
Input is Sudoku-PT-AN13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532900668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 813K Apr 12 11:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.3M Apr 12 10:14 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 379K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Apr 12 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Apr 12 11:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.1M Apr 12 11:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 78K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 191K Apr 23 08:00 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 1.2M 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-AN13-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717059503394

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-30 08:58:24] [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-30 08:58:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 08:58:24] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2024-05-30 08:58:24] [INFO ] Transformed 2704 places.
[2024-05-30 08:58:24] [INFO ] Transformed 2197 transitions.
[2024-05-30 08:58:24] [INFO ] Found NUPN structural information;
[2024-05-30 08:58:24] [INFO ] Parsed PT model containing 2704 places and 2197 transitions and 8788 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 132 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN13-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 54 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-05-30 08:58:26] [INFO ] Computed 38 invariants in 129 ms
[2024-05-30 08:58:26] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-30 08:58:26] [INFO ] Invariant cache hit.
[2024-05-30 08:58:29] [INFO ] Implicit Places using invariants and state equation in 2636 ms returned []
Implicit Place search using SMT with State Equation took 3200 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3278 ms. Remains : 507/2704 places, 2197/2197 transitions.
Support contains 507 out of 507 places after structural reductions.
[2024-05-30 08:58:30] [INFO ] Flatten gal took : 416 ms
[2024-05-30 08:58:33] [INFO ] Flatten gal took : 484 ms
[2024-05-30 08:58:36] [INFO ] Input system was already deterministic with 2197 transitions.
Reduction of identical properties reduced properties to check from 14 to 11
RANDOM walk for 589 steps (0 resets) in 1334 ms. (0 steps per ms) remains 0/11 properties
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 20 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 08:58:38] [INFO ] Invariant cache hit.
[2024-05-30 08:58:38] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-30 08:58:38] [INFO ] Invariant cache hit.
[2024-05-30 08:58:40] [INFO ] Implicit Places using invariants and state equation in 2645 ms returned []
Implicit Place search using SMT with State Equation took 2781 ms to find 0 implicit places.
[2024-05-30 08:58:40] [INFO ] Redundant transitions in 104 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2914 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-00
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 32 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-00 finished in 3239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 19 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 08:58:41] [INFO ] Invariant cache hit.
[2024-05-30 08:58:41] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-30 08:58:41] [INFO ] Invariant cache hit.
[2024-05-30 08:58:44] [INFO ] Implicit Places using invariants and state equation in 2690 ms returned []
Implicit Place search using SMT with State Equation took 2856 ms to find 0 implicit places.
[2024-05-30 08:58:44] [INFO ] Redundant transitions in 34 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2916 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-01
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 35 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-01 finished in 3107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&G(p1)))||X(F(p0))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 08:58:44] [INFO ] Invariant cache hit.
[2024-05-30 08:58:44] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-30 08:58:44] [INFO ] Invariant cache hit.
[2024-05-30 08:58:47] [INFO ] Implicit Places using invariants and state equation in 2649 ms returned []
Implicit Place search using SMT with State Equation took 2775 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 2783 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-02
Product exploration timeout after 46750 steps with 23375 reset in 10001 ms.
Product exploration timeout after 46580 steps with 23290 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-02 finished in 24907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 22 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 08:59:09] [INFO ] Invariant cache hit.
[2024-05-30 08:59:09] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-30 08:59:09] [INFO ] Invariant cache hit.
[2024-05-30 08:59:12] [INFO ] Implicit Places using invariants and state equation in 2625 ms returned []
Implicit Place search using SMT with State Equation took 2752 ms to find 0 implicit places.
[2024-05-30 08:59:12] [INFO ] Redundant transitions in 98 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2890 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-03
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 36 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-03 finished in 3141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&X(p1)))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 3 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 08:59:12] [INFO ] Invariant cache hit.
[2024-05-30 08:59:12] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-30 08:59:12] [INFO ] Invariant cache hit.
[2024-05-30 08:59:15] [INFO ] Implicit Places using invariants and state equation in 2553 ms returned []
Implicit Place search using SMT with State Equation took 2745 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 2751 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-04
Product exploration timeout after 76220 steps with 978 reset in 10002 ms.
Product exploration timeout after 75850 steps with 983 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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), (X (NOT p0)), (X p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 588 steps (0 resets) in 133 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 08:59:38] [INFO ] Invariant cache hit.
[2024-05-30 08:59:38] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-30 08:59:38] [INFO ] Invariant cache hit.
[2024-05-30 08:59:40] [INFO ] Implicit Places using invariants and state equation in 2564 ms returned []
Implicit Place search using SMT with State Equation took 2693 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 2701 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [p1, (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 591 steps (0 resets) in 109 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Product exploration timeout after 39010 steps with 13003 reset in 10003 ms.
Product exploration timeout after 38490 steps with 12830 reset in 10005 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 15 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:00:03] [INFO ] Redundant transitions in 33 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin8681855548841792286
[2024-05-30 09:00:04] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8681855548841792286
Running compilation step : cd /tmp/ltsmin8681855548841792286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8681855548841792286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8681855548841792286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:00:07] [INFO ] Invariant cache hit.
[2024-05-30 09:00:07] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-30 09:00:07] [INFO ] Invariant cache hit.
[2024-05-30 09:00:09] [INFO ] Implicit Places using invariants and state equation in 2573 ms returned []
Implicit Place search using SMT with State Equation took 2699 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 2705 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin18025409925836587200
[2024-05-30 09:00:09] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18025409925836587200
Running compilation step : cd /tmp/ltsmin18025409925836587200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin18025409925836587200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin18025409925836587200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 09:00:13] [INFO ] Flatten gal took : 87 ms
[2024-05-30 09:00:13] [INFO ] Flatten gal took : 81 ms
[2024-05-30 09:00:13] [INFO ] Time to serialize gal into /tmp/LTL1967847097506884185.gal : 22 ms
[2024-05-30 09:00:13] [INFO ] Time to serialize properties into /tmp/LTL4317270853137040559.prop : 13 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1967847097506884185.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7327689152441323507.hoa' '-atoms' '/tmp/LTL4317270853137040559.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4317270853137040559.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7327689152441323507.hoa
Detected timeout of ITS tools.
[2024-05-30 09:00:29] [INFO ] Flatten gal took : 130 ms
[2024-05-30 09:00:29] [INFO ] Flatten gal took : 235 ms
[2024-05-30 09:00:29] [INFO ] Time to serialize gal into /tmp/LTL3009808001853900813.gal : 32 ms
[2024-05-30 09:00:29] [INFO ] Time to serialize properties into /tmp/LTL17476815850236668085.ltl : 101 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3009808001853900813.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17476815850236668085.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((((((Rows_6_4==0)||(Cells_6_11==0))||(Columns_11_4==0))&&(((Rows_10_6==0)||(Cells_10_3==0))||(Columns_3_6==0)))&&((((...371672
Formula 0 simplified : G!"(((((((((((((((Rows_6_4==0)||(Cells_6_11==0))||(Columns_11_4==0))&&(((Rows_10_6==0)||(Cells_10_3==0))||(Columns_3_6==0)))&&((((Ro...371662
Detected timeout of ITS tools.
[2024-05-30 09:00:44] [INFO ] Flatten gal took : 125 ms
[2024-05-30 09:00:44] [INFO ] Applying decomposition
[2024-05-30 09:00:45] [INFO ] Flatten gal took : 126 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9739237355327871203.txt' '-o' '/tmp/graph9739237355327871203.bin' '-w' '/tmp/graph9739237355327871203.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9739237355327871203.bin' '-l' '-1' '-v' '-w' '/tmp/graph9739237355327871203.weights' '-q' '0' '-e' '0.001'
[2024-05-30 09:00:45] [INFO ] Decomposing Gal with order
[2024-05-30 09:00:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 09:00:45] [INFO ] Removed a total of 6084 redundant transitions.
[2024-05-30 09:00:45] [INFO ] Flatten gal took : 306 ms
[2024-05-30 09:00:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2024-05-30 09:00:45] [INFO ] Time to serialize gal into /tmp/LTL7065956066820476663.gal : 18 ms
[2024-05-30 09:00:46] [INFO ] Time to serialize properties into /tmp/LTL7409934098285611102.ltl : 35 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7065956066820476663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7409934098285611102.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((((((u82.Rows_6_4==0)||(u258.Cells_6_11==0))||(u485.Columns_11_4==0))&&(((u136.Rows_10_6==0)||(u302.Cells_10_3==0))||...466247
Formula 0 simplified : G!"(((((((((((((((u82.Rows_6_4==0)||(u258.Cells_6_11==0))||(u485.Columns_11_4==0))&&(((u136.Rows_10_6==0)||(u302.Cells_10_3==0))||(u...466237
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN13-LTLFireability-04 finished in 108723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:01:01] [INFO ] Invariant cache hit.
[2024-05-30 09:01:01] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-30 09:01:01] [INFO ] Invariant cache hit.
[2024-05-30 09:01:03] [INFO ] Implicit Places using invariants and state equation in 2674 ms returned []
Implicit Place search using SMT with State Equation took 2817 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 2823 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-05
Entered a terminal (fully accepting) state of product in 149 steps with 0 reset in 24 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-05 finished in 2976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!((p0 U F(p0)) U p0))||X((X(p0) U p0)))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:01:04] [INFO ] Invariant cache hit.
[2024-05-30 09:01:04] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-30 09:01:04] [INFO ] Invariant cache hit.
[2024-05-30 09:01:06] [INFO ] Implicit Places using invariants and state equation in 2691 ms returned []
Implicit Place search using SMT with State Equation took 2818 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 2829 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 295 ms :[true, false, false, p0, (NOT p0), (NOT p0), false, false]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-07
Product exploration timeout after 38280 steps with 12760 reset in 10002 ms.
Product exploration timeout after 38050 steps with 12683 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 8 states, 10 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 597 steps (0 resets) in 128 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:01:30] [INFO ] Invariant cache hit.
[2024-05-30 09:01:30] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-30 09:01:30] [INFO ] Invariant cache hit.
[2024-05-30 09:01:32] [INFO ] Implicit Places using invariants and state equation in 2592 ms returned []
Implicit Place search using SMT with State Equation took 2726 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 2733 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 587 steps (0 resets) in 124 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration timeout after 38400 steps with 12800 reset in 10003 ms.
Product exploration timeout after 38320 steps with 12773 reset in 10001 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 15 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:01:56] [INFO ] Redundant transitions in 37 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin11208360591116108179
[2024-05-30 09:01:56] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11208360591116108179
Running compilation step : cd /tmp/ltsmin11208360591116108179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin11208360591116108179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin11208360591116108179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:01:59] [INFO ] Invariant cache hit.
[2024-05-30 09:01:59] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-30 09:01:59] [INFO ] Invariant cache hit.
[2024-05-30 09:02:02] [INFO ] Implicit Places using invariants and state equation in 2696 ms returned []
Implicit Place search using SMT with State Equation took 2818 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 2826 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin15753609232206753823
[2024-05-30 09:02:02] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15753609232206753823
Running compilation step : cd /tmp/ltsmin15753609232206753823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin15753609232206753823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin15753609232206753823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 09:02:05] [INFO ] Flatten gal took : 74 ms
[2024-05-30 09:02:05] [INFO ] Flatten gal took : 73 ms
[2024-05-30 09:02:05] [INFO ] Time to serialize gal into /tmp/LTL16000466245867226070.gal : 9 ms
[2024-05-30 09:02:05] [INFO ] Time to serialize properties into /tmp/LTL11478978037591826556.prop : 6 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16000466245867226070.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9807219911828885092.hoa' '-atoms' '/tmp/LTL11478978037591826556.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11478978037591826556.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9807219911828885092.hoa
Detected timeout of ITS tools.
[2024-05-30 09:02:21] [INFO ] Flatten gal took : 153 ms
[2024-05-30 09:02:21] [INFO ] Flatten gal took : 151 ms
[2024-05-30 09:02:21] [INFO ] Time to serialize gal into /tmp/LTL13601898708617452535.gal : 9 ms
[2024-05-30 09:02:21] [INFO ] Time to serialize properties into /tmp/LTL1625858807131257966.ltl : 51 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13601898708617452535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1625858807131257966.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(!((("(((((((((((((((Rows_6_4==1)&&(Cells_6_11==1))&&(Columns_11_4==1))||(((Rows_10_6==1)&&(Cells_10_3==1))&&(Columns_3_6==1)))...619440
Formula 0 simplified : X(F"(((((((((((((((Rows_6_4==1)&&(Cells_6_11==1))&&(Columns_11_4==1))||(((Rows_10_6==1)&&(Cells_10_3==1))&&(Columns_3_6==1)))||((((R...371664
Detected timeout of ITS tools.
[2024-05-30 09:02:36] [INFO ] Flatten gal took : 148 ms
[2024-05-30 09:02:36] [INFO ] Applying decomposition
[2024-05-30 09:02:36] [INFO ] Flatten gal took : 143 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7598098104661381819.txt' '-o' '/tmp/graph7598098104661381819.bin' '-w' '/tmp/graph7598098104661381819.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7598098104661381819.bin' '-l' '-1' '-v' '-w' '/tmp/graph7598098104661381819.weights' '-q' '0' '-e' '0.001'
[2024-05-30 09:02:37] [INFO ] Decomposing Gal with order
[2024-05-30 09:02:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 09:02:37] [INFO ] Removed a total of 6084 redundant transitions.
[2024-05-30 09:02:37] [INFO ] Flatten gal took : 335 ms
[2024-05-30 09:02:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 30 ms.
[2024-05-30 09:02:38] [INFO ] Time to serialize gal into /tmp/LTL7534665371418448102.gal : 16 ms
[2024-05-30 09:02:38] [INFO ] Time to serialize properties into /tmp/LTL13433977274243211241.ltl : 54 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7534665371418448102.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13433977274243211241.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G(!((("(((((((((((((((u82.Rows_6_4==1)&&(u258.Cells_6_11==1))&&(u485.Columns_11_4==1))||(((u136.Rows_10_6==1)&&(u302.Cells_10_3=...777065
Formula 0 simplified : X(F"(((((((((((((((u82.Rows_6_4==1)&&(u258.Cells_6_11==1))&&(u485.Columns_11_4==1))||(((u136.Rows_10_6==1)&&(u302.Cells_10_3==1))&&(...466239
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN13-LTLFireability-07 finished in 109047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))&&F(p1)))))'
Support contains 9 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 96 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:02:53] [INFO ] Invariant cache hit.
[2024-05-30 09:02:56] [INFO ] Implicit Places using invariants in 2951 ms returned []
[2024-05-30 09:02:56] [INFO ] Invariant cache hit.
[2024-05-30 09:03:19] [INFO ] Implicit Places using invariants and state equation in 23788 ms returned []
Implicit Place search using SMT with State Equation took 26741 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 26838 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-09
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 22 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-09 finished in 27110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 64 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:03:20] [INFO ] Invariant cache hit.
[2024-05-30 09:03:23] [INFO ] Implicit Places using invariants in 3272 ms returned []
[2024-05-30 09:03:23] [INFO ] Invariant cache hit.
[2024-05-30 09:03:56] [INFO ] Performed 450/507 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-30 09:03:56] [INFO ] Implicit Places using invariants and state equation in 33303 ms returned []
Implicit Place search using SMT with State Equation took 36581 ms to find 0 implicit places.
[2024-05-30 09:03:56] [INFO ] Redundant transitions in 38 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36697 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-10
Product exploration timeout after 80320 steps with 541 reset in 10001 ms.
Product exploration timeout after 79640 steps with 537 reset in 10003 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-10 finished in 57206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 75 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:04:17] [INFO ] Invariant cache hit.
[2024-05-30 09:04:20] [INFO ] Implicit Places using invariants in 3422 ms returned []
[2024-05-30 09:04:20] [INFO ] Invariant cache hit.
[2024-05-30 09:04:52] [INFO ] Implicit Places using invariants and state equation in 31868 ms returned []
Implicit Place search using SMT with State Equation took 35311 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 35389 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-11 finished in 35492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(X((p0 U G((!p1 U X(p0))))) U X(p2)))'
Support contains 12 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 48 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:04:52] [INFO ] Invariant cache hit.
[2024-05-30 09:04:56] [INFO ] Implicit Places using invariants in 3448 ms returned []
[2024-05-30 09:04:56] [INFO ] Invariant cache hit.
[2024-05-30 09:05:19] [INFO ] Implicit Places using invariants and state equation in 22661 ms returned []
Implicit Place search using SMT with State Equation took 26152 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 26202 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 309 ms :[p2, p2, true, (AND p0 p2), (AND p0 p2), (AND p0 p2), false, p0, false]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-12 finished in 26541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 44 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:05:19] [INFO ] Invariant cache hit.
[2024-05-30 09:05:22] [INFO ] Implicit Places using invariants in 3306 ms returned []
[2024-05-30 09:05:22] [INFO ] Invariant cache hit.
[2024-05-30 09:05:55] [INFO ] Performed 471/507 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-30 09:05:55] [INFO ] Implicit Places using invariants and state equation in 33005 ms returned []
Implicit Place search using SMT with State Equation took 36323 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 36368 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-13
Entered a terminal (fully accepting) state of product in 108 steps with 0 reset in 18 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-13 finished in 36488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 55 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:05:56] [INFO ] Invariant cache hit.
[2024-05-30 09:05:59] [INFO ] Implicit Places using invariants in 3284 ms returned []
[2024-05-30 09:05:59] [INFO ] Invariant cache hit.
[2024-05-30 09:06:23] [INFO ] Implicit Places using invariants and state equation in 24286 ms returned []
Implicit Place search using SMT with State Equation took 27575 ms to find 0 implicit places.
[2024-05-30 09:06:23] [INFO ] Redundant transitions in 34 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27678 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-14
Product exploration timeout after 36150 steps with 1382 reset in 10002 ms.
Product exploration timeout after 35800 steps with 1344 reset in 10003 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 11 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-14 finished in 48163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U !p0))'
Support contains 3 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 58 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:06:44] [INFO ] Invariant cache hit.
[2024-05-30 09:06:47] [INFO ] Implicit Places using invariants in 3415 ms returned []
[2024-05-30 09:06:47] [INFO ] Invariant cache hit.
[2024-05-30 09:07:20] [INFO ] Implicit Places using invariants and state equation in 32408 ms returned []
Implicit Place search using SMT with State Equation took 35838 ms to find 0 implicit places.
[2024-05-30 09:07:20] [INFO ] Redundant transitions in 33 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35945 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 106 ms :[p0, p0, p0]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-15
Product exploration timeout after 44920 steps with 929 reset in 10002 ms.
Product exploration timeout after 44820 steps with 908 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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, (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 11 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-15 finished in 56531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&X(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!((p0 U F(p0)) U p0))||X((X(p0) U p0)))))'
[2024-05-30 09:07:41] [INFO ] Flatten gal took : 201 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2101769387646628086
[2024-05-30 09:07:41] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-30 09:07:41] [INFO ] Built C files in 140ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2101769387646628086
Running compilation step : cd /tmp/ltsmin2101769387646628086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-30 09:07:41] [INFO ] Applying decomposition
[2024-05-30 09:07:41] [INFO ] Flatten gal took : 200 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6996860517182820618.txt' '-o' '/tmp/graph6996860517182820618.bin' '-w' '/tmp/graph6996860517182820618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6996860517182820618.bin' '-l' '-1' '-v' '-w' '/tmp/graph6996860517182820618.weights' '-q' '0' '-e' '0.001'
[2024-05-30 09:07:42] [INFO ] Decomposing Gal with order
[2024-05-30 09:07:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 09:07:43] [INFO ] Removed a total of 6084 redundant transitions.
[2024-05-30 09:07:43] [INFO ] Flatten gal took : 603 ms
[2024-05-30 09:07:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-30 09:07:43] [INFO ] Time to serialize gal into /tmp/LTLFireability10991319264596320324.gal : 22 ms
[2024-05-30 09:07:44] [INFO ] Time to serialize properties into /tmp/LTLFireability534597210551012840.ltl : 130 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10991319264596320324.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability534597210551012840.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !(((F("(((((((((((((((u82.Rows_6_4==0)||(u258.Cells_6_11==0))||(u485.Columns_11_4==0))&&(((u136.Rows_10_6==0)||(u302.Cells_10_3==0))||...466247
Formula 0 simplified : G!"(((((((((((((((u82.Rows_6_4==0)||(u258.Cells_6_11==0))||(u485.Columns_11_4==0))&&(((u136.Rows_10_6==0)||(u302.Cells_10_3==0))||(u...466237
Compilation finished in 8674 ms.
Running link step : cd /tmp/ltsmin2101769387646628086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin2101769387646628086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(((LTLAPp1==true)&&X((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2101769387646628086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(((LTLAPp1==true)&&X((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2101769387646628086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](!(((LTLAPp1==true) U <>((LTLAPp1==true))) U (LTLAPp1==true)))||X((X((LTLAPp1==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
LTSmin run took 226208 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin2101769387646628086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(((LTLAPp1==true)&&X((LTLAPp1==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-30 09:27:01] [INFO ] Applying decomposition
[2024-05-30 09:27:02] [INFO ] Flatten gal took : 386 ms
[2024-05-30 09:27:02] [INFO ] Decomposing Gal with order
[2024-05-30 09:27:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 09:27:03] [INFO ] Removed a total of 6084 redundant transitions.
[2024-05-30 09:27:03] [INFO ] Flatten gal took : 491 ms
[2024-05-30 09:27:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2024-05-30 09:27:03] [INFO ] Time to serialize gal into /tmp/LTLFireability7198680146092568254.gal : 25 ms
[2024-05-30 09:27:03] [INFO ] Time to serialize properties into /tmp/LTLFireability18273315971618762985.ltl : 55 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7198680146092568254.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18273315971618762985.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((((((u114.Rows_6_4==0)||(u259.Cells_6_11==0))||(u486.Columns_11_4==0))&&(((u40.Rows_10_6==0)||(u303.Cells_10_3==0))||...466325
Formula 0 simplified : G!"(((((((((((((((u114.Rows_6_4==0)||(u259.Cells_6_11==0))||(u486.Columns_11_4==0))&&(((u40.Rows_10_6==0)||(u303.Cells_10_3==0))||(u...466315
ITS-tools command line returned an error code 137
[2024-05-30 09:46:33] [INFO ] Flatten gal took : 507 ms
[2024-05-30 09:46:33] [INFO ] Input system was already deterministic with 2197 transitions.
[2024-05-30 09:46:33] [INFO ] Transformed 507 places.
[2024-05-30 09:46:33] [INFO ] Transformed 2197 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
java.lang.NullPointerException: Cannot read the array length because "order" is null
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.computeOrderWithGreatSPN(MultiOrderRunner.java:60)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:143)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 09:46:34] [INFO ] Time to serialize gal into /tmp/LTLFireability9153689389308192363.gal : 16 ms
[2024-05-30 09:46:34] [INFO ] Time to serialize properties into /tmp/LTLFireability14149783467717027508.ltl : 76 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9153689389308192363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14149783467717027508.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("(((((((((((((((Rows_6_4==0)||(Cells_6_11==0))||(Columns_11_4==0))&&(((Rows_10_6==0)||(Cells_10_3==0))||(Columns_3_6==0)))&&((((...371672
Formula 0 simplified : G!"(((((((((((((((Rows_6_4==0)||(Cells_6_11==0))||(Columns_11_4==0))&&(((Rows_10_6==0)||(Cells_10_3==0))||(Columns_3_6==0)))&&((((Ro...371662
pins2lts-mc-linux64, 0.000: Registering PINS so language module
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( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.321: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.321: LTL layer: formula: (<>((LTLAPp0==true))&&X(((LTLAPp1==true)&&X((LTLAPp1==true)))))
pins2lts-mc-linux64( 3/ 8), 0.321: "(<>((LTLAPp0==true))&&X(((LTLAPp1==true)&&X((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.322: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.328: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.332: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.337: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.340: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.347: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.357: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.350: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.389: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.356: DFS-FIFO for weak LTL, using special progress label 2200
pins2lts-mc-linux64( 0/ 8), 1.356: There are 2201 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.356: State length is 508, there are 2209 groups
pins2lts-mc-linux64( 0/ 8), 1.356: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.356: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.356: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.356: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 10.468: ~113 levels ~960 states ~855752 transitions
pins2lts-mc-linux64( 2/ 8), 10.572: ~149 levels ~1920 states ~866808 transitions
pins2lts-mc-linux64( 2/ 8), 10.712: ~149 levels ~3840 states ~874824 transitions
pins2lts-mc-linux64( 2/ 8), 10.932: ~149 levels ~7680 states ~894152 transitions
pins2lts-mc-linux64( 2/ 8), 11.450: ~149 levels ~15360 states ~932912 transitions
pins2lts-mc-linux64( 2/ 8), 12.413: ~149 levels ~30720 states ~1027128 transitions
pins2lts-mc-linux64( 2/ 8), 14.406: ~149 levels ~61440 states ~1217280 transitions
pins2lts-mc-linux64( 2/ 8), 18.481: ~149 levels ~122880 states ~1641568 transitions
pins2lts-mc-linux64( 2/ 8), 29.617: ~149 levels ~245760 states ~2536032 transitions
pins2lts-mc-linux64( 2/ 8), 46.479: ~149 levels ~491520 states ~4337352 transitions
pins2lts-mc-linux64( 2/ 8), 81.927: ~149 levels ~983040 states ~8356456 transitions
pins2lts-mc-linux64( 2/ 8), 154.169: ~150 levels ~1966080 states ~16120864 transitions
pins2lts-mc-linux64( 2/ 8), 314.865: ~150 levels ~3932160 states ~32580224 transitions
pins2lts-mc-linux64( 7/ 8), 605.458: ~145 levels ~7864320 states ~68834840 transitions
pins2lts-mc-linux64( 7/ 8), 1199.851: ~145 levels ~15728640 states ~139537112 transitions
pins2lts-mc-linux64( 0/ 8), 1741.949: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1742.074:
pins2lts-mc-linux64( 0/ 8), 1742.074: mean standard work distribution: 2.8% (states) 3.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 1742.075:
pins2lts-mc-linux64( 0/ 8), 1742.075: Explored 20629704 states 195140174 transitions, fanout: 9.459
pins2lts-mc-linux64( 0/ 8), 1742.075: Total exploration time 1740.700 sec (1740.580 sec minimum, 1740.639 sec on average)
pins2lts-mc-linux64( 0/ 8), 1742.075: States per second: 11851, Transitions per second: 112104
pins2lts-mc-linux64( 0/ 8), 1742.075:
pins2lts-mc-linux64( 0/ 8), 1742.075: Progress states detected: 2372035
pins2lts-mc-linux64( 0/ 8), 1742.075: Redundant explorations: -13.1044
pins2lts-mc-linux64( 0/ 8), 1742.075:
pins2lts-mc-linux64( 0/ 8), 1742.075: Queue width: 8B, total height: 4746706, memory: 36.21MB
pins2lts-mc-linux64( 0/ 8), 1742.075: Tree memory: 437.1MB, 19.3 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 1742.075: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1742.075: Stored 2274 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1742.075: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1742.075: Est. total memory use: 473.3MB (~1060.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2101769387646628086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(((LTLAPp1==true)&&X((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2101769387646628086;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(((LTLAPp1==true)&&X((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:840)

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-AN13"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN13, 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 r400-tall-171690532900668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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