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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.8K Feb 26 09:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 09:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 09:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 09:33 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.6K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 09:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 09:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 09:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.9K 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-PT-AN01-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679177010653

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-PT-AN01
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-18 22:03:32] [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 22:03:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:03:32] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-03-18 22:03:32] [INFO ] Transformed 4 places.
[2023-03-18 22:03:32] [INFO ] Transformed 1 transitions.
[2023-03-18 22:03:32] [INFO ] Found NUPN structural information;
[2023-03-18 22:03:32] [INFO ] Completing missing partition info from NUPN : creating a component with [Columns_0_0]
[2023-03-18 22:03:32] [INFO ] Parsed PT model containing 4 places and 1 transitions and 4 arcs in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN01-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 8 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 22:03:32] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-18 22:03:32] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-18 22:03:32] [INFO ] Invariant cache hit.
[2023-03-18 22:03:32] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-18 22:03:32] [INFO ] Invariant cache hit.
[2023-03-18 22:03:32] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 4/4 places, 1/1 transitions.
Support contains 4 out of 4 places after structural reductions.
[2023-03-18 22:03:32] [INFO ] Flatten gal took : 11 ms
[2023-03-18 22:03:32] [INFO ] Flatten gal took : 1 ms
[2023-03-18 22:03:32] [INFO ] Input system was already deterministic with 1 transitions.
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 22:03:33] [INFO ] Invariant cache hit.
[2023-03-18 22:03:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 22:03:33] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-18 22:03:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 22:03:33] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
FORMULA Sudoku-PT-AN01-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-14 FALSE 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).
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 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 3 ms. Remains 2 /4 variables (removed 2) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-18 22:03:34] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-18 22:03:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-18 22:03:34] [INFO ] Invariant cache hit.
[2023-03-18 22:03:34] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-18 22:03:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:03:34] [INFO ] Invariant cache hit.
[2023-03-18 22:03:34] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 2/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN01-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:(AND (NEQ s0 0) (NEQ s1 1))], 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 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
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 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2023-03-18 22:03:35] [INFO ] Invariant cache hit.
[2023-03-18 22:03:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 22:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:03:35] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-18 22:03:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 22:03:35] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 22:03:35] [INFO ] Invariant cache hit.
[2023-03-18 22:03:35] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 22:03:35] [INFO ] Invariant cache hit.
[2023-03-18 22:03:35] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-18 22:03:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:03:35] [INFO ] Invariant cache hit.
[2023-03-18 22:03:35] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 2/2 places, 1/1 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
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 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2023-03-18 22:03:35] [INFO ] Invariant cache hit.
[2023-03-18 22:03:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-18 22:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:03:35] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-18 22:03:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-18 22:03:35] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 50 ms.
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Built C files in :
/tmp/ltsmin569242593246936198
[2023-03-18 22:03:35] [INFO ] Computing symmetric may disable matrix : 1 transitions.
[2023-03-18 22:03:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:03:35] [INFO ] Computing symmetric may enable matrix : 1 transitions.
[2023-03-18 22:03:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:03:35] [INFO ] Computing Do-Not-Accords matrix : 1 transitions.
[2023-03-18 22:03:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:03:35] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin569242593246936198
Running compilation step : cd /tmp/ltsmin569242593246936198;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 153 ms.
Running link step : cd /tmp/ltsmin569242593246936198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin569242593246936198;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1671022217549214994.hoa' '--buchi-type=spotba'
LTSmin run took 67 ms.
FORMULA Sudoku-PT-AN01-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-PT-AN01-LTLCardinality-07 finished in 2093 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' '!((!p0 U (X((p1&&F(p2))) U G(p2))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 1
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 3 cols
[2023-03-18 22:03:36] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-18 22:03:36] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-18 22:03:36] [INFO ] Invariant cache hit.
[2023-03-18 22:03:36] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-18 22:03:36] [INFO ] Invariant cache hit.
[2023-03-18 22:03:36] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 3/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : Sudoku-PT-AN01-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s0 0) (EQ s1 1)), p0:(OR (EQ s2 0) (EQ s1 1)), p1:(OR (EQ s1 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Product exploration explored 100000 steps with 50000 reset in 90 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p2), (X (NOT p1)), (X (AND p2 (NOT p1))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 26 factoid took 3256 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p2), (OR (AND p2 (NOT p1)) (AND (NOT p2) p1)), (NOT p2), true, (NOT p2), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 22:03:40] [INFO ] Invariant cache hit.
[2023-03-18 22:03:40] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-18 22:03:41] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p2), (X (NOT p1)), (X (AND p2 (NOT p1))), (X (AND p2 p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p2)), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p1) p0))), (G (NOT (AND p2 (NOT p0)))), (G (NOT (AND (NOT p2) p1 p0))), (G (NOT (AND p2 p1))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (OR (AND p2 p0) (AND p1 p0))), (F (AND p2 (NOT p1))), (F (AND p2 (NOT p1) p0)), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 31 factoid took 1548 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p0 (NOT p1))), (AND (NOT p0) p1), (OR (AND p0 (NOT p1)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p0 (NOT p1))), (AND (NOT p0) p1), (OR (AND p0 (NOT p1)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-18 22:03:43] [INFO ] Invariant cache hit.
[2023-03-18 22:03:43] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-18 22:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:03:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-18 22:03:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 22:03:43] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 22:03:43] [INFO ] Invariant cache hit.
[2023-03-18 22:03:43] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-18 22:03:43] [INFO ] Invariant cache hit.
[2023-03-18 22:03:43] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-18 22:03:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:03:43] [INFO ] Invariant cache hit.
[2023-03-18 22:03: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 70 ms. Remains : 3/3 places, 1/1 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 303 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter insensitive) to 6 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 623 ms :[(AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p0 (NOT p1))), (AND (NOT p0) p1), (OR (AND p0 (NOT p1)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:03:44] [INFO ] Invariant cache hit.
[2023-03-18 22:03:44] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:03:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-18 22:03:44] [INFO ] After 19ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 468 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter insensitive) to 6 states, 12 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[p1, true, p1, true, p1, p1]
Stuttering acceptance computed with spot in 206 ms :[p1, true, p1, true, p1, p1]
[2023-03-18 22:03:45] [INFO ] Invariant cache hit.
[2023-03-18 22:03:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:03:45] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-18 22:03:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 22:03:45] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 194 ms :[p1, true, p1, true, p1, p1]
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Product exploration explored 100000 steps with 50000 reset in 59 ms.
Built C files in :
/tmp/ltsmin13261153799161265399
[2023-03-18 22:03:45] [INFO ] Computing symmetric may disable matrix : 1 transitions.
[2023-03-18 22:03:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:03:45] [INFO ] Computing symmetric may enable matrix : 1 transitions.
[2023-03-18 22:03:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:03:45] [INFO ] Computing Do-Not-Accords matrix : 1 transitions.
[2023-03-18 22:03:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:03:45] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13261153799161265399
Running compilation step : cd /tmp/ltsmin13261153799161265399;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin13261153799161265399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13261153799161265399;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6044752906051582750.hoa' '--buchi-type=spotba'
LTSmin run took 184 ms.
FORMULA Sudoku-PT-AN01-LTLCardinality-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-PT-AN01-LTLCardinality-08 finished in 9772 ms.
All properties solved by simple procedures.
Total runtime 13697 ms.

BK_STOP 1679177029207

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

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