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-171690532400459.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-COL-AN07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532400459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K Apr 12 11:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 11:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 11:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 11:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 11:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 11:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717027537262

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-30 00:05:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 00:05:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 00:05:38] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 00:05:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 00:05:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 461 ms
[2024-05-30 00:05:38] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 490 PT places and 343.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 00:05:39] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 53 ms.
[2024-05-30 00:05:39] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 8 formulas.
FORMULA Sudoku-COL-AN07-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 8 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40184 steps (784 resets) in 225 ms. (177 steps per ms) remains 5/16 properties
BEST_FIRST walk for 40184 steps (784 resets) in 56 ms. (704 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40184 steps (784 resets) in 89 ms. (446 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40184 steps (784 resets) in 50 ms. (787 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40184 steps (784 resets) in 73 ms. (543 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40184 steps (784 resets) in 83 ms. (478 steps per ms) remains 5/5 properties
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 00:05:39] [INFO ] Computed 3 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 5 solved, 0 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 155ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 8 simplifications.
FORMULA Sudoku-COL-AN07-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 00:05:39] [INFO ] Flatten gal took : 11 ms
FORMULA Sudoku-COL-AN07-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 00:05:39] [INFO ] Flatten gal took : 1 ms
Domain [N(7), N(7)] of place Rows breaks symmetries in sort N
[2024-05-30 00:05:39] [INFO ] Unfolded HLPN to a Petri net with 490 places and 343 transitions 1372 arcs in 19 ms.
[2024-05-30 00:05:39] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Support contains 490 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 490 cols
[2024-05-30 00:05:39] [INFO ] Computed 147 invariants in 21 ms
[2024-05-30 00:05:40] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-30 00:05:40] [INFO ] Invariant cache hit.
[2024-05-30 00:05:40] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 490/490 places, 343/343 transitions.
Support contains 490 out of 490 places after structural reductions.
[2024-05-30 00:05:40] [INFO ] Flatten gal took : 54 ms
[2024-05-30 00:05:40] [INFO ] Flatten gal took : 52 ms
[2024-05-30 00:05:40] [INFO ] Input system was already deterministic with 343 transitions.
RANDOM walk for 40000 steps (939 resets) in 3039 ms. (13 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 3/3 properties
[2024-05-30 00:05:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 490/833 variables, and 147 constraints, problems are : Problem set: 3 solved, 0 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 277ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Sudoku-COL-AN07-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 5 simplifications.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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' '!(X(X(X(X(G(p0))))))'
Support contains 490 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 4 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:05:42] [INFO ] Invariant cache hit.
[2024-05-30 00:05:42] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-30 00:05:42] [INFO ] Invariant cache hit.
[2024-05-30 00:05:42] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 320 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 324 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-00 finished in 684 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 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 33 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:05:42] [INFO ] Invariant cache hit.
[2024-05-30 00:05:43] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-30 00:05:43] [INFO ] Invariant cache hit.
[2024-05-30 00:05:43] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2024-05-30 00:05:43] [INFO ] Redundant transitions in 17 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 660 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-03
Product exploration explored 100000 steps with 2350 reset in 3422 ms.
Product exploration explored 100000 steps with 2348 reset in 3349 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 100 steps (0 resets) in 10 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-30 00:05:51] [INFO ] Invariant cache hit.
[2024-05-30 00:05:52] [INFO ] [Real]Absence check using 147 positive place invariants in 48 ms returned sat
[2024-05-30 00:05:52] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2024-05-30 00:05:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 00:05:53] [INFO ] [Nat]Absence check using 147 positive place invariants in 284 ms returned sat
[2024-05-30 00:05:54] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2024-05-30 00:05:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-30 00:05:54] [INFO ] Added : 0 causal constraints over 0 iterations in 57 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 26 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:05:54] [INFO ] Invariant cache hit.
[2024-05-30 00:05:54] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-30 00:05:54] [INFO ] Invariant cache hit.
[2024-05-30 00:05:54] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2024-05-30 00:05:54] [INFO ] Redundant transitions in 7 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 578 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 100 steps (0 resets) in 10 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-30 00:05:56] [INFO ] Invariant cache hit.
[2024-05-30 00:05:57] [INFO ] [Real]Absence check using 147 positive place invariants in 39 ms returned sat
[2024-05-30 00:05:57] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2024-05-30 00:05:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 00:05:58] [INFO ] [Nat]Absence check using 147 positive place invariants in 285 ms returned sat
[2024-05-30 00:05:58] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2024-05-30 00:05:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-30 00:05:58] [INFO ] Added : 0 causal constraints over 0 iterations in 51 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2347 reset in 3288 ms.
Product exploration explored 100000 steps with 2347 reset in 3335 ms.
Built C files in :
/tmp/ltsmin708274304336957579
[2024-05-30 00:06:05] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-30 00:06:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:06:05] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-30 00:06:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:06:05] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-30 00:06:05] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:06:05] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin708274304336957579
Running compilation step : cd /tmp/ltsmin708274304336957579;'/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'
Compilation finished in 1091 ms.
Running link step : cd /tmp/ltsmin708274304336957579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin708274304336957579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12340660357121182723.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 25 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:06:20] [INFO ] Invariant cache hit.
[2024-05-30 00:06:20] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-30 00:06:20] [INFO ] Invariant cache hit.
[2024-05-30 00:06:21] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-30 00:06:21] [INFO ] Redundant transitions in 4 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 527 ms. Remains : 490/490 places, 343/343 transitions.
Built C files in :
/tmp/ltsmin1911078627909091606
[2024-05-30 00:06:21] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-30 00:06:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:06:21] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-30 00:06:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:06:21] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-30 00:06:21] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:06:21] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1911078627909091606
Running compilation step : cd /tmp/ltsmin1911078627909091606;'/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'
Compilation finished in 964 ms.
Running link step : cd /tmp/ltsmin1911078627909091606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1911078627909091606;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13102485655395605848.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 00:06:36] [INFO ] Flatten gal took : 40 ms
[2024-05-30 00:06:36] [INFO ] Flatten gal took : 33 ms
[2024-05-30 00:06:36] [INFO ] Time to serialize gal into /tmp/LTL2480411648394955712.gal : 6 ms
[2024-05-30 00:06:36] [INFO ] Time to serialize properties into /tmp/LTL16396797891200361780.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2480411648394955712.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1684110513889453917.hoa' '-atoms' '/tmp/LTL16396797891200361780.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...318
Loading property file /tmp/LTL16396797891200361780.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1684110513889453917.hoa
Detected timeout of ITS tools.
[2024-05-30 00:06:51] [INFO ] Flatten gal took : 24 ms
[2024-05-30 00:06:51] [INFO ] Flatten gal took : 24 ms
[2024-05-30 00:06:51] [INFO ] Time to serialize gal into /tmp/LTL239270985042855519.gal : 4 ms
[2024-05-30 00:06:51] [INFO ] Time to serialize properties into /tmp/LTL5264876393163496020.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL239270985042855519.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5264876393163496020.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...274
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...4567
Formula 0 simplified : GF!"(((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Cel...4561
Detected timeout of ITS tools.
[2024-05-30 00:07:06] [INFO ] Flatten gal took : 25 ms
[2024-05-30 00:07:06] [INFO ] Applying decomposition
[2024-05-30 00:07:06] [INFO ] Flatten gal took : 21 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/graph11477944800726812814.txt' '-o' '/tmp/graph11477944800726812814.bin' '-w' '/tmp/graph11477944800726812814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11477944800726812814.bin' '-l' '-1' '-v' '-w' '/tmp/graph11477944800726812814.weights' '-q' '0' '-e' '0.001'
[2024-05-30 00:07:07] [INFO ] Decomposing Gal with order
[2024-05-30 00:07:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 00:07:07] [INFO ] Removed a total of 448 redundant transitions.
[2024-05-30 00:07:07] [INFO ] Flatten gal took : 216 ms
[2024-05-30 00:07:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 14 ms.
[2024-05-30 00:07:07] [INFO ] Time to serialize gal into /tmp/LTL17805962402022462436.gal : 6 ms
[2024-05-30 00:07:07] [INFO ] Time to serialize properties into /tmp/LTL982809365878941039.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17805962402022462436.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL982809365878941039.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...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((gu72.Cells_0+gu72.Cells_1)+(gu72.Cells_2+gu72.Cells_3))+((gu72.Cells_4+gu72.Cells_5)+(gu72.Cells_6+gu72.Cells_7)))+(((g...6527
Formula 0 simplified : GF!"(((((((gu72.Cells_0+gu72.Cells_1)+(gu72.Cells_2+gu72.Cells_3))+((gu72.Cells_4+gu72.Cells_5)+(gu72.Cells_6+gu72.Cells_7)))+(((gu7...6521
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN07-LTLCardinality-03 finished in 99691 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 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 13 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:07:22] [INFO ] Invariant cache hit.
[2024-05-30 00:07:22] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-30 00:07:22] [INFO ] Invariant cache hit.
[2024-05-30 00:07:23] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2024-05-30 00:07:23] [INFO ] Redundant transitions in 4 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 560 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-04
Product exploration explored 100000 steps with 3846 reset in 3720 ms.
Product exploration explored 100000 steps with 3846 reset in 3738 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 100 steps (0 resets) in 15 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-30 00:07:32] [INFO ] Invariant cache hit.
[2024-05-30 00:07:33] [INFO ] [Real]Absence check using 147 positive place invariants in 43 ms returned sat
[2024-05-30 00:07:33] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2024-05-30 00:07:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 00:07:34] [INFO ] [Nat]Absence check using 147 positive place invariants in 251 ms returned sat
[2024-05-30 00:07:34] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2024-05-30 00:07:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-30 00:07:35] [INFO ] Added : 0 causal constraints over 0 iterations in 77 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:07:35] [INFO ] Invariant cache hit.
[2024-05-30 00:07:35] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-30 00:07:35] [INFO ] Invariant cache hit.
[2024-05-30 00:07:35] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-05-30 00:07:35] [INFO ] Redundant transitions in 2 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 529 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 100 steps (0 resets) in 14 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-30 00:07:37] [INFO ] Invariant cache hit.
[2024-05-30 00:07:38] [INFO ] [Real]Absence check using 147 positive place invariants in 41 ms returned sat
[2024-05-30 00:07:38] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-05-30 00:07:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 00:07:39] [INFO ] [Nat]Absence check using 147 positive place invariants in 243 ms returned sat
[2024-05-30 00:07:40] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2024-05-30 00:07:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-30 00:07:40] [INFO ] Added : 0 causal constraints over 0 iterations in 57 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3846 reset in 3678 ms.
Product exploration explored 100000 steps with 3846 reset in 3781 ms.
Built C files in :
/tmp/ltsmin4960133213346190022
[2024-05-30 00:07:47] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-30 00:07:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:07:47] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-30 00:07:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:07:47] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-30 00:07:47] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:07:47] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4960133213346190022
Running compilation step : cd /tmp/ltsmin4960133213346190022;'/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'
Compilation finished in 942 ms.
Running link step : cd /tmp/ltsmin4960133213346190022;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4960133213346190022;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4243304332448041903.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:08:02] [INFO ] Invariant cache hit.
[2024-05-30 00:08:02] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-30 00:08:02] [INFO ] Invariant cache hit.
[2024-05-30 00:08:03] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2024-05-30 00:08:03] [INFO ] Redundant transitions in 1 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 497 ms. Remains : 490/490 places, 343/343 transitions.
Built C files in :
/tmp/ltsmin4874303263016382149
[2024-05-30 00:08:03] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-30 00:08:03] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:08:03] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-30 00:08:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:08:03] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-30 00:08:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:08:03] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4874303263016382149
Running compilation step : cd /tmp/ltsmin4874303263016382149;'/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'
Compilation finished in 929 ms.
Running link step : cd /tmp/ltsmin4874303263016382149;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4874303263016382149;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2014063964837674483.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 00:08:18] [INFO ] Flatten gal took : 20 ms
[2024-05-30 00:08:18] [INFO ] Flatten gal took : 20 ms
[2024-05-30 00:08:18] [INFO ] Time to serialize gal into /tmp/LTL16011805518682408382.gal : 4 ms
[2024-05-30 00:08:18] [INFO ] Time to serialize properties into /tmp/LTL432348517384477331.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16011805518682408382.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1700426990326444593.hoa' '-atoms' '/tmp/LTL432348517384477331.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/LTL432348517384477331.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1700426990326444593.hoa
Detected timeout of ITS tools.
[2024-05-30 00:08:33] [INFO ] Flatten gal took : 17 ms
[2024-05-30 00:08:33] [INFO ] Flatten gal took : 17 ms
[2024-05-30 00:08:33] [INFO ] Time to serialize gal into /tmp/LTL5485801168528174260.gal : 11 ms
[2024-05-30 00:08:33] [INFO ] Time to serialize properties into /tmp/LTL12418312104356723549.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5485801168528174260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12418312104356723549.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("(((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+(...4999
Formula 0 simplified : G!"(((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((...4995
Detected timeout of ITS tools.
[2024-05-30 00:08:48] [INFO ] Flatten gal took : 18 ms
[2024-05-30 00:08:48] [INFO ] Applying decomposition
[2024-05-30 00:08:48] [INFO ] Flatten gal took : 16 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/graph12630843336487047261.txt' '-o' '/tmp/graph12630843336487047261.bin' '-w' '/tmp/graph12630843336487047261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12630843336487047261.bin' '-l' '-1' '-v' '-w' '/tmp/graph12630843336487047261.weights' '-q' '0' '-e' '0.001'
[2024-05-30 00:08:48] [INFO ] Decomposing Gal with order
[2024-05-30 00:08:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 00:08:48] [INFO ] Removed a total of 294 redundant transitions.
[2024-05-30 00:08:48] [INFO ] Flatten gal took : 121 ms
[2024-05-30 00:08:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 343 labels/synchronizations in 25 ms.
[2024-05-30 00:08:49] [INFO ] Time to serialize gal into /tmp/LTL8777028170212229146.gal : 13 ms
[2024-05-30 00:08:49] [INFO ] Time to serialize properties into /tmp/LTL6293250554625252613.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8777028170212229146.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6293250554625252613.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...275
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((((gu1.Board_0+gu1.Board_1)+(gu1.Board_2+gu1.Board_3))+((gu1.Board_4+gu1.Board_5)+(gu1.Board_6+gu1.Board_7)))+(((gu1.Boa...6763
Formula 0 simplified : G!"(((((((((((gu1.Board_0+gu1.Board_1)+(gu1.Board_2+gu1.Board_3))+((gu1.Board_4+gu1.Board_5)+(gu1.Board_6+gu1.Board_7)))+(((gu1.Boar...6759
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN07-LTLCardinality-04 finished in 101587 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)||(p1&&X(p2)))))'
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:09:04] [INFO ] Invariant cache hit.
[2024-05-30 00:09:04] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-30 00:09:04] [INFO ] Invariant cache hit.
[2024-05-30 00:09:04] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 410 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 412 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-06
Product exploration explored 100000 steps with 3846 reset in 7164 ms.
Product exploration explored 100000 steps with 3846 reset in 7200 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 571 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (937 resets) in 2530 ms. (15 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1097 ms. (36 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1210 ms. (33 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 720 ms. (55 steps per ms) remains 3/3 properties
[2024-05-30 00:09:31] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 441/833 variables, and 98 constraints, problems are : Problem set: 3 solved, 0 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 98/147 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 475ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 29 factoid took 1634 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Support contains 392 out of 490 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:09:33] [INFO ] Invariant cache hit.
[2024-05-30 00:09:33] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-30 00:09:33] [INFO ] Invariant cache hit.
[2024-05-30 00:09:34] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-05-30 00:09:34] [INFO ] Redundant transitions in 2 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 398 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 307 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 40000 steps (937 resets) in 1523 ms. (26 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 662 ms. (60 steps per ms) remains 1/1 properties
[2024-05-30 00:09:40] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
After SMT solving in domain Real declared 392/833 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 16 factoid took 457 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 3846 reset in 4648 ms.
Product exploration explored 100000 steps with 3846 reset in 4689 ms.
Built C files in :
/tmp/ltsmin18031962801919207947
[2024-05-30 00:09:50] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-30 00:09:50] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:09:50] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-30 00:09:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:09:50] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-30 00:09:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:09:50] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18031962801919207947
Running compilation step : cd /tmp/ltsmin18031962801919207947;'/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'
Compilation finished in 986 ms.
Running link step : cd /tmp/ltsmin18031962801919207947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18031962801919207947;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5518343223695067963.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 10 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:10:05] [INFO ] Invariant cache hit.
[2024-05-30 00:10:05] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-30 00:10:05] [INFO ] Invariant cache hit.
[2024-05-30 00:10:06] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-05-30 00:10:06] [INFO ] Redundant transitions in 1 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 481 ms. Remains : 490/490 places, 343/343 transitions.
Built C files in :
/tmp/ltsmin1054179085654274063
[2024-05-30 00:10:06] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-30 00:10:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:10:06] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-30 00:10:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:10:06] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-30 00:10:06] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:10:06] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1054179085654274063
Running compilation step : cd /tmp/ltsmin1054179085654274063;'/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'
Compilation finished in 967 ms.
Running link step : cd /tmp/ltsmin1054179085654274063;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1054179085654274063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased559835775439818927.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 00:10:21] [INFO ] Flatten gal took : 15 ms
[2024-05-30 00:10:21] [INFO ] Flatten gal took : 13 ms
[2024-05-30 00:10:21] [INFO ] Time to serialize gal into /tmp/LTL14089833609079008723.gal : 3 ms
[2024-05-30 00:10:21] [INFO ] Time to serialize properties into /tmp/LTL894362090636711955.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14089833609079008723.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15604837652029209586.hoa' '-atoms' '/tmp/LTL894362090636711955.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...318
Loading property file /tmp/LTL894362090636711955.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15604837652029209586.hoa
Detected timeout of ITS tools.
[2024-05-30 00:10:36] [INFO ] Flatten gal took : 15 ms
[2024-05-30 00:10:36] [INFO ] Flatten gal took : 13 ms
[2024-05-30 00:10:36] [INFO ] Time to serialize gal into /tmp/LTL14564333899986234525.gal : 3 ms
[2024-05-30 00:10:36] [INFO ] Time to serialize properties into /tmp/LTL4330314611473226778.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14564333899986234525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4330314611473226778.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((G("((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(C...13807
Formula 0 simplified : G(F!"((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Col...13799
Detected timeout of ITS tools.
[2024-05-30 00:10:51] [INFO ] Flatten gal took : 17 ms
[2024-05-30 00:10:51] [INFO ] Applying decomposition
[2024-05-30 00:10:51] [INFO ] Flatten gal took : 14 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/graph13499919024018370210.txt' '-o' '/tmp/graph13499919024018370210.bin' '-w' '/tmp/graph13499919024018370210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13499919024018370210.bin' '-l' '-1' '-v' '-w' '/tmp/graph13499919024018370210.weights' '-q' '0' '-e' '0.001'
[2024-05-30 00:10:52] [INFO ] Decomposing Gal with order
[2024-05-30 00:10:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 00:10:52] [INFO ] Removed a total of 588 redundant transitions.
[2024-05-30 00:10:52] [INFO ] Flatten gal took : 102 ms
[2024-05-30 00:10:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 00:10:52] [INFO ] Time to serialize gal into /tmp/LTL13270615128856824765.gal : 2 ms
[2024-05-30 00:10:52] [INFO ] Time to serialize properties into /tmp/LTL5898557938233372437.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13270615128856824765.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5898557938233372437.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((G("((((((((gu2.Columns_0+gu2.Columns_1)+(gu2.Columns_2+gu2.Columns_3))+((gu2.Columns_4+gu2.Columns_5)+(gu2.Columns_6+gu2.Columns...18511
Formula 0 simplified : G(F!"((((((((gu2.Columns_0+gu2.Columns_1)+(gu2.Columns_2+gu2.Columns_3))+((gu2.Columns_4+gu2.Columns_5)+(gu2.Columns_6+gu2.Columns_7...18503
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN07-LTLCardinality-06 finished in 123130 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)))'
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 13 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:11:07] [INFO ] Invariant cache hit.
[2024-05-30 00:11:07] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-30 00:11:07] [INFO ] Invariant cache hit.
[2024-05-30 00:11:07] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-05-30 00:11:07] [INFO ] Redundant transitions in 2 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 533 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-12
Product exploration explored 100000 steps with 3846 reset in 3586 ms.
Product exploration explored 100000 steps with 3846 reset in 3629 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 100 steps (0 resets) in 12 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-05-30 00:11:16] [INFO ] Invariant cache hit.
[2024-05-30 00:11:17] [INFO ] [Real]Absence check using 147 positive place invariants in 37 ms returned sat
[2024-05-30 00:11:17] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2024-05-30 00:11:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 00:11:18] [INFO ] [Nat]Absence check using 147 positive place invariants in 270 ms returned sat
[2024-05-30 00:11:18] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2024-05-30 00:11:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-30 00:11:18] [INFO ] Added : 0 causal constraints over 0 iterations in 50 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 7 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:11:18] [INFO ] Invariant cache hit.
[2024-05-30 00:11:19] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-30 00:11:19] [INFO ] Invariant cache hit.
[2024-05-30 00:11:19] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-05-30 00:11:19] [INFO ] Redundant transitions in 1 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 627 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 100 steps (0 resets) in 15 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
[2024-05-30 00:11:20] [INFO ] Invariant cache hit.
[2024-05-30 00:11:21] [INFO ] [Real]Absence check using 147 positive place invariants in 44 ms returned sat
[2024-05-30 00:11:21] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2024-05-30 00:11:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 00:11:22] [INFO ] [Nat]Absence check using 147 positive place invariants in 273 ms returned sat
[2024-05-30 00:11:23] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2024-05-30 00:11:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-30 00:11:23] [INFO ] Added : 0 causal constraints over 0 iterations in 52 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3846 reset in 3575 ms.
Product exploration explored 100000 steps with 3846 reset in 3619 ms.
Built C files in :
/tmp/ltsmin1548820161318418476
[2024-05-30 00:11:30] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-30 00:11:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:11:30] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-30 00:11:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:11:30] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-30 00:11:30] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:11:30] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1548820161318418476
Running compilation step : cd /tmp/ltsmin1548820161318418476;'/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'
Compilation finished in 991 ms.
Running link step : cd /tmp/ltsmin1548820161318418476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1548820161318418476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13636994055044887467.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:11:45] [INFO ] Invariant cache hit.
[2024-05-30 00:11:45] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-30 00:11:45] [INFO ] Invariant cache hit.
[2024-05-30 00:11:45] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2024-05-30 00:11:45] [INFO ] Redundant transitions in 1 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 480 ms. Remains : 490/490 places, 343/343 transitions.
Built C files in :
/tmp/ltsmin1953838337634717821
[2024-05-30 00:11:46] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-30 00:11:46] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:11:46] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-30 00:11:46] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:11:46] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-30 00:11:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:11:46] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1953838337634717821
Running compilation step : cd /tmp/ltsmin1953838337634717821;'/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'
Compilation finished in 1006 ms.
Running link step : cd /tmp/ltsmin1953838337634717821;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1953838337634717821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17088965615435710078.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 00:12:01] [INFO ] Flatten gal took : 13 ms
[2024-05-30 00:12:01] [INFO ] Flatten gal took : 14 ms
[2024-05-30 00:12:01] [INFO ] Time to serialize gal into /tmp/LTL15543483836615377713.gal : 2 ms
[2024-05-30 00:12:01] [INFO ] Time to serialize properties into /tmp/LTL2091633056541692409.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15543483836615377713.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11268682756943977044.hoa' '-atoms' '/tmp/LTL2091633056541692409.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/LTL2091633056541692409.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11268682756943977044.hoa
Detected timeout of ITS tools.
[2024-05-30 00:12:16] [INFO ] Flatten gal took : 13 ms
[2024-05-30 00:12:16] [INFO ] Flatten gal took : 13 ms
[2024-05-30 00:12:16] [INFO ] Time to serialize gal into /tmp/LTL4728089950871805161.gal : 2 ms
[2024-05-30 00:12:16] [INFO ] Time to serialize properties into /tmp/LTL11798218333618164838.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4728089950871805161.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11798218333618164838.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 : !((G(F("((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+...4566
Formula 0 simplified : FG!"((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((...4560
Detected timeout of ITS tools.
[2024-05-30 00:12:31] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:12:31] [INFO ] Applying decomposition
[2024-05-30 00:12:31] [INFO ] Flatten gal took : 13 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/graph16175025991756049530.txt' '-o' '/tmp/graph16175025991756049530.bin' '-w' '/tmp/graph16175025991756049530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16175025991756049530.bin' '-l' '-1' '-v' '-w' '/tmp/graph16175025991756049530.weights' '-q' '0' '-e' '0.001'
[2024-05-30 00:12:31] [INFO ] Decomposing Gal with order
[2024-05-30 00:12:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 00:12:31] [INFO ] Removed a total of 444 redundant transitions.
[2024-05-30 00:12:31] [INFO ] Flatten gal took : 100 ms
[2024-05-30 00:12:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 8 ms.
[2024-05-30 00:12:31] [INFO ] Time to serialize gal into /tmp/LTL10728788770501490752.gal : 2 ms
[2024-05-30 00:12:31] [INFO ] Time to serialize properties into /tmp/LTL16156096370607375896.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10728788770501490752.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16156096370607375896.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((((gu72.Board_0+gu72.Board_1)+(gu72.Board_2+gu72.Board_3))+((gu72.Board_4+gu72.Board_5)+(gu72.Board_6+gu72.Board_7)))+(...6526
Formula 0 simplified : FG!"((((((((((gu72.Board_0+gu72.Board_1)+(gu72.Board_2+gu72.Board_3))+((gu72.Board_4+gu72.Board_5)+(gu72.Board_6+gu72.Board_7)))+(((...6520
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN07-LTLCardinality-12 finished in 99498 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)))'
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))'
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)||(p1&&X(p2)))))'
Found a Shortening insensitive property : Sudoku-COL-AN07-LTLCardinality-06
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 10 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:12:47] [INFO ] Invariant cache hit.
[2024-05-30 00:12:47] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-30 00:12:47] [INFO ] Invariant cache hit.
[2024-05-30 00:12:47] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 428 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 LI_LTL mode , in 1 iterations and 438 ms. Remains : 490/490 places, 343/343 transitions.
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-06
Product exploration explored 100000 steps with 3846 reset in 7222 ms.
Product exploration explored 100000 steps with 3846 reset in 7453 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 598 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (938 resets) in 3330 ms. (12 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 793 ms. (50 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 845 ms. (47 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 571 ms. (69 steps per ms) remains 3/3 properties
[2024-05-30 00:13:14] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 441/833 variables, and 98 constraints, problems are : Problem set: 3 solved, 0 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 98/147 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 330ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 29 factoid took 1661 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Support contains 392 out of 490 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 10 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:13:16] [INFO ] Invariant cache hit.
[2024-05-30 00:13:17] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-30 00:13:17] [INFO ] Invariant cache hit.
[2024-05-30 00:13:17] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-05-30 00:13:17] [INFO ] Redundant transitions in 3 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 407 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 286 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 40000 steps (937 resets) in 1386 ms. (28 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 668 ms. (59 steps per ms) remains 1/1 properties
[2024-05-30 00:13:23] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
After SMT solving in domain Real declared 392/833 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 16 factoid took 446 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 3846 reset in 4645 ms.
Product exploration explored 100000 steps with 3846 reset in 4679 ms.
Built C files in :
/tmp/ltsmin4504820488408586428
[2024-05-30 00:13:33] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-30 00:13:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:13:33] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-30 00:13:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:13:33] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-30 00:13:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:13:33] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4504820488408586428
Running compilation step : cd /tmp/ltsmin4504820488408586428;'/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'
Compilation finished in 1016 ms.
Running link step : cd /tmp/ltsmin4504820488408586428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4504820488408586428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10968206804241000131.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 6 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:13:48] [INFO ] Invariant cache hit.
[2024-05-30 00:13:49] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-30 00:13:49] [INFO ] Invariant cache hit.
[2024-05-30 00:13:49] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-30 00:13:49] [INFO ] Redundant transitions in 2 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 480 ms. Remains : 490/490 places, 343/343 transitions.
Built C files in :
/tmp/ltsmin14000207908850164637
[2024-05-30 00:13:49] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-30 00:13:49] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:13:49] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-30 00:13:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:13:49] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-30 00:13:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:13:49] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14000207908850164637
Running compilation step : cd /tmp/ltsmin14000207908850164637;'/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'
Compilation finished in 1007 ms.
Running link step : cd /tmp/ltsmin14000207908850164637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14000207908850164637;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4519918962297738161.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 00:14:04] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:14:04] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:14:04] [INFO ] Time to serialize gal into /tmp/LTL14868003946456813020.gal : 3 ms
[2024-05-30 00:14:04] [INFO ] Time to serialize properties into /tmp/LTL17480284943467193440.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14868003946456813020.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14149570625584560961.hoa' '-atoms' '/tmp/LTL17480284943467193440.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...320
Loading property file /tmp/LTL17480284943467193440.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14149570625584560961.hoa
Detected timeout of ITS tools.
[2024-05-30 00:14:19] [INFO ] Flatten gal took : 13 ms
[2024-05-30 00:14:19] [INFO ] Flatten gal took : 13 ms
[2024-05-30 00:14:19] [INFO ] Time to serialize gal into /tmp/LTL11067373182392721732.gal : 2 ms
[2024-05-30 00:14:19] [INFO ] Time to serialize properties into /tmp/LTL4349259845070089899.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11067373182392721732.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4349259845070089899.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((G("((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(C...13807
Formula 0 simplified : G(F!"((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Col...13799
Detected timeout of ITS tools.
[2024-05-30 00:14:34] [INFO ] Flatten gal took : 13 ms
[2024-05-30 00:14:34] [INFO ] Applying decomposition
[2024-05-30 00:14:34] [INFO ] Flatten gal took : 13 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/graph13273591643516529898.txt' '-o' '/tmp/graph13273591643516529898.bin' '-w' '/tmp/graph13273591643516529898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13273591643516529898.bin' '-l' '-1' '-v' '-w' '/tmp/graph13273591643516529898.weights' '-q' '0' '-e' '0.001'
[2024-05-30 00:14:35] [INFO ] Decomposing Gal with order
[2024-05-30 00:14:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 00:14:35] [INFO ] Removed a total of 588 redundant transitions.
[2024-05-30 00:14:35] [INFO ] Flatten gal took : 101 ms
[2024-05-30 00:14:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 00:14:35] [INFO ] Time to serialize gal into /tmp/LTL17344445131745684430.gal : 3 ms
[2024-05-30 00:14:35] [INFO ] Time to serialize properties into /tmp/LTL11552809107181420070.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17344445131745684430.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11552809107181420070.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...277
Read 1 LTL properties
Checking formula 0 : !((F((G("((((((((gu2.Columns_0+gu2.Columns_1)+(gu2.Columns_2+gu2.Columns_3))+((gu2.Columns_4+gu2.Columns_5)+(gu2.Columns_6+gu2.Columns...18511
Formula 0 simplified : G(F!"((((((((gu2.Columns_0+gu2.Columns_1)+(gu2.Columns_2+gu2.Columns_3))+((gu2.Columns_4+gu2.Columns_5)+(gu2.Columns_6+gu2.Columns_7...18503
Detected timeout of ITS tools.
Treatment of property Sudoku-COL-AN07-LTLCardinality-06 finished in 123261 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)))'
[2024-05-30 00:14:50] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12367457857903153384
[2024-05-30 00:14:50] [INFO ] Computing symmetric may disable matrix : 343 transitions.
[2024-05-30 00:14:50] [INFO ] Applying decomposition
[2024-05-30 00:14:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:14:50] [INFO ] Computing symmetric may enable matrix : 343 transitions.
[2024-05-30 00:14:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:14:50] [INFO ] Flatten gal took : 13 ms
[2024-05-30 00:14:50] [INFO ] Computing Do-Not-Accords matrix : 343 transitions.
[2024-05-30 00:14:50] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 00:14:50] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12367457857903153384
Running compilation step : cd /tmp/ltsmin12367457857903153384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' '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'
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/graph7730027689345389570.txt' '-o' '/tmp/graph7730027689345389570.bin' '-w' '/tmp/graph7730027689345389570.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7730027689345389570.bin' '-l' '-1' '-v' '-w' '/tmp/graph7730027689345389570.weights' '-q' '0' '-e' '0.001'
[2024-05-30 00:14:51] [INFO ] Decomposing Gal with order
[2024-05-30 00:14:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 00:14:51] [INFO ] Removed a total of 882 redundant transitions.
[2024-05-30 00:14:51] [INFO ] Flatten gal took : 134 ms
[2024-05-30 00:14:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 00:14:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality15285274014023381951.gal : 3 ms
[2024-05-30 00:14:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality1924699532396566743.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15285274014023381951.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1924699532396566743.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...298
Read 4 LTL properties
Checking formula 0 : !((F(G("(((((((gu2.Cells_0+gu2.Cells_1)+(gu2.Cells_2+gu2.Cells_3))+((gu2.Cells_4+gu2.Cells_5)+(gu2.Cells_6+gu2.Cells_7)))+(((gu2.Cells...6135
Formula 0 simplified : GF!"(((((((gu2.Cells_0+gu2.Cells_1)+(gu2.Cells_2+gu2.Cells_3))+((gu2.Cells_4+gu2.Cells_5)+(gu2.Cells_6+gu2.Cells_7)))+(((gu2.Cells_8...6129
Compilation finished in 1260 ms.
Running link step : cd /tmp/ltsmin12367457857903153384;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12367457857903153384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin12367457857903153384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12367457857903153384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp1==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin12367457857903153384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp1==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12367457857903153384;'/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' '<>(([]((LTLAPp2==true))||((LTLAPp3==true)&&X((LTLAPp4==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: LTL layer: formula: <>(([]((LTLAPp2==true))||((LTLAPp3==true)&&X((LTLAPp4==true)))))
pins2lts-mc-linux64( 1/ 8), 0.017: "<>(([]((LTLAPp2==true))||((LTLAPp3==true)&&X((LTLAPp4==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.017: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.145: There are 350 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.145: State length is 491, there are 359 groups
pins2lts-mc-linux64( 0/ 8), 0.145: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.145: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.145: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.145: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.499: [Blue] ~26 levels ~960 states ~34880 transitions
pins2lts-mc-linux64( 3/ 8), 0.520: [Blue] ~26 levels ~1920 states ~36176 transitions
pins2lts-mc-linux64( 0/ 8), 0.550: [Blue] ~26 levels ~3840 states ~37968 transitions
pins2lts-mc-linux64( 0/ 8), 0.610: [Blue] ~26 levels ~7680 states ~42880 transitions
pins2lts-mc-linux64( 2/ 8), 0.730: [Blue] ~26 levels ~15360 states ~62296 transitions
pins2lts-mc-linux64( 2/ 8), 0.966: [Blue] ~26 levels ~30720 states ~90152 transitions
pins2lts-mc-linux64( 2/ 8), 1.438: [Blue] ~26 levels ~61440 states ~154824 transitions
pins2lts-mc-linux64( 2/ 8), 2.301: [Blue] ~26 levels ~122880 states ~296056 transitions
pins2lts-mc-linux64( 1/ 8), 4.075: [Blue] ~26 levels ~245760 states ~592312 transitions
pins2lts-mc-linux64( 7/ 8), 7.310: [Blue] ~26 levels ~491520 states ~1370664 transitions
pins2lts-mc-linux64( 3/ 8), 13.361: [Blue] ~26 levels ~983040 states ~2946856 transitions
pins2lts-mc-linux64( 3/ 8), 25.034: [Blue] ~26 levels ~1966080 states ~6063368 transitions
pins2lts-mc-linux64( 3/ 8), 49.610: [Blue] ~26 levels ~3932160 states ~13495448 transitions
pins2lts-mc-linux64( 3/ 8), 99.997: [Blue] ~26 levels ~7864320 states ~28735648 transitions
pins2lts-mc-linux64( 0/ 8), 154.799: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 155.669:
pins2lts-mc-linux64( 0/ 8), 155.669: Explored 11561162 states 44257024 transitions, fanout: 3.828
pins2lts-mc-linux64( 0/ 8), 155.669: Total exploration time 155.490 sec (154.830 sec minimum, 155.180 sec on average)
pins2lts-mc-linux64( 0/ 8), 155.669: States per second: 74353, Transitions per second: 284629
pins2lts-mc-linux64( 0/ 8), 155.669:
pins2lts-mc-linux64( 0/ 8), 155.669: State space has 11592185 states, 11560962 are accepting
pins2lts-mc-linux64( 0/ 8), 155.669: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 155.669: blue states: 11561162 (99.73%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 155.669: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 155.669: all-red states: 11560962 (99.73%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 155.669:
pins2lts-mc-linux64( 0/ 8), 155.669: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 155.669:
pins2lts-mc-linux64( 0/ 8), 155.669: Queue width: 8B, total height: 208, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 155.669: Tree memory: 344.4MB, 31.2 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 155.669: Tree fill ratio (roots/leafs): 8.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 155.669: Stored 345 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 155.669: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 155.669: Est. total memory use: 344.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12367457857903153384;'/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' '<>(([]((LTLAPp2==true))||((LTLAPp3==true)&&X((LTLAPp4==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12367457857903153384;'/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' '<>(([]((LTLAPp2==true))||((LTLAPp3==true)&&X((LTLAPp4==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:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-30 00:30:29] [INFO ] Applying decomposition
[2024-05-30 00:30:29] [INFO ] Flatten gal took : 14 ms
[2024-05-30 00:30:29] [INFO ] Decomposing Gal with order
[2024-05-30 00:30:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 00:30:29] [INFO ] Removed a total of 693 redundant transitions.
[2024-05-30 00:30:29] [INFO ] Flatten gal took : 45 ms
[2024-05-30 00:30:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 00:30:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality8696215364881881403.gal : 5 ms
[2024-05-30 00:30:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality7824587138268700792.ltl : 3 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/LTLCardinality8696215364881881403.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7824587138268700792.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...297
Read 4 LTL properties
Checking formula 0 : !((F(G("(((((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))+(((g...7485
Formula 0 simplified : GF!"(((((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))+(((gNN...7479
ITS-tools command line returned an error code 137
[2024-05-30 00:40:48] [INFO ] Flatten gal took : 16 ms
[2024-05-30 00:40:48] [INFO ] Input system was already deterministic with 343 transitions.
[2024-05-30 00:40:48] [INFO ] Transformed 490 places.
[2024-05-30 00:40:48] [INFO ] Transformed 343 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 00:40:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality1705036949014232303.gal : 2 ms
[2024-05-30 00:40:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality6399875817063413393.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1705036949014232303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6399875817063413393.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...342
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...4567
Formula 0 simplified : GF!"(((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Cel...4561
ITS-tools command line returned an error code 137
Total runtime 2669573 ms.

BK_STOP 1717030208358

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN07"
export BK_EXAMINATION="LTLCardinality"
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-COL-AN07, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532400459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN07.tgz
mv Sudoku-COL-AN07 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;