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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.2M
-rw-r--r-- 1 mcc users 270K Apr 30 12:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Apr 30 12:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 694K Apr 30 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.3M Apr 30 12:03 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 210K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 725K May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 440K May 9 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M May 9 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 36K May 9 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 92K 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 564K 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-AN10-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653105177813

Running Version 202205111006
[2022-05-21 03:52:58] [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 03:52:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 03:52:59] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2022-05-21 03:52:59] [INFO ] Transformed 1300 places.
[2022-05-21 03:52:59] [INFO ] Transformed 1000 transitions.
[2022-05-21 03:52:59] [INFO ] Parsed PT model containing 1300 places and 1000 transitions in 266 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 117 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-AN10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 28 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:52:59] [INFO ] Computed 300 place invariants in 29 ms
[2022-05-21 03:52:59] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:52:59] [INFO ] Computed 300 place invariants in 7 ms
[2022-05-21 03:53:00] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:53:00] [INFO ] Computed 300 place invariants in 5 ms
[2022-05-21 03:53:01] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Support contains 1300 out of 1300 places after structural reductions.
[2022-05-21 03:53:01] [INFO ] Flatten gal took : 149 ms
[2022-05-21 03:53:01] [INFO ] Flatten gal took : 94 ms
[2022-05-21 03:53:01] [INFO ] Input system was already deterministic with 1000 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 1218 ms. (steps per millisecond=8 ) properties (out of 21) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:53:04] [INFO ] Computed 300 place invariants in 14 ms
[2022-05-21 03:53:04] [INFO ] [Real]Absence check using 300 positive place invariants in 65 ms returned sat
[2022-05-21 03:53:05] [INFO ] After 599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-21 03:53:05] [INFO ] [Nat]Absence check using 300 positive place invariants in 64 ms returned sat
[2022-05-21 03:53:30] [INFO ] After 23871ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2022-05-21 03:53:30] [INFO ] After 23875ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-21 03:53:30] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 300 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.7 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 28 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 300/1300 places, 1000/1000 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 1034 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 121170 steps, run timeout after 3003 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121170 steps, saw 66836 distinct states, run finished after 3005 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:53:34] [INFO ] Computed 29 place invariants in 40 ms
[2022-05-21 03:53:34] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 45 ms returned sat
[2022-05-21 03:53:59] [INFO ] After 24853ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-21 03:53:59] [INFO ] After 24862ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-21 03:53:59] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2022-05-21 03:53:59] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 19 ms returned sat
[2022-05-21 03:54:24] [INFO ] After 24894ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-21 03:54:24] [INFO ] After 24895ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-21 03:54:24] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 100 steps, including 0 resets, run visited all 5 properties in 8 ms. (steps per millisecond=12 )
Parikh walk visited 5 properties in 10 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA Sudoku-PT-AN10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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((!(F(p0) U !(F(!p0)&&p1)) U X(!p1))))'
Support contains 200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 32 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:54:25] [INFO ] Computed 29 place invariants in 34 ms
[2022-05-21 03:54:25] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:54:25] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-21 03:54:25] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:54:25] [INFO ] Computed 29 place invariants in 13 ms
[2022-05-21 03:54:26] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 379 ms :[p0, (OR p0 p1), p1, true, p1, true, p1, p1]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 1}, { cond=(AND p0 p1), acceptance={} source=7 dest: 3}]], initial=6, aps=[p0:(LEQ 1 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 89320 steps with 29773 reset in 10001 ms.
Product exploration timeout after 89010 steps with 29670 reset in 10001 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p0 p1))))
Knowledge based reduction with 7 factoid took 149 ms. Reduced automaton from 8 states, 16 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLCardinality-00 finished in 32706 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0) U p1)&&!(!p0 U p2)))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 34 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:54:57] [INFO ] Computed 300 place invariants in 3 ms
[2022-05-21 03:54:58] [INFO ] Implicit Places using invariants in 307 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:54:58] [INFO ] Computed 300 place invariants in 4 ms
[2022-05-21 03:54:58] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
[2022-05-21 03:54:58] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:54:58] [INFO ] Computed 300 place invariants in 6 ms
[2022-05-21 03:54:59] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p1) p2), (OR (NOT p1) p0 p2), p2, (OR p2 p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND p0 (NOT p1)) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(OR p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(OR p0 p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GT 1 (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 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 20 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-02 finished in 1937 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(p1)))))'
Support contains 100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 26 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:54:59] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-21 03:54:59] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:54:59] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-21 03:55:00] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:55:00] [INFO ] Computed 29 place invariants in 15 ms
[2022-05-21 03:55:00] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(OR (LEQ 2 (ADD s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 ...], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8514 ms.
Product exploration explored 100000 steps with 50000 reset in 8617 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
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 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (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 75 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLCardinality-04 finished in 24657 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(X(F(p1)))||X(p2))))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 15 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:55:24] [INFO ] Computed 300 place invariants in 8 ms
[2022-05-21 03:55:24] [INFO ] Implicit Places using invariants in 320 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:55:24] [INFO ] Computed 300 place invariants in 5 ms
[2022-05-21 03:55:25] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:55:25] [INFO ] Computed 300 place invariants in 3 ms
[2022-05-21 03:55:25] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(GT 3 (ADD s1200 s1201 s1202 s1203 s1204 s1205 s1206 s1207 s1208 s1209 s1210 s1211 s1212 s1213 s1214 s1215 s1216 s1217 s1218 s1219 s1220 s1221 s1222 s1...], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-05 finished in 2059 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 32 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:55:26] [INFO ] Computed 300 place invariants in 4 ms
[2022-05-21 03:55:26] [INFO ] Implicit Places using invariants in 437 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:55:26] [INFO ] Computed 300 place invariants in 6 ms
[2022-05-21 03:55:27] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1454 ms to find 0 implicit places.
[2022-05-21 03:55:27] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:55:27] [INFO ] Computed 300 place invariants in 6 ms
[2022-05-21 03:55:28] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, 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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1145 reset in 9234 ms.
Product exploration explored 100000 steps with 1147 reset in 9316 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=7 )
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 167 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:56:08] [INFO ] Computed 300 place invariants in 5 ms
[2022-05-21 03:56:14] [INFO ] [Real]Absence check using 300 positive place invariants in 105 ms returned sat
[2022-05-21 03:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 03:56:15] [INFO ] [Real]Absence check using state equation in 875 ms returned sat
[2022-05-21 03:56:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 03:56:24] [INFO ] [Nat]Absence check using 300 positive place invariants in 3035 ms returned sat
[2022-05-21 03:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 03:56:26] [INFO ] [Nat]Absence check using state equation in 2726 ms returned sat
[2022-05-21 03:56:27] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 50 ms.
[2022-05-21 03:56:27] [INFO ] Added : 0 causal constraints over 0 iterations in 162 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 22 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:56:27] [INFO ] Computed 300 place invariants in 10 ms
[2022-05-21 03:56:27] [INFO ] Implicit Places using invariants in 430 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:56:27] [INFO ] Computed 300 place invariants in 6 ms
[2022-05-21 03:56:28] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1412 ms to find 0 implicit places.
[2022-05-21 03:56:28] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:56:28] [INFO ] Computed 300 place invariants in 4 ms
[2022-05-21 03:56:29] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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 1493 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=4 )
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 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:56:51] [INFO ] Computed 300 place invariants in 3 ms
[2022-05-21 03:56:58] [INFO ] [Real]Absence check using 300 positive place invariants in 115 ms returned sat
[2022-05-21 03:56:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 03:56:59] [INFO ] [Real]Absence check using state equation in 958 ms returned sat
[2022-05-21 03:56:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 03:57:07] [INFO ] [Nat]Absence check using 300 positive place invariants in 3010 ms returned sat
[2022-05-21 03:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 03:57:10] [INFO ] [Nat]Absence check using state equation in 2696 ms returned sat
[2022-05-21 03:57:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 38 ms.
[2022-05-21 03:57:10] [INFO ] Added : 0 causal constraints over 0 iterations in 157 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1146 reset in 9261 ms.
Product exploration explored 100000 steps with 1147 reset in 9381 ms.
Built C files in :
/tmp/ltsmin15009178105121162934
[2022-05-21 03:57:29] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2022-05-21 03:57:29] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 03:57:29] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2022-05-21 03:57:29] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 03:57:29] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2022-05-21 03:57:29] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 03:57:29] [INFO ] Built C files in 180ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15009178105121162934
Running compilation step : cd /tmp/ltsmin15009178105121162934;'/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/ltsmin15009178105121162934;'/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/ltsmin15009178105121162934;'/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 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 36 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:57:32] [INFO ] Computed 300 place invariants in 2 ms
[2022-05-21 03:57:33] [INFO ] Implicit Places using invariants in 437 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:57:33] [INFO ] Computed 300 place invariants in 3 ms
[2022-05-21 03:57:34] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1435 ms to find 0 implicit places.
[2022-05-21 03:57:34] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-21 03:57:34] [INFO ] Computed 300 place invariants in 4 ms
[2022-05-21 03:57:34] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin12246982751719379668
[2022-05-21 03:57:34] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2022-05-21 03:57:34] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 03:57:34] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2022-05-21 03:57:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 03:57:34] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2022-05-21 03:57:34] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 03:57:34] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12246982751719379668
Running compilation step : cd /tmp/ltsmin12246982751719379668;'/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/ltsmin12246982751719379668;'/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/ltsmin12246982751719379668;'/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 03:57:38] [INFO ] Flatten gal took : 70 ms
[2022-05-21 03:57:38] [INFO ] Flatten gal took : 72 ms
[2022-05-21 03:57:38] [INFO ] Time to serialize gal into /tmp/LTL15010649818915165741.gal : 12 ms
[2022-05-21 03:57:38] [INFO ] Time to serialize properties into /tmp/LTL949349479643295188.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/LTL15010649818915165741.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL949349479643295188.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/LTL1501064...266
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((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_1_0+Row...15132
Formula 0 simplified : !FG"((((((((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_1_0+Rows_...15126
Detected timeout of ITS tools.
[2022-05-21 03:57:53] [INFO ] Flatten gal took : 58 ms
[2022-05-21 03:57:53] [INFO ] Applying decomposition
[2022-05-21 03:57:53] [INFO ] Flatten gal took : 55 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/graph17103823410530323324.txt' '-o' '/tmp/graph17103823410530323324.bin' '-w' '/tmp/graph17103823410530323324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17103823410530323324.bin' '-l' '-1' '-v' '-w' '/tmp/graph17103823410530323324.weights' '-q' '0' '-e' '0.001'
[2022-05-21 03:57:56] [INFO ] Decomposing Gal with order
[2022-05-21 03:57:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 03:57:56] [INFO ] Removed a total of 1286 redundant transitions.
[2022-05-21 03:57:56] [INFO ] Flatten gal took : 760 ms
[2022-05-21 03:57:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 374 labels/synchronizations in 53 ms.
[2022-05-21 03:57:57] [INFO ] Time to serialize gal into /tmp/LTL18437820232386326134.gal : 10 ms
[2022-05-21 03:57:57] [INFO ] Time to serialize properties into /tmp/LTL17931136503272871359.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/LTL18437820232386326134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17931136503272871359.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/LTL1843782...268
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((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)))+(((...19532
Formula 0 simplified : !FG"((((((((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)))+(((gu...19526
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8118822000945736733
[2022-05-21 03:58:12] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8118822000945736733
Running compilation step : cd /tmp/ltsmin8118822000945736733;'/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'
Compilation finished in 2206 ms.
Running link step : cd /tmp/ltsmin8118822000945736733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin8118822000945736733;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN10-LTLCardinality-07 finished in 180879 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F((G(p0)&&X(p1)))))))'
Support contains 3 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 301 are kept as prefixes of interest. Removing 999 places using SCC suffix rule.12 ms
Discarding 999 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 35 ms. Remains 301 /1300 variables (removed 999) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 301 cols
[2022-05-21 03:58:27] [INFO ] Computed 28 place invariants in 41 ms
[2022-05-21 03:58:27] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 1000 rows 301 cols
[2022-05-21 03:58:27] [INFO ] Computed 28 place invariants in 32 ms
[2022-05-21 03:58:28] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
[2022-05-21 03:58:28] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1000 rows 301 cols
[2022-05-21 03:58:28] [INFO ] Computed 28 place invariants in 34 ms
[2022-05-21 03:58:28] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/1300 places, 1000/1000 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 2707 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LEQ s101 s112) (LEQ 2 s100)), p1:(LEQ s101 s112)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2254 steps with 740 reset in 236 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-08 finished in 4648 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(X(p0))&&p1))&&(X(p1)||G(p1))))'
Support contains 3 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 17 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:32] [INFO ] Computed 29 place invariants in 21 ms
[2022-05-21 03:58:32] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:32] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-21 03:58:33] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-21 03:58:33] [INFO ] Computed 29 place invariants in 14 ms
[2022-05-21 03:58:33] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 1 s109), p0:(LEQ s182 s285)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 95 steps with 38 reset in 15 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-09 finished in 2322 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 999 places and 0 transitions.
Iterating post reduction 0 with 999 rules applied. Total rules applied 999 place count 301 transition count 1000
Applied a total of 999 rules in 18 ms. Remains 301 /1300 variables (removed 999) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 301 cols
[2022-05-21 03:58:34] [INFO ] Computed 29 place invariants in 29 ms
[2022-05-21 03:58:34] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 1000 rows 301 cols
[2022-05-21 03:58:34] [INFO ] Computed 29 place invariants in 25 ms
[2022-05-21 03:58:35] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 301 cols
[2022-05-21 03:58:35] [INFO ] Computed 29 place invariants in 22 ms
[2022-05-21 03:58:35] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 301/1300 places, 1000/1000 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-10 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 s202 s100)], 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 50 steps with 0 reset in 9 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-10 finished in 1616 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 301 are kept as prefixes of interest. Removing 999 places using SCC suffix rule.3 ms
Discarding 999 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 301 /1300 variables (removed 999) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 301 cols
[2022-05-21 03:58:35] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-21 03:58:36] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 1000 rows 301 cols
[2022-05-21 03:58:36] [INFO ] Computed 29 place invariants in 23 ms
[2022-05-21 03:58:36] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
[2022-05-21 03:58:36] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1000 rows 301 cols
[2022-05-21 03:58:36] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-21 03:58:37] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/1300 places, 1000/1000 transitions.
Finished structural reductions, in 1 iterations. Remains : 301/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-13 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 s80 s100), p0:(LEQ 1 s256)], 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 170 steps with 1 reset in 9 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-13 finished in 1608 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2022-05-21 03:58:37] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6921427375356399879
[2022-05-21 03:58:37] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2022-05-21 03:58:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 03:58:37] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2022-05-21 03:58:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 03:58:37] [INFO ] Applying decomposition
[2022-05-21 03:58:37] [INFO ] Flatten gal took : 64 ms
[2022-05-21 03:58:37] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2022-05-21 03:58:37] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 03:58:37] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6921427375356399879
Running compilation step : cd /tmp/ltsmin6921427375356399879;'/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'
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/graph11353717849567714787.txt' '-o' '/tmp/graph11353717849567714787.bin' '-w' '/tmp/graph11353717849567714787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11353717849567714787.bin' '-l' '-1' '-v' '-w' '/tmp/graph11353717849567714787.weights' '-q' '0' '-e' '0.001'
[2022-05-21 03:58:39] [INFO ] Decomposing Gal with order
[2022-05-21 03:58:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 03:58:40] [INFO ] Removed a total of 1345 redundant transitions.
[2022-05-21 03:58:40] [INFO ] Flatten gal took : 393 ms
[2022-05-21 03:58:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 324 labels/synchronizations in 33 ms.
[2022-05-21 03:58:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality8449387326590529055.gal : 6 ms
[2022-05-21 03:58:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality11405982308918691157.ltl : 1053 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/LTLCardinality8449387326590529055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11405982308918691157.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...289
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((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)))+(((...19532
Formula 0 simplified : !FG"((((((((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)))+(((gu...19526
Compilation finished in 4426 ms.
Running link step : cd /tmp/ltsmin6921427375356399879;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin6921427375356399879;'/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'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.060: Initializing POR dependencies: labels 1001, guards 1000
pins2lts-mc-linux64( 1/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.093: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.104: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.109: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 10.175: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 4/ 8), 10.175: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 10.175: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 10.915: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 10.944: There are 1002 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 10.944: State length is 1301, there are 1004 groups
pins2lts-mc-linux64( 0/ 8), 10.944: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 10.944: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 10.944: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 10.944: Visible groups: 0 / 1004, labels: 1 / 1002
pins2lts-mc-linux64( 0/ 8), 10.944: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 10.944: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 14.666: [Blue] ~85 levels ~960 states ~210024 transitions
pins2lts-mc-linux64( 7/ 8), 14.763: [Blue] ~85 levels ~1920 states ~213088 transitions
pins2lts-mc-linux64( 7/ 8), 14.918: [Blue] ~86 levels ~3840 states ~220784 transitions
pins2lts-mc-linux64( 7/ 8), 15.301: [Blue] ~86 levels ~7680 states ~237768 transitions
pins2lts-mc-linux64( 7/ 8), 16.105: [Blue] ~86 levels ~15360 states ~275760 transitions
pins2lts-mc-linux64( 7/ 8), 17.653: [Blue] ~86 levels ~30720 states ~352976 transitions
pins2lts-mc-linux64( 7/ 8), 21.172: [Blue] ~86 levels ~61440 states ~538432 transitions
pins2lts-mc-linux64( 6/ 8), 28.165: [Blue] ~87 levels ~122880 states ~910872 transitions
pins2lts-mc-linux64( 7/ 8), 42.934: [Blue] ~86 levels ~245760 states ~1775536 transitions
pins2lts-mc-linux64( 7/ 8), 73.074: [Blue] ~86 levels ~491520 states ~3532992 transitions
pins2lts-mc-linux64( 7/ 8), 130.797: [Blue] ~86 levels ~983040 states ~6829896 transitions
pins2lts-mc-linux64( 7/ 8), 257.103: [Blue] ~86 levels ~1966080 states ~14436256 transitions
pins2lts-mc-linux64( 7/ 8), 517.770: [Blue] ~87 levels ~3932160 states ~30147000 transitions
pins2lts-mc-linux64( 7/ 8), 1045.884: [Blue] ~87 levels ~7864320 states ~62397768 transitions
pins2lts-mc-linux64( 7/ 8), 1171.228: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1171.360:
pins2lts-mc-linux64( 0/ 8), 1171.360: Explored 8207753 states 67558231 transitions, fanout: 8.231
pins2lts-mc-linux64( 0/ 8), 1171.360: Total exploration time 1160.420 sec (1160.280 sec minimum, 1160.339 sec on average)
pins2lts-mc-linux64( 0/ 8), 1171.360: States per second: 7073, Transitions per second: 58219
pins2lts-mc-linux64( 0/ 8), 1171.360:
pins2lts-mc-linux64( 0/ 8), 1171.360: State space has 8410900 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1171.360: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1171.360: blue states: 8207753 (97.58%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1171.360: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1171.360: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1171.360:
pins2lts-mc-linux64( 0/ 8), 1171.360: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1171.360:
pins2lts-mc-linux64( 0/ 8), 1171.360: Queue width: 8B, total height: 708, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 1171.360: Tree memory: 320.2MB, 39.9 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 1171.360: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1171.360: Stored 1011 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1171.360: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1171.360: Est. total memory use: 320.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6921427375356399879;'/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'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6921427375356399879;'/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'
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 04:20:47] [INFO ] Flatten gal took : 102 ms
[2022-05-21 04:20:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality7310905224773068621.gal : 16 ms
[2022-05-21 04:20:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality10250002457329262208.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/LTLCardinality7310905224773068621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10250002457329262208.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...289
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((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_1_0+Row...15132
Formula 0 simplified : !FG"((((((((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_1_0+Rows_...15126
Detected timeout of ITS tools.
[2022-05-21 04:43:24] [INFO ] Flatten gal took : 351 ms
[2022-05-21 04:43:25] [INFO ] Input system was already deterministic with 1000 transitions.
[2022-05-21 04:43:25] [INFO ] Transformed 1300 places.
[2022-05-21 04:43:25] [INFO ] Transformed 1000 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 04:43:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality9365265807130617125.gal : 13 ms
[2022-05-21 04:43:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality6930652947277567374.ltl : 3 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/LTLCardinality9365265807130617125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6930652947277567374.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("((((((((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_1_0+Row...15132
Formula 0 simplified : !FG"((((((((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_1_0+Rows_...15126

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-AN10"
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-AN10, 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-165303545500275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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