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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 1.2M Apr 30 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.4M Apr 30 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0M Apr 30 11:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 33M Apr 30 11:41 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 445K May 9 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1M May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3M May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 199K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 480K May 9 09:12 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 2.3M 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-AN16-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653116478970

Running Version 202205111006
[2022-05-21 07:01:20] [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 07:01:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:01:20] [INFO ] Load time of PNML (sax parser for PT used): 314 ms
[2022-05-21 07:01:20] [INFO ] Transformed 4864 places.
[2022-05-21 07:01:20] [INFO ] Transformed 4096 transitions.
[2022-05-21 07:01:20] [INFO ] Parsed PT model containing 4864 places and 4096 transitions in 441 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 469 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-AN16-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4864 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 54 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:01:21] [INFO ] Computed 768 place invariants in 68 ms
[2022-05-21 07:01:22] [INFO ] Implicit Places using invariants in 722 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:01:22] [INFO ] Computed 768 place invariants in 29 ms
[2022-05-21 07:01:22] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:01:22] [INFO ] Computed 768 place invariants in 27 ms
[2022-05-21 07:01:25] [INFO ] Dead Transitions using invariants and state equation in 2661 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Support contains 4864 out of 4864 places after structural reductions.
[2022-05-21 07:01:25] [INFO ] Flatten gal took : 393 ms
[2022-05-21 07:01:25] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA Sudoku-PT-AN16-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 07:01:26] [INFO ] Flatten gal took : 243 ms
[2022-05-21 07:01:26] [INFO ] Input system was already deterministic with 4096 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 5722 ms. (steps per millisecond=1 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1264 ms. (steps per millisecond=7 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1144 ms. (steps per millisecond=8 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:01:36] [INFO ] Computed 768 place invariants in 36 ms
[2022-05-21 07:01:39] [INFO ] [Real]Absence check using 768 positive place invariants in 243 ms returned sat
[2022-05-21 07:02:02] [INFO ] After 25032ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-21 07:02:04] [INFO ] [Nat]Absence check using 768 positive place invariants in 258 ms returned sat
[2022-05-21 07:02:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-21 07:02:27] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4864 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 72 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 6263 ms. (steps per millisecond=1 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1122 ms. (steps per millisecond=8 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1056 ms. (steps per millisecond=9 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 142971 steps, run timeout after 27042 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 142971 steps, saw 142928 distinct states, run finished after 27045 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:03:04] [INFO ] Computed 768 place invariants in 18 ms
[2022-05-21 07:03:06] [INFO ] [Real]Absence check using 768 positive place invariants in 263 ms returned sat
[2022-05-21 07:03:30] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-21 07:03:31] [INFO ] [Nat]Absence check using 768 positive place invariants in 248 ms returned sat
[2022-05-21 07:03:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-21 07:03:55] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 42 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 38 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:03:55] [INFO ] Computed 768 place invariants in 25 ms
[2022-05-21 07:03:56] [INFO ] Implicit Places using invariants in 483 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:03:56] [INFO ] Computed 768 place invariants in 14 ms
[2022-05-21 07:03:56] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
[2022-05-21 07:03:57] [INFO ] Redundant transitions in 277 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:03:57] [INFO ] Computed 768 place invariants in 17 ms
[2022-05-21 07:03:59] [INFO ] Dead Transitions using invariants and state equation in 2739 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Support contains 256 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 768 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.22 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 210 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:04:00] [INFO ] Computed 47 place invariants in 564 ms
[2022-05-21 07:04:01] [INFO ] Implicit Places using invariants in 1179 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:04:01] [INFO ] Computed 47 place invariants in 342 ms
[2022-05-21 07:04:05] [INFO ] Implicit Places using invariants and state equation in 4147 ms returned []
Implicit Place search using SMT with State Equation took 5328 ms to find 0 implicit places.
[2022-05-21 07:04:05] [INFO ] Redundant transitions in 263 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:04:06] [INFO ] Computed 47 place invariants in 267 ms
[2022-05-21 07:04:07] [INFO ] Dead Transitions using invariants and state equation in 1476 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-03 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 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], 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 37240 steps with 164 reset in 10001 ms.
Product exploration timeout after 37190 steps with 164 reset in 10003 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 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 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 2710 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Probabilistic random walk after 284663 steps, saw 284570 distinct states, run finished after 6004 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:04:37] [INFO ] Computed 47 place invariants in 269 ms
[2022-05-21 07:04:37] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 45 ms returned sat
[2022-05-21 07:04:42] [INFO ] After 4528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 07:04:42] [INFO ] [Nat]Absence check using 0 positive and 47 generalized place invariants in 42 ms returned sat
[2022-05-21 07:04:47] [INFO ] After 5234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 07:04:47] [INFO ] After 5387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-05-21 07:04:47] [INFO ] After 5620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 255 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 23 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 256 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 69 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:04:48] [INFO ] Computed 47 place invariants in 271 ms
[2022-05-21 07:04:49] [INFO ] Implicit Places using invariants in 907 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:04:49] [INFO ] Computed 47 place invariants in 259 ms
[2022-05-21 07:04:52] [INFO ] Implicit Places using invariants and state equation in 3749 ms returned []
Implicit Place search using SMT with State Equation took 4683 ms to find 0 implicit places.
[2022-05-21 07:04:53] [INFO ] Redundant transitions in 153 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:04:53] [INFO ] Computed 47 place invariants in 286 ms
[2022-05-21 07:04:54] [INFO ] Dead Transitions using invariants and state equation in 1540 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 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 62 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 2778 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 298141 steps, run timeout after 6008 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 298141 steps, saw 298040 distinct states, run finished after 6009 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:05:04] [INFO ] Computed 47 place invariants in 277 ms
[2022-05-21 07:05:04] [INFO ] [Real]Absence check using 0 positive and 47 generalized place invariants in 44 ms returned sat
[2022-05-21 07:05:09] [INFO ] After 4576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 07:05:09] [INFO ] [Nat]Absence check using 0 positive and 47 generalized place invariants in 42 ms returned sat
[2022-05-21 07:05:14] [INFO ] After 5349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 07:05:15] [INFO ] After 5542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2022-05-21 07:05:15] [INFO ] After 5765ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 255 steps, including 0 resets, run visited all 1 properties in 27 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 28 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 37540 steps with 166 reset in 10001 ms.
Product exploration timeout after 37350 steps with 165 reset in 10004 ms.
Built C files in :
/tmp/ltsmin11754392532538912729
[2022-05-21 07:05:35] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2022-05-21 07:05:35] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11754392532538912729
Running compilation step : cd /tmp/ltsmin11754392532538912729;'/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/ltsmin11754392532538912729;'/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/ltsmin11754392532538912729;'/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 256 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 120 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:05:38] [INFO ] Computed 47 place invariants in 264 ms
[2022-05-21 07:05:39] [INFO ] Implicit Places using invariants in 833 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:05:39] [INFO ] Computed 47 place invariants in 263 ms
[2022-05-21 07:05:43] [INFO ] Implicit Places using invariants and state equation in 3646 ms returned []
Implicit Place search using SMT with State Equation took 4490 ms to find 0 implicit places.
[2022-05-21 07:05:43] [INFO ] Redundant transitions in 147 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:05:43] [INFO ] Computed 47 place invariants in 279 ms
[2022-05-21 07:05:44] [INFO ] Dead Transitions using invariants and state equation in 1615 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Built C files in :
/tmp/ltsmin11874592421221405545
[2022-05-21 07:05:44] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2022-05-21 07:05:45] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11874592421221405545
Running compilation step : cd /tmp/ltsmin11874592421221405545;'/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/ltsmin11874592421221405545;'/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/ltsmin11874592421221405545;'/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 07:05:48] [INFO ] Flatten gal took : 348 ms
[2022-05-21 07:05:49] [INFO ] Flatten gal took : 165 ms
[2022-05-21 07:05:49] [INFO ] Time to serialize gal into /tmp/LTL2107519476413081880.gal : 37 ms
[2022-05-21 07:05:49] [INFO ] Time to serialize properties into /tmp/LTL3293253976369063953.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/LTL2107519476413081880.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3293253976369063953.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/LTL2107519...266
Read 1 LTL properties
Checking formula 0 : !((F(G(F("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10...3047
Formula 0 simplified : !FGF"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+Ro...3039
Detected timeout of ITS tools.
[2022-05-21 07:06:04] [INFO ] Flatten gal took : 146 ms
[2022-05-21 07:06:04] [INFO ] Applying decomposition
[2022-05-21 07:06:04] [INFO ] Flatten gal took : 152 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/graph14521238088215304397.txt' '-o' '/tmp/graph14521238088215304397.bin' '-w' '/tmp/graph14521238088215304397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14521238088215304397.bin' '-l' '-1' '-v' '-w' '/tmp/graph14521238088215304397.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:06:04] [INFO ] Decomposing Gal with order
[2022-05-21 07:06:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:06:06] [INFO ] Removed a total of 11520 redundant transitions.
[2022-05-21 07:06:06] [INFO ] Flatten gal took : 1297 ms
[2022-05-21 07:06:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 41 ms.
[2022-05-21 07:06:06] [INFO ] Time to serialize gal into /tmp/LTL14653103977533824700.gal : 16 ms
[2022-05-21 07:06:06] [INFO ] Time to serialize properties into /tmp/LTL4113009887905780815.ltl : 59 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/LTL14653103977533824700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4113009887905780815.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/LTL1465310...267
Read 1 LTL properties
Checking formula 0 : !((F(G(F("(((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+...4071
Formula 0 simplified : !FGF"(((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((...4063
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12076429040485900923
[2022-05-21 07:06:21] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12076429040485900923
Running compilation step : cd /tmp/ltsmin12076429040485900923;'/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/ltsmin12076429040485900923;'/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/ltsmin12076429040485900923;'/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-AN16-LTLCardinality-03 finished in 144849 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((F(X(p0))||p1)))))'
Support contains 4608 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 72 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:06:24] [INFO ] Computed 768 place invariants in 13 ms
[2022-05-21 07:06:25] [INFO ] Implicit Places using invariants in 774 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:06:25] [INFO ] Computed 768 place invariants in 13 ms
[2022-05-21 07:06:26] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
[2022-05-21 07:06:26] [INFO ] Redundant transitions in 151 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:06:26] [INFO ] Computed 768 place invariants in 19 ms
[2022-05-21 07:06:29] [INFO ] Dead Transitions using invariants and state equation in 2673 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 24040 steps with 106 reset in 10005 ms.
Product exploration timeout after 24130 steps with 106 reset in 10001 ms.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 3996 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1633 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1590 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Probabilistic random walk after 141083 steps, saw 141042 distinct states, run finished after 21125 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:07:20] [INFO ] Computed 768 place invariants in 19 ms
[2022-05-21 07:07:22] [INFO ] After 608ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-21 07:07:23] [INFO ] [Nat]Absence check using 768 positive place invariants in 297 ms returned sat
[2022-05-21 07:07:23] [INFO ] After 1086ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 7 factoid took 257 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN16-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN16-LTLCardinality-04 finished in 58959 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 768 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 768 transition count 4096
Applied a total of 4096 rules in 46 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:07:24] [INFO ] Computed 47 place invariants in 263 ms
[2022-05-21 07:07:24] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:07:24] [INFO ] Computed 47 place invariants in 259 ms
[2022-05-21 07:07:25] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:07:25] [INFO ] Computed 47 place invariants in 269 ms
[2022-05-21 07:07:26] [INFO ] Dead Transitions using invariants and state equation in 1488 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 20920 steps with 10460 reset in 10002 ms.
Product exploration timeout after 20870 steps with 10435 reset in 10002 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 106 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN16-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN16-LTLCardinality-06 finished in 24494 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X((G(p1)||X(G(p2)))))))'
Support contains 4608 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 25 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:07:48] [INFO ] Computed 768 place invariants in 18 ms
[2022-05-21 07:07:49] [INFO ] Implicit Places using invariants in 857 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:07:49] [INFO ] Computed 768 place invariants in 29 ms
[2022-05-21 07:07:50] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:07:50] [INFO ] Computed 768 place invariants in 13 ms
[2022-05-21 07:07:52] [INFO ] Dead Transitions using invariants and state equation in 2625 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 3}]], initial=1, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 22370 steps with 11185 reset in 10005 ms.
Product exploration timeout after 22300 steps with 11150 reset in 10003 ms.
Computed a total of 4864 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4864 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 126 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN16-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN16-LTLCardinality-07 finished in 26142 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4095 places and 0 transitions.
Iterating post reduction 0 with 4095 rules applied. Total rules applied 4095 place count 769 transition count 4096
Applied a total of 4095 rules in 139 ms. Remains 769 /4864 variables (removed 4095) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 769 cols
[2022-05-21 07:08:14] [INFO ] Computed 47 place invariants in 356 ms
[2022-05-21 07:08:15] [INFO ] Implicit Places using invariants in 1224 ms returned []
// Phase 1: matrix 4096 rows 769 cols
[2022-05-21 07:08:16] [INFO ] Computed 47 place invariants in 335 ms
[2022-05-21 07:08:20] [INFO ] Implicit Places using invariants and state equation in 4368 ms returned []
Implicit Place search using SMT with State Equation took 5593 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 769 cols
[2022-05-21 07:08:20] [INFO ] Computed 47 place invariants in 372 ms
[2022-05-21 07:08:21] [INFO ] Dead Transitions using invariants and state equation in 1584 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 769/4864 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 769/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s256 s703)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-09 finished in 7416 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((!(G(!X(p0))&&F(p1)) U G(p2))))))'
Support contains 3 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 768 transition count 4096
Applied a total of 4096 rules in 120 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:08:22] [INFO ] Computed 47 place invariants in 263 ms
[2022-05-21 07:08:23] [INFO ] Implicit Places using invariants in 1118 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:08:23] [INFO ] Computed 47 place invariants in 278 ms
[2022-05-21 07:08:27] [INFO ] Implicit Places using invariants and state equation in 4307 ms returned []
Implicit Place search using SMT with State Equation took 5435 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:08:27] [INFO ] Computed 47 place invariants in 266 ms
[2022-05-21 07:08:29] [INFO ] Dead Transitions using invariants and state equation in 1561 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) p2 p1), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 1 s190), p1:(LEQ 3 s259), p0:(GT 1 s629)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14275 steps with 116 reset in 5272 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-10 finished in 12704 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Graph (complete) has 12288 edges and 4864 vertex of which 769 are kept as prefixes of interest. Removing 4095 places using SCC suffix rule.8 ms
Discarding 4095 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 147 ms. Remains 769 /4864 variables (removed 4095) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 769 cols
[2022-05-21 07:08:34] [INFO ] Computed 47 place invariants in 227 ms
[2022-05-21 07:08:35] [INFO ] Implicit Places using invariants in 1082 ms returned []
// Phase 1: matrix 4096 rows 769 cols
[2022-05-21 07:08:36] [INFO ] Computed 47 place invariants in 227 ms
[2022-05-21 07:08:41] [INFO ] Implicit Places using invariants and state equation in 5889 ms returned []
Implicit Place search using SMT with State Equation took 6973 ms to find 0 implicit places.
[2022-05-21 07:08:41] [INFO ] Redundant transitions in 158 ms returned []
// Phase 1: matrix 4096 rows 769 cols
[2022-05-21 07:08:42] [INFO ] Computed 47 place invariants in 254 ms
[2022-05-21 07:08:43] [INFO ] Dead Transitions using invariants and state equation in 1440 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 769/4864 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 769/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s372 s256), p0:(LEQ s105 s672)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1056 steps with 5 reset in 326 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-12 finished in 9159 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(X(X(G(p1)))))))'
Support contains 4 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4095 places and 0 transitions.
Iterating post reduction 0 with 4095 rules applied. Total rules applied 4095 place count 769 transition count 4096
Applied a total of 4095 rules in 119 ms. Remains 769 /4864 variables (removed 4095) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 769 cols
[2022-05-21 07:08:44] [INFO ] Computed 47 place invariants in 233 ms
[2022-05-21 07:08:44] [INFO ] Implicit Places using invariants in 1028 ms returned []
// Phase 1: matrix 4096 rows 769 cols
[2022-05-21 07:08:45] [INFO ] Computed 47 place invariants in 241 ms
[2022-05-21 07:08:50] [INFO ] Implicit Places using invariants and state equation in 5583 ms returned []
Implicit Place search using SMT with State Equation took 6614 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 769 cols
[2022-05-21 07:08:50] [INFO ] Computed 47 place invariants in 230 ms
[2022-05-21 07:08:51] [INFO ] Dead Transitions using invariants and state equation in 1416 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 769/4864 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 769/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=5, aps=[p1:(GT s142 s256), p0:(LEQ s444 s114)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 221 steps with 0 reset in 63 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-13 finished in 8421 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 768 transition count 4096
Applied a total of 4096 rules in 123 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:08:52] [INFO ] Computed 47 place invariants in 266 ms
[2022-05-21 07:08:53] [INFO ] Implicit Places using invariants in 1101 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:08:53] [INFO ] Computed 47 place invariants in 262 ms
[2022-05-21 07:08:54] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 2597 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:08:55] [INFO ] Computed 47 place invariants in 259 ms
[2022-05-21 07:08:56] [INFO ] Dead Transitions using invariants and state equation in 1447 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/4864 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLCardinality-15 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 s276 s660)], 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]]
Stuttering criterion allowed to conclude after 3627 steps with 1527 reset in 1460 ms.
FORMULA Sudoku-PT-AN16-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLCardinality-15 finished in 5708 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
[2022-05-21 07:08:58] [INFO ] Flatten gal took : 192 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13861493167735548811
[2022-05-21 07:08:58] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2022-05-21 07:08:58] [INFO ] Applying decomposition
[2022-05-21 07:08:58] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13861493167735548811
Running compilation step : cd /tmp/ltsmin13861493167735548811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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 07:08:58] [INFO ] Flatten gal took : 184 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/graph5705078691077197092.txt' '-o' '/tmp/graph5705078691077197092.bin' '-w' '/tmp/graph5705078691077197092.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5705078691077197092.bin' '-l' '-1' '-v' '-w' '/tmp/graph5705078691077197092.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:08:59] [INFO ] Decomposing Gal with order
[2022-05-21 07:08:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:09:01] [INFO ] Removed a total of 7424 redundant transitions.
[2022-05-21 07:09:01] [INFO ] Flatten gal took : 1072 ms
[2022-05-21 07:09:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 79 ms.
[2022-05-21 07:09:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality9506193386559234243.gal : 37 ms
[2022-05-21 07:09:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality6309206200146637369.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/LTLCardinality9506193386559234243.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6309206200146637369.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 1 LTL properties
Checking formula 0 : !((F(G(F("(((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+...4071
Formula 0 simplified : !FGF"(((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((...4063
Compilation finished in 14511 ms.
Running link step : cd /tmp/ltsmin13861493167735548811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin13861493167735548811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](<>((LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-21 07:31:38] [INFO ] Flatten gal took : 1700 ms
[2022-05-21 07:31:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality537549933854131481.gal : 139 ms
[2022-05-21 07:31:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality5433966171901594212.ltl : 6 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/LTLCardinality537549933854131481.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5433966171901594212.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...287
Read 1 LTL properties
Checking formula 0 : !((F(G(F("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10...3047
Formula 0 simplified : !FGF"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+Ro...3039
ITS-tools command line returned an error code 137
[2022-05-21 07:52:12] [INFO ] Flatten gal took : 1340 ms
[2022-05-21 07:52:21] [INFO ] Input system was already deterministic with 4096 transitions.
[2022-05-21 07:52:21] [INFO ] Transformed 4864 places.
[2022-05-21 07:52:21] [INFO ] Transformed 4096 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 07:52:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality8173651174410696337.gal : 93 ms
[2022-05-21 07:52:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality4570177491829272070.ltl : 2 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/LTLCardinality8173651174410696337.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4570177491829272070.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...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(F("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10...3047
Formula 0 simplified : !FGF"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+Ro...3039

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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-AN16"
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-AN16, 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-165303545600323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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