Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545500291.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-PT-AN12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545500291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 599K Apr 30 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.8M Apr 30 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 30 12:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.7M Apr 30 12:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 181K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 599K May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 671K May 9 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.4M May 9 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 85K May 9 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 208K May 9 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 963K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1653109431880

Running Version 202205111006
[2022-05-21 05:03:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 05:03:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 05:03:53] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2022-05-21 05:03:53] [INFO ] Transformed 2160 places.
[2022-05-21 05:03:53] [INFO ] Transformed 1728 transitions.
[2022-05-21 05:03:53] [INFO ] Parsed PT model containing 2160 places and 1728 transitions in 328 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 129 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN12-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 32 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2022-05-21 05:03:53] [INFO ] Computed 432 place invariants in 37 ms
[2022-05-21 05:03:54] [INFO ] Implicit Places using invariants in 490 ms returned []
// Phase 1: matrix 1728 rows 2160 cols
[2022-05-21 05:03:54] [INFO ] Computed 432 place invariants in 17 ms
[2022-05-21 05:03:55] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1613 ms to find 0 implicit places.
// Phase 1: matrix 1728 rows 2160 cols
[2022-05-21 05:03:55] [INFO ] Computed 432 place invariants in 17 ms
[2022-05-21 05:03:56] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 2160 out of 2160 places after structural reductions.
[2022-05-21 05:03:56] [INFO ] Flatten gal took : 200 ms
[2022-05-21 05:03:56] [INFO ] Flatten gal took : 133 ms
[2022-05-21 05:03:57] [INFO ] Input system was already deterministic with 1728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 2217 ms. (steps per millisecond=4 ) properties (out of 19) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1728 rows 2160 cols
[2022-05-21 05:04:00] [INFO ] Computed 432 place invariants in 15 ms
[2022-05-21 05:04:01] [INFO ] After 1096ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-21 05:04:02] [INFO ] [Nat]Absence check using 432 positive place invariants in 111 ms returned sat
[2022-05-21 05:04:06] [INFO ] After 3066ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :3
[2022-05-21 05:04:06] [INFO ] After 3454ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :3
Attempting to minimize the solution found.
Minimization took 206 ms.
[2022-05-21 05:04:06] [INFO ] After 4887ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :3
Fused 9 Parikh solutions to 1 different solutions.
Finished Parikh walk after 144 steps, including 0 resets, run visited all 3 properties in 13 ms. (steps per millisecond=11 )
Parikh walk visited 3 properties in 15 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-AN12-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-AN12-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN12-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&F(X(p1))))'
Support contains 288 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1728 places and 0 transitions.
Iterating post reduction 0 with 1728 rules applied. Total rules applied 1728 place count 432 transition count 1728
Applied a total of 1728 rules in 37 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:04:07] [INFO ] Computed 35 place invariants in 119 ms
[2022-05-21 05:04:07] [INFO ] Implicit Places using invariants in 330 ms returned []
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:04:07] [INFO ] Computed 35 place invariants in 81 ms
[2022-05-21 05:04:09] [INFO ] Implicit Places using invariants and state equation in 1705 ms returned []
Implicit Place search using SMT with State Equation took 2040 ms to find 0 implicit places.
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:04:09] [INFO ] Computed 35 place invariants in 43 ms
[2022-05-21 05:04:09] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions, in 1 iterations. Remains : 432/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 688 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(LEQ 3 (ADD s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 87610 steps with 695 reset in 10001 ms.
Product exploration timeout after 88430 steps with 701 reset in 10002 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 297 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1118 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 211501 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211501 steps, saw 164003 distinct states, run finished after 3002 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:05:33] [INFO ] Computed 35 place invariants in 52 ms
[2022-05-21 05:05:33] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 27 ms returned sat
[2022-05-21 05:05:33] [INFO ] After 723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 05:05:33] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 24 ms returned sat
[2022-05-21 05:05:34] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 05:05:34] [INFO ] After 523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-21 05:05:34] [INFO ] After 669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 142 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 264 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 144 out of 432 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 15 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:05:35] [INFO ] Computed 35 place invariants in 51 ms
[2022-05-21 05:05:35] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:05:35] [INFO ] Computed 35 place invariants in 46 ms
[2022-05-21 05:05:37] [INFO ] Implicit Places using invariants and state equation in 2047 ms returned []
Implicit Place search using SMT with State Equation took 2289 ms to find 0 implicit places.
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:05:37] [INFO ] Computed 35 place invariants in 42 ms
[2022-05-21 05:05:38] [INFO ] Dead Transitions using invariants and state equation in 1428 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 432/432 places, 1728/1728 transitions.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1100 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 238961 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238961 steps, saw 169318 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:06:09] [INFO ] Computed 35 place invariants in 46 ms
[2022-05-21 05:06:10] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 25 ms returned sat
[2022-05-21 05:06:10] [INFO ] After 709ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 05:06:10] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 24 ms returned sat
[2022-05-21 05:06:11] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 05:06:11] [INFO ] After 509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-21 05:06:11] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 142 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 91060 steps with 722 reset in 10002 ms.
Product exploration timeout after 90350 steps with 717 reset in 10001 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 144 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 159 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2022-05-21 05:06:32] [INFO ] Redundant transitions in 94 ms returned []
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:06:32] [INFO ] Computed 35 place invariants in 39 ms
[2022-05-21 05:06:32] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 432/432 places, 1728/1728 transitions.
Product exploration timeout after 87920 steps with 698 reset in 10001 ms.
Product exploration timeout after 87980 steps with 697 reset in 10001 ms.
Built C files in :
/tmp/ltsmin13435064538576160164
[2022-05-21 05:06:52] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13435064538576160164
Running compilation step : cd /tmp/ltsmin13435064538576160164;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13435064538576160164;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13435064538576160164;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 144 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 17 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:06:56] [INFO ] Computed 35 place invariants in 61 ms
[2022-05-21 05:06:56] [INFO ] Implicit Places using invariants in 358 ms returned []
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:06:56] [INFO ] Computed 35 place invariants in 45 ms
[2022-05-21 05:06:58] [INFO ] Implicit Places using invariants and state equation in 2107 ms returned []
Implicit Place search using SMT with State Equation took 2467 ms to find 0 implicit places.
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:06:58] [INFO ] Computed 35 place invariants in 53 ms
[2022-05-21 05:06:59] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 432/432 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin5768565062943584572
[2022-05-21 05:06:59] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5768565062943584572
Running compilation step : cd /tmp/ltsmin5768565062943584572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5768565062943584572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5768565062943584572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-21 05:07:02] [INFO ] Flatten gal took : 78 ms
[2022-05-21 05:07:02] [INFO ] Flatten gal took : 70 ms
[2022-05-21 05:07:02] [INFO ] Time to serialize gal into /tmp/LTL12510993009915144832.gal : 15 ms
[2022-05-21 05:07:02] [INFO ] Time to serialize properties into /tmp/LTL12513434712144175621.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12510993009915144832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12513434712144175621.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1251099...268
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("(((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Colu...3751
Formula 0 simplified : !(XXG"(((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns...3738
Detected timeout of ITS tools.
[2022-05-21 05:07:17] [INFO ] Flatten gal took : 68 ms
[2022-05-21 05:07:17] [INFO ] Applying decomposition
[2022-05-21 05:07:17] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16088620898891907418.txt' '-o' '/tmp/graph16088620898891907418.bin' '-w' '/tmp/graph16088620898891907418.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16088620898891907418.bin' '-l' '-1' '-v' '-w' '/tmp/graph16088620898891907418.weights' '-q' '0' '-e' '0.001'
[2022-05-21 05:07:17] [INFO ] Decomposing Gal with order
[2022-05-21 05:07:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 05:07:18] [INFO ] Removed a total of 4752 redundant transitions.
[2022-05-21 05:07:18] [INFO ] Flatten gal took : 724 ms
[2022-05-21 05:07:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2022-05-21 05:07:18] [INFO ] Time to serialize gal into /tmp/LTL9540692366898517446.gal : 9 ms
[2022-05-21 05:07:18] [INFO ] Time to serialize properties into /tmp/LTL8132965005648893634.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9540692366898517446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8132965005648893634.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9540692...266
Read 1 LTL properties
Checking formula 0 : !(((X(X(G("(((((((((gu145.Columns_0_0+gu145.Columns_0_1)+(gu145.Columns_0_2+gu145.Columns_0_3))+((gu145.Columns_0_4+gu145.Columns_0_5)...5191
Formula 0 simplified : !(XXG"(((((((((gu145.Columns_0_0+gu145.Columns_0_1)+(gu145.Columns_0_2+gu145.Columns_0_3))+((gu145.Columns_0_4+gu145.Columns_0_5)+(g...5178
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4835881273780944787
[2022-05-21 05:07:33] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4835881273780944787
Running compilation step : cd /tmp/ltsmin4835881273780944787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4835881273780944787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4835881273780944787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Sudoku-PT-AN12-LTLCardinality-02 finished in 209827 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 54 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2022-05-21 05:07:36] [INFO ] Computed 432 place invariants in 8 ms
[2022-05-21 05:07:37] [INFO ] Implicit Places using invariants in 723 ms returned []
// Phase 1: matrix 1728 rows 2160 cols
[2022-05-21 05:07:37] [INFO ] Computed 432 place invariants in 14 ms
[2022-05-21 05:07:39] [INFO ] Implicit Places using invariants and state equation in 2003 ms returned []
Implicit Place search using SMT with State Equation took 2728 ms to find 0 implicit places.
// Phase 1: matrix 1728 rows 2160 cols
[2022-05-21 05:07:39] [INFO ] Computed 432 place invariants in 11 ms
[2022-05-21 05:07:40] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 52700 steps with 26350 reset in 10002 ms.
Product exploration timeout after 51640 steps with 25820 reset in 10002 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN12-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN12-LTLCardinality-05 finished in 133626 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(true U false)))'
Support contains 0 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 0 are kept as prefixes of interest. Removing 2160 places using SCC suffix rule.12 ms
Discarding 2160 places :
Also discarding 1728 output transitions
Drop transitions removed 1728 transitions
Applied a total of 1 rules in 18 ms. Remains 0 /2160 variables (removed 2160) and now considering 0/1728 (removed 1728) transitions.
[2022-05-21 05:09:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 05:09:50] [INFO ] Implicit Places using invariants in 6 ms returned []
[2022-05-21 05:09:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 05:09:50] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2022-05-21 05:09:50] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-21 05:09:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 05:09:50] [INFO ] Dead Transitions using invariants and state equation in 8 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 0/2160 places, 0/1728 transitions.
Finished structural reductions, in 1 iterations. Remains : 0/2160 places, 0/1728 transitions.
Stuttering acceptance computed with spot in 11 ms :[false]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-06 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-06 TRUE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-06 finished in 72 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U !p0))))'
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.10 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 43 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:09:50] [INFO ] Computed 35 place invariants in 39 ms
[2022-05-21 05:09:50] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:09:50] [INFO ] Computed 35 place invariants in 42 ms
[2022-05-21 05:09:52] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2091 ms to find 0 implicit places.
[2022-05-21 05:09:52] [INFO ] Redundant transitions in 140 ms returned []
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:09:52] [INFO ] Computed 35 place invariants in 45 ms
[2022-05-21 05:09:53] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions, in 1 iterations. Remains : 432/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 1092 ms :[p0, p0]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 92560 steps with 733 reset in 10001 ms.
Product exploration timeout after 92630 steps with 735 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 491 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1125 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 249329 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249329 steps, saw 171245 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:10:45] [INFO ] Computed 35 place invariants in 46 ms
[2022-05-21 05:10:45] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 27 ms returned sat
[2022-05-21 05:10:46] [INFO ] After 722ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 05:10:46] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 24 ms returned sat
[2022-05-21 05:10:47] [INFO ] After 569ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 05:10:47] [INFO ] After 635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2022-05-21 05:10:47] [INFO ] After 770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 143 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 6 ms.
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 1132 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Support contains 144 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 27 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:10:48] [INFO ] Computed 35 place invariants in 48 ms
[2022-05-21 05:10:48] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:10:49] [INFO ] Computed 35 place invariants in 39 ms
[2022-05-21 05:10:51] [INFO ] Implicit Places using invariants and state equation in 2077 ms returned []
Implicit Place search using SMT with State Equation took 2421 ms to find 0 implicit places.
[2022-05-21 05:10:51] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:10:51] [INFO ] Computed 35 place invariants in 49 ms
[2022-05-21 05:10:51] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 432/432 places, 1728/1728 transitions.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 543 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1129 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 248484 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 248484 steps, saw 171002 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:11:23] [INFO ] Computed 35 place invariants in 47 ms
[2022-05-21 05:11:23] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 26 ms returned sat
[2022-05-21 05:11:24] [INFO ] After 658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 05:11:24] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 24 ms returned sat
[2022-05-21 05:11:25] [INFO ] After 588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 05:11:25] [INFO ] After 649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-21 05:11:25] [INFO ] After 785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 143 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 6 ms.
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 261 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Stuttering acceptance computed with spot in 85 ms :[p0, p0]
Stuttering acceptance computed with spot in 57 ms :[p0, p0]
Product exploration timeout after 92250 steps with 732 reset in 10001 ms.
Product exploration timeout after 91380 steps with 725 reset in 10001 ms.
Built C files in :
/tmp/ltsmin15685485591527441019
[2022-05-21 05:11:45] [INFO ] Too many transitions (1728) to apply POR reductions. Disabling POR matrices.
[2022-05-21 05:11:45] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15685485591527441019
Running compilation step : cd /tmp/ltsmin15685485591527441019;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15685485591527441019;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15685485591527441019;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 144 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 26 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:11:48] [INFO ] Computed 35 place invariants in 61 ms
[2022-05-21 05:11:49] [INFO ] Implicit Places using invariants in 396 ms returned []
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:11:49] [INFO ] Computed 35 place invariants in 40 ms
[2022-05-21 05:11:51] [INFO ] Implicit Places using invariants and state equation in 2029 ms returned []
Implicit Place search using SMT with State Equation took 2430 ms to find 0 implicit places.
[2022-05-21 05:11:51] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 1728 rows 432 cols
[2022-05-21 05:11:51] [INFO ] Computed 35 place invariants in 43 ms
[2022-05-21 05:11:51] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 432/432 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin12985420998003556161
[2022-05-21 05:11:51] [INFO ] Too many transitions (1728) to apply POR reductions. Disabling POR matrices.
[2022-05-21 05:11:51] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12985420998003556161
Running compilation step : cd /tmp/ltsmin12985420998003556161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12985420998003556161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12985420998003556161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-21 05:11:54] [INFO ] Flatten gal took : 65 ms
[2022-05-21 05:11:55] [INFO ] Flatten gal took : 61 ms
[2022-05-21 05:11:55] [INFO ] Time to serialize gal into /tmp/LTL8525389344630177455.gal : 6 ms
[2022-05-21 05:11:55] [INFO ] Time to serialize properties into /tmp/LTL13017213944448142786.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8525389344630177455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13017213944448142786.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8525389...267
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(...3596
Formula 0 simplified : !XG("(((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Ce...3590
Detected timeout of ITS tools.
[2022-05-21 05:12:10] [INFO ] Flatten gal took : 57 ms
[2022-05-21 05:12:10] [INFO ] Applying decomposition
[2022-05-21 05:12:10] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9286742276423551968.txt' '-o' '/tmp/graph9286742276423551968.bin' '-w' '/tmp/graph9286742276423551968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9286742276423551968.bin' '-l' '-1' '-v' '-w' '/tmp/graph9286742276423551968.weights' '-q' '0' '-e' '0.001'
[2022-05-21 05:12:10] [INFO ] Decomposing Gal with order
[2022-05-21 05:12:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 05:12:10] [INFO ] Removed a total of 4752 redundant transitions.
[2022-05-21 05:12:10] [INFO ] Flatten gal took : 307 ms
[2022-05-21 05:12:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2022-05-21 05:12:10] [INFO ] Time to serialize gal into /tmp/LTL2974234864361994044.gal : 5 ms
[2022-05-21 05:12:10] [INFO ] Time to serialize properties into /tmp/LTL147109396935620645.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2974234864361994044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL147109396935620645.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2974234...265
Read 1 LTL properties
Checking formula 0 : !((X(G(("(((((((((gu144.Cells_0_0+gu144.Cells_0_1)+(gu144.Cells_0_2+gu144.Cells_0_3))+((gu144.Cells_0_4+gu144.Cells_0_5)+(gu144.Cells_...5324
Formula 0 simplified : !XG("(((((((((gu144.Cells_0_0+gu144.Cells_0_1)+(gu144.Cells_0_2+gu144.Cells_0_3))+((gu144.Cells_0_4+gu144.Cells_0_5)+(gu144.Cells_0_...5318
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8564798492340989659
[2022-05-21 05:12:25] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8564798492340989659
Running compilation step : cd /tmp/ltsmin8564798492340989659;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8564798492340989659;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8564798492340989659;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Sudoku-PT-AN12-LTLCardinality-07 finished in 158289 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 429 are kept as prefixes of interest. Removing 1731 places using SCC suffix rule.8 ms
Discarding 1731 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 100 ms. Remains 429 /2160 variables (removed 1731) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 429 cols
[2022-05-21 05:12:29] [INFO ] Computed 32 place invariants in 74 ms
[2022-05-21 05:12:29] [INFO ] Implicit Places using invariants in 434 ms returned []
// Phase 1: matrix 1728 rows 429 cols
[2022-05-21 05:12:29] [INFO ] Computed 32 place invariants in 97 ms
[2022-05-21 05:12:30] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
[2022-05-21 05:12:31] [INFO ] Redundant transitions in 102 ms returned []
// Phase 1: matrix 1728 rows 429 cols
[2022-05-21 05:12:31] [INFO ] Computed 32 place invariants in 44 ms
[2022-05-21 05:12:31] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 429/2160 places, 1728/1728 transitions.
Finished structural reductions, in 1 iterations. Remains : 429/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s25 s140)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 455 steps with 6 reset in 69 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-12 finished in 2952 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(p1 U G(!p0)))))'
Support contains 4 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 434 are kept as prefixes of interest. Removing 1726 places using SCC suffix rule.6 ms
Discarding 1726 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 49 ms. Remains 434 /2160 variables (removed 1726) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 434 cols
[2022-05-21 05:12:31] [INFO ] Computed 35 place invariants in 122 ms
[2022-05-21 05:12:32] [INFO ] Implicit Places using invariants in 521 ms returned []
// Phase 1: matrix 1728 rows 434 cols
[2022-05-21 05:12:32] [INFO ] Computed 35 place invariants in 139 ms
[2022-05-21 05:12:34] [INFO ] Implicit Places using invariants and state equation in 2182 ms returned []
Implicit Place search using SMT with State Equation took 2704 ms to find 0 implicit places.
[2022-05-21 05:12:34] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 1728 rows 434 cols
[2022-05-21 05:12:34] [INFO ] Computed 35 place invariants in 120 ms
[2022-05-21 05:12:35] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 434/2160 places, 1728/1728 transitions.
Finished structural reductions, in 1 iterations. Remains : 434/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 1057 ms :[false, (NOT p0), p0, p0, true]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s86 s144), p1:(LEQ s145 s60)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 18886 steps with 149 reset in 1880 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-15 finished in 6364 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&F(X(p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U !p0))))'
[2022-05-21 05:12:38] [INFO ] Flatten gal took : 70 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15161544746826715221
[2022-05-21 05:12:38] [INFO ] Too many transitions (1728) to apply POR reductions. Disabling POR matrices.
[2022-05-21 05:12:38] [INFO ] Applying decomposition
[2022-05-21 05:12:38] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15161544746826715221
Running compilation step : cd /tmp/ltsmin15161544746826715221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-21 05:12:38] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3525396941980151967.txt' '-o' '/tmp/graph3525396941980151967.bin' '-w' '/tmp/graph3525396941980151967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3525396941980151967.bin' '-l' '-1' '-v' '-w' '/tmp/graph3525396941980151967.weights' '-q' '0' '-e' '0.001'
[2022-05-21 05:12:38] [INFO ] Decomposing Gal with order
[2022-05-21 05:12:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 05:12:40] [INFO ] Removed a total of 3024 redundant transitions.
[2022-05-21 05:12:40] [INFO ] Flatten gal took : 1579 ms
[2022-05-21 05:12:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-21 05:12:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality2195800839539243476.gal : 9 ms
[2022-05-21 05:12:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality6569533138878451299.ltl : 391 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2195800839539243476.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6569533138878451299.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 2 LTL properties
Checking formula 0 : !(((X(X(G("(((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Column...4903
Formula 0 simplified : !(XXG"(((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0...4890
Compilation finished in 3873 ms.
Running link step : cd /tmp/ltsmin15161544746826715221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin15161544746826715221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X([]((LTLAPp0==true))))&&<>(X((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: LTL layer: formula: (X(X([]((LTLAPp0==true))))&&<>(X((LTLAPp1==true))))
pins2lts-mc-linux64( 1/ 8), 0.016: "(X(X([]((LTLAPp0==true))))&&<>(X((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.017: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.049: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.400: DFS-FIFO for weak LTL, using special progress label 1732
pins2lts-mc-linux64( 0/ 8), 0.400: There are 1733 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.400: State length is 2161, there are 1737 groups
pins2lts-mc-linux64( 0/ 8), 0.400: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.400: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.400: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.400: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 8.732: ~1 levels ~960 states ~1603904 transitions
pins2lts-mc-linux64( 4/ 8), 15.124: ~1 levels ~1920 states ~3198032 transitions
pins2lts-mc-linux64( 7/ 8), 28.483: ~1 levels ~3840 states ~6384672 transitions
pins2lts-mc-linux64( 6/ 8), 48.006: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 83.119:
pins2lts-mc-linux64( 0/ 8), 83.119: mean standard work distribution: 1.5% (states) 1.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 83.119:
pins2lts-mc-linux64( 0/ 8), 83.119: Explored 6338 states 10577516 transitions, fanout: 1668.904
pins2lts-mc-linux64( 0/ 8), 83.119: Total exploration time 82.700 sec (48.520 sec minimum, 66.616 sec on average)
pins2lts-mc-linux64( 0/ 8), 83.119: States per second: 77, Transitions per second: 127902
pins2lts-mc-linux64( 0/ 8), 83.119:
pins2lts-mc-linux64( 0/ 8), 83.119: Progress states detected: 7796258
pins2lts-mc-linux64( 0/ 8), 83.119: Redundant explorations: -99.9187
pins2lts-mc-linux64( 0/ 8), 83.119:
pins2lts-mc-linux64( 0/ 8), 83.119: Queue width: 8B, total height: 9251026, memory: 70.58MB
pins2lts-mc-linux64( 0/ 8), 83.119: Tree memory: 315.5MB, 42.4 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 83.119: Tree fill ratio (roots/leafs): 5.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 83.119: Stored 1779 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 83.119: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 83.119: Est. total memory use: 386.1MB (~1094.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15161544746826715221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X([]((LTLAPp0==true))))&&<>(X((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15161544746826715221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(X([]((LTLAPp0==true))))&&<>(X((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-21 05:36:04] [INFO ] Flatten gal took : 593 ms
[2022-05-21 05:36:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality6139730170492585720.gal : 69 ms
[2022-05-21 05:36:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality1453656610588903574.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6139730170492585720.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1453656610588903574.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 2 LTL properties
Checking formula 0 : !(((X(X(G("(((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Colu...3751
Formula 0 simplified : !(XXG"(((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns...3738
Detected timeout of ITS tools.
[2022-05-21 05:59:30] [INFO ] Flatten gal took : 452 ms
[2022-05-21 05:59:32] [INFO ] Input system was already deterministic with 1728 transitions.
[2022-05-21 05:59:42] [INFO ] Transformed 2160 places.
[2022-05-21 05:59:42] [INFO ] Transformed 1728 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-21 05:59:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality16319432441085956628.gal : 30 ms
[2022-05-21 05:59:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality3404224365061876529.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16319432441085956628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3404224365061876529.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(X(G("(((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Colu...3751
Formula 0 simplified : !(XXG"(((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns...3738

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN12"
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-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN12, 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 r258-tall-165303545500291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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