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.r222-tall-165286026000956.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 ShieldRVt-PT-005B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026000956
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 7.3K Apr 30 01:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 01:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 01:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 01:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 09:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 09:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 09:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 09:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 60K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653072880609

Running Version 202205111006
[2022-05-20 18:54:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-20 18:54:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 18:54:41] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2022-05-20 18:54:41] [INFO ] Transformed 253 places.
[2022-05-20 18:54:41] [INFO ] Transformed 253 transitions.
[2022-05-20 18:54:41] [INFO ] Found NUPN structural information;
[2022-05-20 18:54:41] [INFO ] Parsed PT model containing 253 places and 253 transitions in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-005B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 253/253 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 205 transition count 205
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 205 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 204 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 204 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 203 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 203 transition count 203
Applied a total of 100 rules in 65 ms. Remains 203 /253 variables (removed 50) and now considering 203/253 (removed 50) transitions.
// Phase 1: matrix 203 rows 203 cols
[2022-05-20 18:54:42] [INFO ] Computed 21 place invariants in 15 ms
[2022-05-20 18:54:42] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 203 rows 203 cols
[2022-05-20 18:54:42] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 18:54:42] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 203 cols
[2022-05-20 18:54:42] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-20 18:54:42] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/253 places, 203/253 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/253 places, 203/253 transitions.
Support contains 32 out of 203 places after structural reductions.
[2022-05-20 18:54:42] [INFO ] Flatten gal took : 39 ms
[2022-05-20 18:54:42] [INFO ] Flatten gal took : 19 ms
[2022-05-20 18:54:42] [INFO ] Input system was already deterministic with 203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 29) seen :28
Finished Best-First random walk after 2531 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=421 )
Computed a total of 59 stabilizing places and 59 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 197 transition count 197
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 197 transition count 197
Applied a total of 12 rules in 9 ms. Remains 197 /203 variables (removed 6) and now considering 197/203 (removed 6) transitions.
// Phase 1: matrix 197 rows 197 cols
[2022-05-20 18:54:43] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:43] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 197 rows 197 cols
[2022-05-20 18:54:43] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:43] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
// Phase 1: matrix 197 rows 197 cols
[2022-05-20 18:54:43] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:43] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/203 places, 197/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 197/203 places, 197/203 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-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:(EQ s77 1)], 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 1 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-00 finished in 609 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(X(p0)) U G(!G((F(!p1)||!p0)))))))'
Support contains 4 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 202 transition count 153
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 153 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 152 transition count 152
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 100 place count 152 transition count 117
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 170 place count 117 transition count 117
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 176 place count 111 transition count 111
Iterating global reduction 3 with 6 rules applied. Total rules applied 182 place count 111 transition count 111
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 182 place count 111 transition count 105
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 194 place count 105 transition count 105
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 280 place count 62 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 281 place count 62 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 61 transition count 60
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 309 place count 48 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 311 place count 46 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 312 place count 45 transition count 69
Applied a total of 312 rules in 41 ms. Remains 45 /203 variables (removed 158) and now considering 69/203 (removed 134) transitions.
// Phase 1: matrix 69 rows 45 cols
[2022-05-20 18:54:44] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 18:54:44] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 69 rows 45 cols
[2022-05-20 18:54:44] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-20 18:54:44] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2022-05-20 18:54:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 69 rows 45 cols
[2022-05-20 18:54:44] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 18:54:44] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/203 places, 69/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/203 places, 69/203 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s11 1), p1:(AND (EQ s18 1) (EQ s21 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-01 finished in 526 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1 U G(p1))) U X(X(p2))))'
Support contains 3 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 196 transition count 196
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 196 transition count 196
Applied a total of 14 rules in 29 ms. Remains 196 /203 variables (removed 7) and now considering 196/203 (removed 7) transitions.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:44] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:44] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:44] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:44] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:44] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 18:54:44] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/203 places, 196/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 196/203 places, 196/203 transitions.
Stuttering acceptance computed with spot in 499 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 9}, { cond=p0, acceptance={} source=3 dest: 10}, { cond=(OR p1 p0), acceptance={} source=3 dest: 11}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 12}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 8}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=7 dest: 13}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 14}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 13}], [{ cond=(NOT p2), acceptance={} source=9 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=10 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=10 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=10 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=11 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=11 dest: 10}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=11 dest: 11}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=12 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=12 dest: 8}], [{ cond=(NOT p1), acceptance={} source=13 dest: 6}, { cond=p1, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=14 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=14 dest: 13}, { cond=(AND p1 p0), acceptance={} source=14 dest: 14}, { cond=(AND (NOT p1) p0), acceptance={0} source=14 dest: 14}]], initial=0, aps=[p1:(EQ s82 1), p0:(EQ s87 1), p2:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-02 finished in 829 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(F(X((X(p0)&&p1))))))))'
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 198 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 198 transition count 198
Applied a total of 10 rules in 8 ms. Remains 198 /203 variables (removed 5) and now considering 198/203 (removed 5) transitions.
// Phase 1: matrix 198 rows 198 cols
[2022-05-20 18:54:45] [INFO ] Computed 21 place invariants in 18 ms
[2022-05-20 18:54:45] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 198 rows 198 cols
[2022-05-20 18:54:45] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:45] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 198 rows 198 cols
[2022-05-20 18:54:45] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:45] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 198/203 places, 198/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/203 places, 198/203 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s181 0), p0:(EQ s46 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33355 reset in 296 ms.
Product exploration explored 100000 steps with 33275 reset in 195 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/198 stabilizing places and 59/198 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 314 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), false]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :3
Finished Best-First random walk after 1140 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=570 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 8 factoid took 412 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), false]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), false]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 197 transition count 144
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 144 transition count 144
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 106 place count 144 transition count 105
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 184 place count 105 transition count 105
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 272 place count 61 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 273 place count 61 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 275 place count 60 transition count 59
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 303 place count 46 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 305 place count 44 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 306 place count 43 transition count 70
Applied a total of 306 rules in 27 ms. Remains 43 /198 variables (removed 155) and now considering 70/198 (removed 128) transitions.
// Phase 1: matrix 70 rows 43 cols
[2022-05-20 18:54:47] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 18:54:47] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 70 rows 43 cols
[2022-05-20 18:54:47] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 18:54:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 18:54:47] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2022-05-20 18:54:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 70 rows 43 cols
[2022-05-20 18:54:47] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-20 18:54:47] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/198 places, 70/198 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/198 places, 70/198 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/43 stabilizing places and 2/70 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 6 factoid took 374 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), false]
Finished random walk after 12 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 422 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), false]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), false]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), false]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-03 finished in 3672 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G(((X(p0) U p0) U X(p1)))))))'
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 197 transition count 197
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 197 transition count 197
Applied a total of 12 rules in 4 ms. Remains 197 /203 variables (removed 6) and now considering 197/203 (removed 6) transitions.
// Phase 1: matrix 197 rows 197 cols
[2022-05-20 18:54:49] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 18:54:49] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 197 rows 197 cols
[2022-05-20 18:54:49] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:49] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
// Phase 1: matrix 197 rows 197 cols
[2022-05-20 18:54:49] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-20 18:54:49] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/203 places, 197/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 197/203 places, 197/203 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=true, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s154 1), p1:(EQ s94 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 362 reset in 162 ms.
Stack based approach found an accepted trace after 1012 steps with 4 reset with depth 117 and stack size 117 in 2 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-04 finished in 619 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((X(G(p0))&&p1))) U G(X(!F(p2)))))'
Support contains 3 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 196 transition count 196
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 196 transition count 196
Applied a total of 14 rules in 5 ms. Remains 196 /203 variables (removed 7) and now considering 196/203 (removed 7) transitions.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:49] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:49] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:49] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:49] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:49] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 18:54:49] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/203 places, 196/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 196/203 places, 196/203 transitions.
Stuttering acceptance computed with spot in 244 ms :[p2, p2, true, p2, (NOT p0), (OR (AND p0 (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) p1)), (AND p2 (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}, { cond=(AND p2 p1), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p2 p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s184 1), p1:(EQ s149 1), p0:(EQ s122 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-06 finished in 548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 196 transition count 196
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 196 transition count 196
Applied a total of 14 rules in 8 ms. Remains 196 /203 variables (removed 7) and now considering 196/203 (removed 7) transitions.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:50] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 18:54:50] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:50] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:50] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:50] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:50] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/203 places, 196/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 196/203 places, 196/203 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-07 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:(EQ s1 0)], 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 ShieldRVt-PT-005B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-07 finished in 326 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F((G(p0)&&F(p1)&&p2))||p1))))'
Support contains 1 out of 203 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 196 transition count 196
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 196 transition count 196
Applied a total of 14 rules in 4 ms. Remains 196 /203 variables (removed 7) and now considering 196/203 (removed 7) transitions.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:50] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 18:54:50] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:50] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 18:54:50] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:50] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:50] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/203 places, 196/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 196/203 places, 196/203 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s119 1)], 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]]
Product exploration explored 100000 steps with 617 reset in 122 ms.
Stack based approach found an accepted trace after 413 steps with 2 reset with depth 94 and stack size 94 in 1 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-08 finished in 447 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 202 transition count 150
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 150 transition count 150
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 104 place count 150 transition count 113
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 178 place count 113 transition count 113
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 183 place count 108 transition count 108
Iterating global reduction 2 with 5 rules applied. Total rules applied 188 place count 108 transition count 108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 188 place count 108 transition count 103
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 198 place count 103 transition count 103
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 286 place count 59 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 287 place count 59 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 289 place count 58 transition count 57
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 317 place count 44 transition count 69
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 319 place count 42 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 320 place count 41 transition count 67
Applied a total of 320 rules in 24 ms. Remains 41 /203 variables (removed 162) and now considering 67/203 (removed 136) transitions.
// Phase 1: matrix 67 rows 41 cols
[2022-05-20 18:54:50] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 18:54:51] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 67 rows 41 cols
[2022-05-20 18:54:51] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 18:54:51] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2022-05-20 18:54:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 67 rows 41 cols
[2022-05-20 18:54:51] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 18:54:51] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/203 places, 67/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/203 places, 67/203 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-09 finished in 202 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 196 transition count 196
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 196 transition count 196
Applied a total of 14 rules in 5 ms. Remains 196 /203 variables (removed 7) and now considering 196/203 (removed 7) transitions.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:51] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 18:54:51] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:51] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 18:54:51] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:51] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:51] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/203 places, 196/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 196/203 places, 196/203 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s46 0)], 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]]
Product exploration explored 100000 steps with 50000 reset in 159 ms.
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Detected a total of 58/196 stabilizing places and 58/196 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-005B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-005B-LTLFireability-10 finished in 695 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 202 transition count 151
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 151 transition count 151
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 102 place count 151 transition count 114
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 176 place count 114 transition count 114
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 181 place count 109 transition count 109
Iterating global reduction 2 with 5 rules applied. Total rules applied 186 place count 109 transition count 109
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 186 place count 109 transition count 104
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 196 place count 104 transition count 104
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 284 place count 60 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 285 place count 60 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 287 place count 59 transition count 58
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 313 place count 46 transition count 69
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 315 place count 44 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 43 transition count 67
Applied a total of 316 rules in 26 ms. Remains 43 /203 variables (removed 160) and now considering 67/203 (removed 136) transitions.
// Phase 1: matrix 67 rows 43 cols
[2022-05-20 18:54:51] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 18:54:51] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 67 rows 43 cols
[2022-05-20 18:54:51] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 18:54:51] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2022-05-20 18:54:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 67 rows 43 cols
[2022-05-20 18:54:51] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 18:54:52] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/203 places, 67/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 43/203 places, 67/203 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s9 1), p0:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-11 finished in 224 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(X(G(p0)))))))'
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 202 transition count 151
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 151 transition count 151
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 102 place count 151 transition count 114
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 176 place count 114 transition count 114
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 182 place count 108 transition count 108
Iterating global reduction 2 with 6 rules applied. Total rules applied 188 place count 108 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 188 place count 108 transition count 102
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 200 place count 102 transition count 102
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 284 place count 60 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 285 place count 60 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 287 place count 59 transition count 58
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 315 place count 45 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 317 place count 43 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 318 place count 42 transition count 69
Applied a total of 318 rules in 19 ms. Remains 42 /203 variables (removed 161) and now considering 69/203 (removed 134) transitions.
// Phase 1: matrix 69 rows 42 cols
[2022-05-20 18:54:52] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 18:54:52] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 69 rows 42 cols
[2022-05-20 18:54:52] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 18:54:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 18:54:52] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-20 18:54:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 69 rows 42 cols
[2022-05-20 18:54:52] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 18:54:52] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/203 places, 69/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/203 places, 69/203 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-12 finished in 180 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(X(p0) U p1)||G(F((X(p2)&&p2)))))'
Support contains 3 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 197 transition count 197
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 197 transition count 197
Applied a total of 12 rules in 7 ms. Remains 197 /203 variables (removed 6) and now considering 197/203 (removed 6) transitions.
// Phase 1: matrix 197 rows 197 cols
[2022-05-20 18:54:52] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 18:54:52] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 197 rows 197 cols
[2022-05-20 18:54:52] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:52] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 197 rows 197 cols
[2022-05-20 18:54:52] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-20 18:54:52] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/203 places, 197/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 197/203 places, 197/203 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) p1 p0), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 1}]], initial=0, aps=[p2:(EQ s195 0), p1:(EQ s110 1), p0:(EQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p1 p0))), (X p2), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p2 p1 p0)))
Knowledge based reduction with 12 factoid took 197 ms. Reduced automaton from 5 states, 14 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-005B-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-005B-LTLFireability-13 finished in 998 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&G(p1))))'
Support contains 3 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 196 transition count 196
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 196 transition count 196
Applied a total of 14 rules in 7 ms. Remains 196 /203 variables (removed 7) and now considering 196/203 (removed 7) transitions.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:53] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 18:54:53] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:53] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 18:54:53] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:53] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 18:54:53] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/203 places, 196/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 196/203 places, 196/203 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (NEQ s25 1) (NEQ s168 1)), p0:(EQ s138 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15071 steps with 0 reset in 37 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-14 finished in 468 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 196 transition count 196
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 196 transition count 196
Applied a total of 14 rules in 4 ms. Remains 196 /203 variables (removed 7) and now considering 196/203 (removed 7) transitions.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:53] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:53] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:53] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:53] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
// Phase 1: matrix 196 rows 196 cols
[2022-05-20 18:54:53] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 18:54:53] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/203 places, 196/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 196/203 places, 196/203 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s109 1), p1:(NEQ s59 1)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Detected a total of 58/196 stabilizing places and 58/196 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 9 factoid took 199 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-005B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-005B-LTLFireability-15 finished in 948 ms.
All properties solved by simple procedures.
Total runtime 12904 ms.

BK_STOP 1653072894759

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ShieldRVt-PT-005B"
export BK_EXAMINATION="LTLFireability"
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 ShieldRVt-PT-005B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286026000956"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-005B.tgz
mv ShieldRVt-PT-005B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;