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.r060-tall-165254772000443.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 DNAwalker-PT-10ringRL, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772000443
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 6.8K Apr 29 18:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 18:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 18:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 18:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 9 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 112K May 10 09:33 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 DNAwalker-PT-10ringRL-LTLCardinality-00
FORMULA_NAME DNAwalker-PT-10ringRL-LTLCardinality-01
FORMULA_NAME DNAwalker-PT-10ringRL-LTLCardinality-02
FORMULA_NAME DNAwalker-PT-10ringRL-LTLCardinality-03
FORMULA_NAME DNAwalker-PT-10ringRL-LTLCardinality-04
FORMULA_NAME DNAwalker-PT-10ringRL-LTLCardinality-05
FORMULA_NAME DNAwalker-PT-10ringRL-LTLCardinality-06
FORMULA_NAME DNAwalker-PT-10ringRL-LTLCardinality-07
FORMULA_NAME DNAwalker-PT-10ringRL-LTLCardinality-08
FORMULA_NAME DNAwalker-PT-10ringRL-LTLCardinality-09
FORMULA_NAME DNAwalker-PT-10ringRL-LTLCardinality-10
FORMULA_NAME DNAwalker-PT-10ringRL-LTLCardinality-11
FORMULA_NAME DNAwalker-PT-10ringRL-LTLCardinality-12
FORMULA_NAME DNAwalker-PT-10ringRL-LTLCardinality-13
FORMULA_NAME DNAwalker-PT-10ringRL-LTLCardinality-14
FORMULA_NAME DNAwalker-PT-10ringRL-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652600998808

Running Version 202205111006
[2022-05-15 07:49:59] [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-15 07:50:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 07:50:00] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2022-05-15 07:50:00] [INFO ] Transformed 27 places.
[2022-05-15 07:50:00] [INFO ] Transformed 260 transitions.
[2022-05-15 07:50:00] [INFO ] Parsed PT model containing 27 places and 260 transitions in 195 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 3 formulas.
FORMULA DNAwalker-PT-10ringRL-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-10ringRL-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-10ringRL-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-10ringRL-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-10ringRL-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-10ringRL-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 14 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-15 07:50:00] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:00] [INFO ] Computed 0 place invariants in 16 ms
[2022-05-15 07:50:00] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
[2022-05-15 07:50:00] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:00] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-15 07:50:00] [INFO ] Implicit Places using invariants in 45 ms returned []
[2022-05-15 07:50:00] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:00] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-15 07:50:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 07:50:00] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2022-05-15 07:50:00] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:00] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-15 07:50:00] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 260/260 transitions.
Support contains 19 out of 27 places after structural reductions.
[2022-05-15 07:50:01] [INFO ] Flatten gal took : 37 ms
[2022-05-15 07:50:01] [INFO ] Flatten gal took : 15 ms
[2022-05-15 07:50:01] [INFO ] Input system was already deterministic with 260 transitions.
Incomplete random walk after 10000 steps, including 807 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 24) seen :17
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2022-05-15 07:50:01] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:01] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-15 07:50:05] [INFO ] After 3458ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2022-05-15 07:50:07] [INFO ] After 2315ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 7 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DNAwalker-PT-10ringRL-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-10ringRL-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-10ringRL-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 12 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 5 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-15 07:50:07] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:07] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-15 07:50:08] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
[2022-05-15 07:50:08] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:08] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:50:08] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-05-15 07:50:08] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:08] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-15 07:50:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 07:50:08] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2022-05-15 07:50:08] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:08] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-15 07:50:08] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 260/260 transitions.
Stuttering acceptance computed with spot in 489 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-10ringRL-LTLCardinality-00 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 s6 s13)], 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 2 ms.
FORMULA DNAwalker-PT-10ringRL-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-10ringRL-LTLCardinality-00 finished in 1314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X((F(p0)&&G(p1))) U !(p2 U X(p0))))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-15 07:50:09] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:09] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-15 07:50:09] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
[2022-05-15 07:50:09] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:09] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:50:09] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-15 07:50:09] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:09] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:50:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 07:50:09] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2022-05-15 07:50:09] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:09] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:50:09] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 260/260 transitions.
Stuttering acceptance computed with spot in 430 ms :[(NOT p0), (NOT p0), false, (NOT p0), true, false, (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 p0), p1]
Running random walk in product with property : DNAwalker-PT-10ringRL-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 6}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=7 dest: 6}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 p1), acceptance={} source=8 dest: 9}], [{ cond=p1, acceptance={0} source=9 dest: 9}]], initial=0, aps=[p2:(LEQ s11 s21), p0:(LEQ 2 s3), p1:(LEQ 2 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 4 reset in 1 ms.
FORMULA DNAwalker-PT-10ringRL-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-10ringRL-LTLCardinality-01 finished in 1026 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(p1)&&p2)))'
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-15 07:50:10] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:10] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:50:10] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
[2022-05-15 07:50:10] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:10] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:50:10] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-05-15 07:50:10] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 07:50:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 07:50:10] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2022-05-15 07:50:10] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:10] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:50:10] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 260/260 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DNAwalker-PT-10ringRL-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (GT s6 s12) (GT s22 s6)), p0:(GT s5 s14), p1:(GT s22 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-10ringRL-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-10ringRL-LTLCardinality-02 finished in 712 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(F(p0)))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-15 07:50:10] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:10] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:50:11] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
[2022-05-15 07:50:11] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:11] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:50:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-05-15 07:50:11] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:11] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-15 07:50:11] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 07:50:11] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2022-05-15 07:50:11] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 07:50:11] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 260/260 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-10ringRL-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s13 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-10ringRL-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-10ringRL-LTLCardinality-05 finished in 643 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0 U X(p0)))||X(p0)))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-15 07:50:11] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:11] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-15 07:50:11] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
[2022-05-15 07:50:11] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:11] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:50:11] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-05-15 07:50:11] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:11] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-15 07:50:11] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 07:50:12] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2022-05-15 07:50:12] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:50:12] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 260/260 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-10ringRL-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s7 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][false, false]]
Stuttering criterion allowed to conclude after 23 steps with 2 reset in 0 ms.
FORMULA DNAwalker-PT-10ringRL-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-10ringRL-LTLCardinality-09 finished in 677 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(p1 U X((G(X(X(p2)))&&p3))))))'
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-15 07:50:12] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:50:12] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
[2022-05-15 07:50:12] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:12] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-15 07:50:12] [INFO ] Implicit Places using invariants in 45 ms returned []
[2022-05-15 07:50:12] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:50:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 07:50:12] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2022-05-15 07:50:12] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:12] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-15 07:50:12] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 260/260 transitions.
Stuttering acceptance computed with spot in 866 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : DNAwalker-PT-10ringRL-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p0 p3), acceptance={1} source=2 dest: 5}, { cond=(AND p0 (NOT p1) p3), acceptance={0, 1} source=2 dest: 6}, { cond=(AND p0 p1 p3), acceptance={0, 1} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={0, 1} source=3 dest: 6}, { cond=(AND p1 p3), acceptance={0, 1} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 8}, { cond=p0, acceptance={1} source=4 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 10}, { cond=(AND p0 p1), acceptance={0, 1} source=4 dest: 11}], [{ cond=(NOT p0), acceptance={0, 1} source=5 dest: 8}, { cond=p0, acceptance={1} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=6 dest: 8}, { cond=(AND p0 (NOT p3)), acceptance={1} source=6 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1} source=6 dest: 10}, { cond=(AND p0 p1 (NOT p3)), acceptance={0, 1} source=6 dest: 11}, { cond=(AND (NOT p0) p3), acceptance={0, 1} source=6 dest: 12}, { cond=(AND p0 p3), acceptance={1} source=6 dest: 13}, { cond=(AND p0 (NOT p1) p3), acceptance={0, 1} source=6 dest: 14}, { cond=(AND p0 p1 p3), acceptance={0, 1} source=6 dest: 15}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=7 dest: 10}, { cond=(AND p1 (NOT p3)), acceptance={0, 1} source=7 dest: 11}, { cond=(AND (NOT p1) p3), acceptance={0, 1} source=7 dest: 14}, { cond=(AND p1 p3), acceptance={0, 1} source=7 dest: 15}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=8 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=8 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=8 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=8 dest: 8}, { cond=(AND p0 p2), acceptance={} source=8 dest: 9}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=8 dest: 10}, { cond=(AND p0 p1 p2), acceptance={0} source=8 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=9 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=9 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=9 dest: 8}, { cond=(AND p0 p2), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=10 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=10 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=10 dest: 2}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={0, 1} source=10 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0, 1} source=10 dest: 4}, { cond=(AND p0 p3 (NOT p2)), acceptance={1} source=10 dest: 5}, { cond=(AND p0 (NOT p1) p3 (NOT p2)), acceptance={0, 1} source=10 dest: 6}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={0, 1} source=10 dest: 7}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=10 dest: 8}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=10 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0} source=10 dest: 10}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=10 dest: 11}, { cond=(AND (NOT p0) p3 p2), acceptance={0} source=10 dest: 12}, { cond=(AND p0 p3 p2), acceptance={} source=10 dest: 13}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={0} source=10 dest: 14}, { cond=(AND p0 p1 p3 p2), acceptance={0} source=10 dest: 15}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=11 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0, 1} source=11 dest: 3}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={0, 1} source=11 dest: 6}, { cond=(AND p1 p3 (NOT p2)), acceptance={0, 1} source=11 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=11 dest: 10}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=11 dest: 11}, { cond=(AND (NOT p1) p3 p2), acceptance={0} source=11 dest: 14}, { cond=(AND p1 p3 p2), acceptance={0} source=11 dest: 15}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=12 dest: 8}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=12 dest: 8}, { cond=(AND p0 p2), acceptance={} source=12 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={1} source=12 dest: 9}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=12 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=12 dest: 10}, { cond=(AND p0 p1 p2), acceptance={0} source=12 dest: 11}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=12 dest: 11}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=13 dest: 8}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=13 dest: 8}, { cond=(AND p0 p2), acceptance={} source=13 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={1} source=13 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=14 dest: 8}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=14 dest: 8}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=14 dest: 9}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=14 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0} source=14 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=14 dest: 10}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=14 dest: 11}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={0, 1} source=14 dest: 11}, { cond=(AND (NOT p0) p3 p2), acceptance={0} source=14 dest: 12}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0, 1} source=14 dest: 12}, { cond=(AND p0 p3 p2), acceptance={} source=14 dest: 13}, { cond=(AND p0 p3 (NOT p2)), acceptance={1} source=14 dest: 13}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={0} source=14 dest: 14}, { cond=(AND p0 (NOT p1) p3 (NOT p2)), acceptance={0, 1} source=14 dest: 14}, { cond=(AND p0 p1 p3 p2), acceptance={0} source=14 dest: 15}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={0, 1} source=14 dest: 15}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=15 dest: 10}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=15 dest: 10}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=15 dest: 11}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0, 1} source=15 dest: 11}, { cond=(AND (NOT p1) p3 p2), acceptance={0} source=15 dest: 14}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={0, 1} source=15 dest: 14}, { cond=(AND p1 p3 p2), acceptance={0} source=15 dest: 15}, { cond=(AND p1 p3 (NOT p2)), acceptance={0, 1} source=15 dest: 15}]], initial=0, aps=[p0:(LEQ s7 s5), p1:(LEQ 1 s15), p3:(LEQ s0 s15), p2:(LEQ 1 s9)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 145 ms.
Product exploration explored 100000 steps with 0 reset in 100 ms.
Computed a total of 6 stabilizing places and 12 stable transitions
Computed a total of 6 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 p3))), (X (NOT (AND p1 p3))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND p0 p1 p3))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1 p3))))]
False Knowledge obtained : [(X (AND (NOT p1) p3)), (X (NOT (AND (NOT p1) p3))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT p0)), (X p0), (X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p0) p3)), (X (NOT (AND (NOT p0) p3))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p0 (NOT p1) p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND p0 p1 (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
Knowledge based reduction with 8 factoid took 8567 ms. Reduced automaton from 16 states, 108 edges and 4 AP to 16 states, 108 edges and 4 AP.
Stuttering acceptance computed with spot in 961 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 815 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 47) seen :41
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-05-15 07:50:24] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:50:24] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:50:24] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 07:50:49] [INFO ] After 24993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 07:50:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 07:50:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 07:50:49] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 27/27 places, 260/260 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 27 transition count 252
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 23 transition count 248
Applied a total of 12 rules in 19 ms. Remains 23 /27 variables (removed 4) and now considering 248/260 (removed 12) transitions.
// Phase 1: matrix 248 rows 23 cols
[2022-05-15 07:50:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 07:50:49] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/27 places, 248/260 transitions.
Incomplete random walk after 10000 steps, including 1070 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 342027 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 342027 steps, saw 67983 distinct states, run finished after 3002 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 248 rows 23 cols
[2022-05-15 07:50:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 07:50:52] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 07:51:17] [INFO ] After 25000ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 07:51:17] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-05-15 07:51:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 07:51:17] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 23/23 places, 248/248 transitions.
Applied a total of 0 rules in 5 ms. Remains 23 /23 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 248/248 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 23/23 places, 248/248 transitions.
Applied a total of 0 rules in 6 ms. Remains 23 /23 variables (removed 0) and now considering 248/248 (removed 0) transitions.
// Phase 1: matrix 248 rows 23 cols
[2022-05-15 07:51:18] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:51:18] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 248 rows 23 cols
[2022-05-15 07:51:18] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:51:18] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-05-15 07:51:18] [INFO ] Implicit Places using invariants and state equation in 195 ms returned [7, 18]
Discarding 2 places :
Drop transitions removed 17 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 19 transitions.
Implicit Place search using SMT with State Equation took 260 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 21/23 places, 229/248 transitions.
Applied a total of 0 rules in 10 ms. Remains 21 /21 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/23 places, 229/248 transitions.
Incomplete random walk after 10000 steps, including 606 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 395433 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 395433 steps, saw 81397 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 229 rows 21 cols
[2022-05-15 07:51:21] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:51:22] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 07:51:47] [INFO ] After 24986ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 07:51:47] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-05-15 07:51:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-15 07:51:47] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 21/21 places, 229/229 transitions.
Applied a total of 0 rules in 5 ms. Remains 21 /21 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 229/229 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 21/21 places, 229/229 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 229/229 (removed 0) transitions.
// Phase 1: matrix 229 rows 21 cols
[2022-05-15 07:51:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 07:51:47] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 229 rows 21 cols
[2022-05-15 07:51:47] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:51:47] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-05-15 07:51:47] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2022-05-15 07:51:47] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 229 rows 21 cols
[2022-05-15 07:51:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 07:51:47] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 229/229 transitions.
Applied a total of 0 rules in 9 ms. Remains 21 /21 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 229 rows 21 cols
[2022-05-15 07:51:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 07:51:47] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 07:52:14] [INFO ] After 26473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 07:52:14] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-05-15 07:52:31] [INFO ] After 17583ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 07:52:45] [INFO ] After 31784ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2169 ms.
[2022-05-15 07:52:48] [INFO ] After 60475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 07:52:48] [INFO ] Flatten gal took : 14 ms
[2022-05-15 07:52:48] [INFO ] Flatten gal took : 9 ms
[2022-05-15 07:52:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7404299616465173501.gal : 18 ms
[2022-05-15 07:52:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9486635635884863215.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms13681574819297938929;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7404299616465173501.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9486635635884863215.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality9486635635884863215.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 28
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :28 after 97
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :97 after 349
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :349 after 2851
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :2851 after 6541
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :6541 after 30139
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :30139 after 200123
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :200123 after 428767
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :428767 after 977179
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :977179 after 2.38507e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5.32234e+06,0.493579,16388,2,1484,16,57369,12,0,358,51816,0
Total reachable state count : 5322344

Verifying 6 reachability properties.
Reachability property apf23 does not hold.
No reachable states exhibit your property : apf23

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf23,0,0.49521,16388,1,0,16,57369,12,0,376,51816,0
Reachability property apf24 does not hold.
No reachable states exhibit your property : apf24

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf24,0,0.496193,16388,1,0,16,57369,12,0,382,51816,0
Reachability property apf25 does not hold.
No reachable states exhibit your property : apf25

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf25,0,0.496943,16388,1,0,16,57369,12,0,383,51816,0
Reachability property apf26 does not hold.
No reachable states exhibit your property : apf26

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf26,0,0.497856,16388,1,0,16,57369,12,0,385,51816,0
Reachability property apf39 does not hold.
No reachable states exhibit your property : apf39

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf39,0,0.498784,16388,1,0,16,57369,12,0,385,51816,0
Reachability property apf40 does not hold.
No reachable states exhibit your property : apf40

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf40,0,0.499633,16388,1,0,16,57369,12,0,385,51816,0
ITS tools runner thread asked to quit. Dying gracefully.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 p3))), (X (NOT (AND p1 p3))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND p0 p1 p3))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1 p3)))), (G (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (G (NOT (AND p0 (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (G (NOT (AND p1 (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p3) (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) p3)), (X (NOT (AND (NOT p1) p3))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT p0)), (X p0), (X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND (NOT p0) p3)), (X (NOT (AND (NOT p0) p3))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p0 (NOT p1) p3))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND p0 p1 (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (AND p0 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND p1 p3 p2)), (F (AND p0 p1 (NOT p3))), (F (AND (NOT p1) p3 p2)), (F (AND p0 (NOT p1) (NOT p3))), (F p0), (F (AND p0 (NOT p1) p3 (NOT p2))), (F (AND p0 p3 (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p0) p3 (NOT p2))), (F (AND p0 (NOT p1))), (F (AND p1 (NOT p3) p2)), (F (AND p0 p1 p2)), (F (NOT (AND (NOT p1) (NOT p3) p2))), (F (AND p0 (NOT p1) p2)), (F (AND p1 p3 (NOT p2))), (F (AND p0 p2)), (F (AND (NOT p1) p3 (NOT p2))), (F (AND p0 p3)), (F (AND (NOT p0) p3)), (F (AND p0 (NOT p1) p3)), (F (AND p0 (NOT p1) p3 p2)), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p3 p2)), (F (AND p1 p3)), (F (AND (NOT p0) p3 p2)), (F (AND (NOT p1) p3)), (F (AND p0 p1 (NOT p3) p2)), (F (AND p1 (NOT p3))), (F (NOT (AND (NOT p0) p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 p1 p3 p2)), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p1) (NOT p3) p2)), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND p0 (NOT p3) p2)), (F (AND p0 p1 p3)), (F (NOT (AND (NOT p0) (NOT p3) p2))), (F (AND p0 p1 p3 (NOT p2)))]
Knowledge based reduction with 14 factoid took 14383 ms. Reduced automaton from 16 states, 108 edges and 4 AP to 16 states, 96 edges and 4 AP.
Stuttering acceptance computed with spot in 739 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 755 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
[2022-05-15 07:53:05] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:53:05] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 07:53:05] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-05-15 07:53:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 07:53:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 07:53:06] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2022-05-15 07:53:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 07:53:06] [INFO ] [Nat]Added 72 Read/Feed constraints in 54 ms returned sat
[2022-05-15 07:53:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 233 transitions) in 20 ms.
[2022-05-15 07:53:06] [INFO ] Added : 0 causal constraints over 0 iterations in 37 ms. Result :sat
Could not prove EG (NOT p0)
[2022-05-15 07:53:06] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:53:06] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:53:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 07:53:06] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2022-05-15 07:53:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 07:53:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 07:53:07] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2022-05-15 07:53:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 07:53:07] [INFO ] [Nat]Added 72 Read/Feed constraints in 87 ms returned sat
[2022-05-15 07:53:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 233 transitions) in 19 ms.
[2022-05-15 07:53:07] [INFO ] Added : 0 causal constraints over 0 iterations in 36 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-15 07:53:07] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:53:07] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 07:53:07] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
[2022-05-15 07:53:07] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:53:07] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:53:07] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-05-15 07:53:07] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:53:07] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:53:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 07:53:07] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2022-05-15 07:53:07] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:53:07] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:53:07] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 260/260 transitions.
Computed a total of 6 stabilizing places and 12 stable transitions
Computed a total of 6 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT (AND p1 p0))), (X (NOT (AND p3 p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p1) p3 p0))), (X (NOT (AND p1 (NOT p3) p0))), (X (X (NOT (AND p1 p3 p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p3)), (X (NOT (AND (NOT p1) p3))), (X (AND p3 (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X (NOT p0)), (X p0), (X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) p3 p0))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p1 (NOT p3) p0))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0))))]
Knowledge based reduction with 8 factoid took 13082 ms. Reduced automaton from 16 states, 96 edges and 4 AP to 16 states, 96 edges and 4 AP.
Stuttering acceptance computed with spot in 773 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Finished random walk after 536 steps, including 42 resets, run visited all 31 properties in 15 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT (AND p1 p0))), (X (NOT (AND p3 p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p1 p3))), (X (NOT (AND (NOT p1) p3 p0))), (X (NOT (AND p1 (NOT p3) p0))), (X (X (NOT (AND p1 p3 p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p3)), (X (NOT (AND (NOT p1) p3))), (X (AND p3 (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X (NOT p0)), (X p0), (X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p3) p0)), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p3) p0)), (X (NOT (AND (NOT p3) p0))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p3 p0))), (X (X (NOT (AND p3 p0)))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) p3 p0))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (AND (NOT p1) (NOT p3) p0))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p1 (NOT p3) p0))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (F (AND p0 p1 p3 p2)), (F (AND p0 (NOT p3))), (F (AND p0 (NOT p1) p3 p2)), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND p0 p3 p2)), (F (AND p0 p1 (NOT p3))), (F (AND (NOT p0) p3 p2)), (F (AND p0 (NOT p1) (NOT p3))), (F p0), (F (AND (NOT p1) p3 p2)), (F (AND p1 (NOT p2))), (F (AND p0 p1)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND p0 p2)), (F (AND p0 p3)), (F (AND (NOT p0) p3)), (F (AND p0 (NOT p1) p3)), (F (AND (NOT p0) (NOT p2))), (F (AND p1 p3)), (F (AND (NOT p1) p3)), (F (AND p1 (NOT p3))), (F (NOT (AND (NOT p0) p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND p0 p1 p3)), (F (AND p1 p3 p2))]
Knowledge based reduction with 8 factoid took 15433 ms. Reduced automaton from 16 states, 96 edges and 4 AP to 16 states, 96 edges and 4 AP.
Stuttering acceptance computed with spot in 865 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 959 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
[2022-05-15 07:53:38] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:53:38] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:53:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 07:53:39] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-15 07:53:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 07:53:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 07:53:39] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-05-15 07:53:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 07:53:39] [INFO ] [Nat]Added 72 Read/Feed constraints in 73 ms returned sat
[2022-05-15 07:53:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 233 transitions) in 18 ms.
[2022-05-15 07:53:39] [INFO ] Added : 0 causal constraints over 0 iterations in 40 ms. Result :sat
Could not prove EG (NOT p0)
[2022-05-15 07:53:39] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:53:39] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 07:53:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 07:53:39] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-15 07:53:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 07:53:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 07:53:39] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2022-05-15 07:53:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 07:53:40] [INFO ] [Nat]Added 72 Read/Feed constraints in 85 ms returned sat
[2022-05-15 07:53:40] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 233 transitions) in 18 ms.
[2022-05-15 07:53:40] [INFO ] Added : 0 causal constraints over 0 iterations in 51 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 799 ms :[(OR (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 66 ms.
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-10ringRL-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-10ringRL-LTLCardinality-12 finished in 208759 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(!((p0 U F(!G(X(p1)))) U p0))))'
Support contains 2 out of 27 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-15 07:53:41] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:53:41] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-15 07:53:41] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
[2022-05-15 07:53:41] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:53:41] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:53:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-15 07:53:41] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:53:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 07:53:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 07:53:41] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2022-05-15 07:53:41] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2022-05-15 07:53:41] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 07:53:41] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 260/260 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, p0, p0]
Running random walk in product with property : DNAwalker-PT-10ringRL-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s12 s0)], 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 DNAwalker-PT-10ringRL-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-10ringRL-LTLCardinality-14 finished in 645 ms.
All properties solved by simple procedures.
Total runtime 221668 ms.

BK_STOP 1652601221760

--------------------
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="DNAwalker-PT-10ringRL"
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 DNAwalker-PT-10ringRL, 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 r060-tall-165254772000443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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