Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.8K Feb 26 09:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 09:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 09:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 26 09:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 26 09:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679146238359

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN02
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-18 13:30:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 13:30:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 13:30:40] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-18 13:30:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 13:30:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 372 ms
[2023-03-18 13:30:40] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 20 PT places and 8.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 13:30:40] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2023-03-18 13:30:40] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-COL-AN02-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10001 steps, including 1666 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 19) seen :11
Incomplete Best-First random walk after 10001 steps, including 1666 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1666 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1666 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1666 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1666 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1666 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 1666 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1666 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 13:30:41] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-18 13:30:42] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 13:30:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 13:30:42] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
FORMULA Sudoku-COL-AN02-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 13:30:42] [INFO ] Flatten gal took : 12 ms
[2023-03-18 13:30:42] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA Sudoku-COL-AN02-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 13:30:42] [INFO ] Flatten gal took : 1 ms
Domain [N(2), N(2)] of place Rows breaks symmetries in sort N
[2023-03-18 13:30:42] [INFO ] Unfolded HLPN to a Petri net with 20 places and 8 transitions 32 arcs in 5 ms.
[2023-03-18 13:30:42] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Support contains 20 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 4 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2023-03-18 13:30:42] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-18 13:30:42] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 13:30:42] [INFO ] Invariant cache hit.
[2023-03-18 13:30:42] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-18 13:30:42] [INFO ] Invariant cache hit.
[2023-03-18 13:30:42] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 20/20 places, 8/8 transitions.
Support contains 20 out of 20 places after structural reductions.
[2023-03-18 13:30:42] [INFO ] Flatten gal took : 3 ms
[2023-03-18 13:30:42] [INFO ] Flatten gal took : 3 ms
[2023-03-18 13:30:42] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10000 steps, including 2207 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 17) seen :11
Incomplete Best-First random walk after 10000 steps, including 553 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 554 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 555 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 552 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 554 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 553 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-18 13:30:43] [INFO ] Invariant cache hit.
[2023-03-18 13:30:43] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 13:30:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-18 13:30:43] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 9 simplifications.
Computed a total of 20 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 12 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-18 13:30:43] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 13:30:43] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 13:30:43] [INFO ] Invariant cache hit.
[2023-03-18 13:30:43] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-18 13:30:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:30:43] [INFO ] Invariant cache hit.
[2023-03-18 13:30:43] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/20 places, 8/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 12/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLCardinality-02 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 1 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLCardinality-02 finished in 303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 16 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2023-03-18 13:30:43] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-18 13:30:43] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 13:30:43] [INFO ] Invariant cache hit.
[2023-03-18 13:30:43] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-18 13:30:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:30:43] [INFO ] Invariant cache hit.
[2023-03-18 13:30:43] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-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:(AND (LEQ (ADD s16 s17 s18 s19) (ADD s12 s13 s14 s15)) (GT 3 (ADD s4 s5 s6 s7 s8 s9 s10 s11)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLCardinality-03 finished in 188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 1 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-18 13:30:43] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 13:30:43] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-18 13:30:43] [INFO ] Invariant cache hit.
[2023-03-18 13:30:43] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-18 13:30:43] [INFO ] Invariant cache hit.
[2023-03-18 13:30:43] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 12/20 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 12/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLCardinality-06 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:(LEQ 2 (ADD s8 s9 s10 s11))], 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 3 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLCardinality-06 finished in 168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 0 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
[2023-03-18 13:30:43] [INFO ] Invariant cache hit.
[2023-03-18 13:30:44] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 13:30:44] [INFO ] Invariant cache hit.
[2023-03-18 13:30:44] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-18 13:30:44] [INFO ] Invariant cache hit.
[2023-03-18 13:30:44] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 12/20 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 12/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3))], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 216 ms.
Product exploration explored 100000 steps with 33333 reset in 128 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN02-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN02-LTLCardinality-08 finished in 664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 8 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2023-03-18 13:30:44] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-18 13:30:44] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-18 13:30:44] [INFO ] Invariant cache hit.
[2023-03-18 13:30:44] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-18 13:30:44] [INFO ] Invariant cache hit.
[2023-03-18 13:30:44] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-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:(AND (LEQ 1 (ADD s4 s5 s6 s7 s8 s9 s10 s11)) (LEQ 2 (ADD s4 s5 s6 s7 s8 s9 s10 s11)))], 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 0 ms.
FORMULA Sudoku-COL-AN02-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLCardinality-09 finished in 269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 13:30:44] [INFO ] Invariant cache hit.
[2023-03-18 13:30:44] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 13:30:44] [INFO ] Invariant cache hit.
[2023-03-18 13:30:44] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-18 13:30:44] [INFO ] Invariant cache hit.
[2023-03-18 13:30:45] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ (ADD s4 s5 s6 s7 s8 s9 s10 s11) (ADD s16 s17 s18 s19))], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN02-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLCardinality-10 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 13:30:45] [INFO ] Invariant cache hit.
[2023-03-18 13:30:45] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-18 13:30:45] [INFO ] Invariant cache hit.
[2023-03-18 13:30:45] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-18 13:30:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:30:45] [INFO ] Invariant cache hit.
[2023-03-18 13:30:45] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLCardinality-11 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 s4 s5 s6 s7 s8 s9 s10 s11) (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLCardinality-11 finished in 131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 13:30:45] [INFO ] Invariant cache hit.
[2023-03-18 13:30:45] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-18 13:30:45] [INFO ] Invariant cache hit.
[2023-03-18 13:30:45] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-18 13:30:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:30:45] [INFO ] Invariant cache hit.
[2023-03-18 13:30:45] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN02-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 (ADD s12 s13 s14 s15)), p1:(GT 1 (ADD s4 s5 s6 s7 s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN02-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLCardinality-12 finished in 206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 13:30:45] [INFO ] Invariant cache hit.
[2023-03-18 13:30:45] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 13:30:45] [INFO ] Invariant cache hit.
[2023-03-18 13:30:45] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-18 13:30:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:30:45] [INFO ] Invariant cache hit.
[2023-03-18 13:30:45] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ (ADD s12 s13 s14 s15) (ADD s4 s5 s6 s7 s8 s9 s10 s11)), p0:(LEQ 2 (ADD s12 s13 s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN02-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLCardinality-15 finished in 193 ms.
All properties solved by simple procedures.
Total runtime 5593 ms.

BK_STOP 1679146247083

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN02"
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-5348"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN02, 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 r485-tall-167912698800011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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