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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 5.6K Apr 30 01:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 30 01:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 30 01:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 30 01:10 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.8K May 9 09:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 09:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 36K 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-003B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-003B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653071653844

Running Version 202205111006
[2022-05-20 18:34:14] [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-20 18:34:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 18:34:15] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2022-05-20 18:34:15] [INFO ] Transformed 153 places.
[2022-05-20 18:34:15] [INFO ] Transformed 153 transitions.
[2022-05-20 18:34:15] [INFO ] Found NUPN structural information;
[2022-05-20 18:34:15] [INFO ] Parsed PT model containing 153 places and 153 transitions in 214 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-003B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 132 transition count 132
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 132 transition count 132
Applied a total of 42 rules in 31 ms. Remains 132 /153 variables (removed 21) and now considering 132/153 (removed 21) transitions.
// Phase 1: matrix 132 rows 132 cols
[2022-05-20 18:34:15] [INFO ] Computed 13 place invariants in 15 ms
[2022-05-20 18:34:15] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 132 rows 132 cols
[2022-05-20 18:34:15] [INFO ] Computed 13 place invariants in 6 ms
[2022-05-20 18:34:15] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
// Phase 1: matrix 132 rows 132 cols
[2022-05-20 18:34:15] [INFO ] Computed 13 place invariants in 5 ms
[2022-05-20 18:34:15] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/153 places, 132/153 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/153 places, 132/153 transitions.
Support contains 27 out of 132 places after structural reductions.
[2022-05-20 18:34:16] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-20 18:34:16] [INFO ] Flatten gal took : 57 ms
FORMULA ShieldRVt-PT-003B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 18:34:16] [INFO ] Flatten gal took : 10 ms
[2022-05-20 18:34:16] [INFO ] Input system was already deterministic with 132 transitions.
Support contains 26 out of 132 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 132 rows 132 cols
[2022-05-20 18:34:16] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-20 18:34:16] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 18:34:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 84 ms returned sat
[2022-05-20 18:34:16] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA ShieldRVt-PT-003B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 41 stabilizing places and 41 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 132/132 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 131 transition count 96
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 96 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 95 transition count 95
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 72 place count 95 transition count 78
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 106 place count 78 transition count 78
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 114 place count 70 transition count 70
Iterating global reduction 3 with 8 rules applied. Total rules applied 122 place count 70 transition count 70
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 122 place count 70 transition count 66
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 130 place count 66 transition count 66
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 178 place count 42 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 179 place count 42 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 181 place count 41 transition count 40
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 193 place count 35 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 33 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 196 place count 32 transition count 41
Applied a total of 196 rules in 70 ms. Remains 32 /132 variables (removed 100) and now considering 41/132 (removed 91) transitions.
// Phase 1: matrix 41 rows 32 cols
[2022-05-20 18:34:16] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 18:34:17] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 41 rows 32 cols
[2022-05-20 18:34:17] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 18:34:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-20 18:34:17] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2022-05-20 18:34:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 41 rows 32 cols
[2022-05-20 18:34:17] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 18:34:17] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/132 places, 41/132 transitions.
Finished structural reductions, in 1 iterations. Remains : 32/132 places, 41/132 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s27 0) (EQ s23 1)), p0:(OR (EQ s13 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 874 steps with 4 reset in 28 ms.
FORMULA ShieldRVt-PT-003B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLCardinality-00 finished in 704 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(G(F(F(p1)))))))'
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 132/132 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 131 transition count 95
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 95 transition count 95
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 72 place count 95 transition count 77
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 108 place count 77 transition count 77
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 115 place count 70 transition count 70
Iterating global reduction 2 with 7 rules applied. Total rules applied 122 place count 70 transition count 70
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 122 place count 70 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 130 place count 66 transition count 66
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 180 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 181 place count 41 transition count 40
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 183 place count 40 transition count 39
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 199 place count 32 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 30 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 29 transition count 43
Applied a total of 202 rules in 38 ms. Remains 29 /132 variables (removed 103) and now considering 43/132 (removed 89) transitions.
// Phase 1: matrix 43 rows 29 cols
[2022-05-20 18:34:17] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 18:34:17] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 43 rows 29 cols
[2022-05-20 18:34:17] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-20 18:34:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 18:34:17] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2022-05-20 18:34:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 43 rows 29 cols
[2022-05-20 18:34:17] [INFO ] Computed 12 place invariants in 18 ms
[2022-05-20 18:34:17] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/132 places, 43/132 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/132 places, 43/132 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s22 1)), p1:(AND (NEQ s11 0) (NEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLCardinality-02 finished in 369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((!F(p0) U G(!X(p1))))&&X(F(p1))))'
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 132/132 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 121 transition count 121
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 121 transition count 121
Applied a total of 22 rules in 10 ms. Remains 121 /132 variables (removed 11) and now considering 121/132 (removed 11) transitions.
// Phase 1: matrix 121 rows 121 cols
[2022-05-20 18:34:17] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:17] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 121 rows 121 cols
[2022-05-20 18:34:18] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:18] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 121 rows 121 cols
[2022-05-20 18:34:18] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:18] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/132 places, 121/132 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/132 places, 121/132 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, true, p1, (NOT p1), p1, true, (AND p0 (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (EQ s64 0) (EQ s56 1)) (OR (EQ s95 0) (EQ s20 1))), p1:(OR (EQ s95 0) (EQ s20 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 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLCardinality-03 finished in 507 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!p0 U (X(G(p0))&&p0)))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 132/132 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 131 transition count 93
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 93 transition count 93
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 76 place count 93 transition count 75
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 112 place count 75 transition count 75
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 120 place count 67 transition count 67
Iterating global reduction 2 with 8 rules applied. Total rules applied 128 place count 67 transition count 67
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 128 place count 67 transition count 62
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 138 place count 62 transition count 62
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 186 place count 38 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 187 place count 38 transition count 37
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 189 place count 37 transition count 36
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 205 place count 29 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 207 place count 27 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 26 transition count 40
Applied a total of 208 rules in 18 ms. Remains 26 /132 variables (removed 106) and now considering 40/132 (removed 92) transitions.
// Phase 1: matrix 40 rows 26 cols
[2022-05-20 18:34:18] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 18:34:18] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 40 rows 26 cols
[2022-05-20 18:34:18] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 18:34:18] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2022-05-20 18:34:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 26 cols
[2022-05-20 18:34:18] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-20 18:34:18] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/132 places, 40/132 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/132 places, 40/132 transitions.
Stuttering acceptance computed with spot in 55 ms :[p0, p0]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s13 0) (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-003B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLCardinality-04 finished in 250 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(!p0)))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 132/132 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 121 transition count 121
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 119 transition count 119
Applied a total of 26 rules in 14 ms. Remains 119 /132 variables (removed 13) and now considering 119/132 (removed 13) transitions.
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:34:18] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:18] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:34:18] [INFO ] Computed 13 place invariants in 5 ms
[2022-05-20 18:34:18] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:34:18] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:18] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/132 places, 119/132 transitions.
Finished structural reductions, in 1 iterations. Remains : 119/132 places, 119/132 transitions.
Stuttering acceptance computed with spot in 109 ms :[p0, true, p0]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s103 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, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLCardinality-07 finished in 376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X(p1)))'
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 132/132 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 122 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 122 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 121 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 120 transition count 120
Applied a total of 24 rules in 8 ms. Remains 120 /132 variables (removed 12) and now considering 120/132 (removed 12) transitions.
// Phase 1: matrix 120 rows 120 cols
[2022-05-20 18:34:19] [INFO ] Computed 13 place invariants in 3 ms
[2022-05-20 18:34:19] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 120 rows 120 cols
[2022-05-20 18:34:19] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:19] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 120 rows 120 cols
[2022-05-20 18:34:19] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:19] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/132 places, 120/132 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/132 places, 120/132 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s101 0) (EQ s11 1)), p1:(EQ s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-003B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLCardinality-08 finished in 366 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 132/132 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 120 transition count 120
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 119 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 118 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 118 transition count 118
Applied a total of 28 rules in 11 ms. Remains 118 /132 variables (removed 14) and now considering 118/132 (removed 14) transitions.
// Phase 1: matrix 118 rows 118 cols
[2022-05-20 18:34:19] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:19] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 118 rows 118 cols
[2022-05-20 18:34:19] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:19] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
// Phase 1: matrix 118 rows 118 cols
[2022-05-20 18:34:19] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:19] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/132 places, 118/132 transitions.
Finished structural reductions, in 1 iterations. Remains : 118/132 places, 118/132 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-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:(OR (EQ s98 0) (EQ s55 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 50000 reset in 291 ms.
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-003B-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-003B-LTLCardinality-10 finished in 919 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 132/132 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 121 transition count 121
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 119 transition count 119
Applied a total of 26 rules in 6 ms. Remains 119 /132 variables (removed 13) and now considering 119/132 (removed 13) transitions.
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:34:20] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:20] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:34:20] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:20] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
// Phase 1: matrix 119 rows 119 cols
[2022-05-20 18:34:20] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:20] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/132 places, 119/132 transitions.
Finished structural reductions, in 1 iterations. Remains : 119/132 places, 119/132 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s21 0) (EQ s94 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 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-003B-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-003B-LTLCardinality-12 finished in 729 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(G(F((X(p0)||p1))))))))'
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 132/132 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 131 transition count 97
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 97 transition count 97
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 68 place count 97 transition count 78
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 106 place count 78 transition count 78
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 113 place count 71 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 120 place count 71 transition count 71
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 120 place count 71 transition count 66
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 130 place count 66 transition count 66
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 178 place count 42 transition count 42
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 196 place count 33 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 198 place count 31 transition count 49
Applied a total of 198 rules in 20 ms. Remains 31 /132 variables (removed 101) and now considering 49/132 (removed 83) transitions.
// Phase 1: matrix 49 rows 31 cols
[2022-05-20 18:34:21] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:21] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 49 rows 31 cols
[2022-05-20 18:34:21] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-20 18:34:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-20 18:34:21] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2022-05-20 18:34:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 49 rows 31 cols
[2022-05-20 18:34:21] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-20 18:34:21] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/132 places, 49/132 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/132 places, 49/132 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s26 0) (NEQ s9 1)), p0:(OR (EQ s21 0) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-003B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLCardinality-15 finished in 279 ms.
All properties solved by simple procedures.
Total runtime 6384 ms.

BK_STOP 1653071661461

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldRVt-PT-003B"
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 ShieldRVt-PT-003B, 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 r222-tall-165286026000923"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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