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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 6.2K Apr 30 00:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 30 00:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 00:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 00:21 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.3K May 9 09:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 17K 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.6K 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 48K 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-004B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653072123179

Running Version 202205111006
[2022-05-20 18:42:04] [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:42:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 18:42:04] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2022-05-20 18:42:04] [INFO ] Transformed 203 places.
[2022-05-20 18:42:04] [INFO ] Transformed 203 transitions.
[2022-05-20 18:42:04] [INFO ] Found NUPN structural information;
[2022-05-20 18:42:04] [INFO ] Parsed PT model containing 203 places and 203 transitions in 188 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVt-PT-004B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-004B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-004B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-004B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 169 transition count 169
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 169 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 168 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 168 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 167 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 167 transition count 167
Applied a total of 72 rules in 53 ms. Remains 167 /203 variables (removed 36) and now considering 167/203 (removed 36) transitions.
// Phase 1: matrix 167 rows 167 cols
[2022-05-20 18:42:04] [INFO ] Computed 17 place invariants in 9 ms
[2022-05-20 18:42:05] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 167 rows 167 cols
[2022-05-20 18:42:05] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-20 18:42:05] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
// Phase 1: matrix 167 rows 167 cols
[2022-05-20 18:42:05] [INFO ] Computed 17 place invariants in 11 ms
[2022-05-20 18:42:05] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 167/203 places, 167/203 transitions.
Finished structural reductions, in 1 iterations. Remains : 167/203 places, 167/203 transitions.
Support contains 29 out of 167 places after structural reductions.
[2022-05-20 18:42:05] [INFO ] Flatten gal took : 38 ms
[2022-05-20 18:42:05] [INFO ] Flatten gal took : 33 ms
[2022-05-20 18:42:05] [INFO ] Input system was already deterministic with 167 transitions.
Finished random walk after 3951 steps, including 1 resets, run visited all 24 properties in 145 ms. (steps per millisecond=27 )
Computed a total of 48 stabilizing places and 48 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 166 transition count 122
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 89 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 121 transition count 121
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 90 place count 121 transition count 96
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 140 place count 96 transition count 96
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 145 place count 91 transition count 91
Iterating global reduction 3 with 5 rules applied. Total rules applied 150 place count 91 transition count 91
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 150 place count 91 transition count 88
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 156 place count 88 transition count 88
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 232 place count 50 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 233 place count 50 transition count 49
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 235 place count 49 transition count 48
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 251 place count 41 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 253 place count 39 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 254 place count 38 transition count 53
Applied a total of 254 rules in 99 ms. Remains 38 /167 variables (removed 129) and now considering 53/167 (removed 114) transitions.
// Phase 1: matrix 53 rows 38 cols
[2022-05-20 18:42:06] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 18:42:06] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 53 rows 38 cols
[2022-05-20 18:42:06] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 18:42:06] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2022-05-20 18:42:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 53 rows 38 cols
[2022-05-20 18:42:06] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 18:42:06] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/167 places, 53/167 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/167 places, 53/167 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s25 1), p1:(AND (EQ s31 1) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-00 finished in 711 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&!(p0 U p1)) U X(!p2)))'
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 158 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 158 transition count 158
Applied a total of 18 rules in 13 ms. Remains 158 /167 variables (removed 9) and now considering 158/167 (removed 9) transitions.
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:07] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:07] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:07] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:07] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:07] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:07] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/167 places, 158/167 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/167 places, 158/167 transitions.
Stuttering acceptance computed with spot in 317 ms :[p2, p2, (AND (NOT p0) p2), p2, (AND p1 p2), true, (NOT p0), p1]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s139 1), p0:(EQ s46 1), p2:(AND (EQ s4 1) (EQ s31 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, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 458 ms.
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Detected a total of 47/158 stabilizing places and 47/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 19 factoid took 367 ms. Reduced automaton from 8 states, 16 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-004B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-004B-LTLFireability-01 finished in 1669 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 157 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 157 transition count 157
Applied a total of 20 rules in 9 ms. Remains 157 /167 variables (removed 10) and now considering 157/167 (removed 10) transitions.
// Phase 1: matrix 157 rows 157 cols
[2022-05-20 18:42:08] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 18:42:08] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 157 rows 157 cols
[2022-05-20 18:42:08] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:08] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
// Phase 1: matrix 157 rows 157 cols
[2022-05-20 18:42:08] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:08] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/167 places, 157/167 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/167 places, 157/167 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-02 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 s153 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-004B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-02 finished in 331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 157 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 157 transition count 157
Applied a total of 20 rules in 9 ms. Remains 157 /167 variables (removed 10) and now considering 157/167 (removed 10) transitions.
// Phase 1: matrix 157 rows 157 cols
[2022-05-20 18:42:08] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 18:42:09] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 157 rows 157 cols
[2022-05-20 18:42:09] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 18:42:09] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 157 rows 157 cols
[2022-05-20 18:42:09] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 18:42:09] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/167 places, 157/167 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/167 places, 157/167 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s94 0) (EQ s98 0) (EQ s111 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 130 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 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 73 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-004B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-004B-LTLFireability-05 finished in 704 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0 U !F(X(p0)))) U G(p1))))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 166 transition count 119
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 119 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 118 transition count 118
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 96 place count 118 transition count 92
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 148 place count 92 transition count 92
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 152 place count 88 transition count 88
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 88 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 156 place count 88 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 160 place count 86 transition count 86
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 232 place count 50 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 233 place count 50 transition count 49
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 235 place count 49 transition count 48
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 257 place count 38 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 259 place count 36 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 260 place count 35 transition count 56
Applied a total of 260 rules in 46 ms. Remains 35 /167 variables (removed 132) and now considering 56/167 (removed 111) transitions.
// Phase 1: matrix 56 rows 35 cols
[2022-05-20 18:42:09] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-20 18:42:09] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 56 rows 35 cols
[2022-05-20 18:42:09] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 18:42:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 18:42:09] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-05-20 18:42:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 56 rows 35 cols
[2022-05-20 18:42:09] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 18:42:09] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/167 places, 56/167 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/167 places, 56/167 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), p0]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s15 1), p0:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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-004B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-06 finished in 315 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((G(F(G(p0)))&&X(!(p1 U X(G(p2)))))))))'
Support contains 2 out of 167 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 166 transition count 119
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 119 transition count 119
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 94 place count 119 transition count 93
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 146 place count 93 transition count 93
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 149 place count 90 transition count 90
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 90 transition count 90
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 152 place count 90 transition count 88
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 156 place count 88 transition count 88
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 232 place count 50 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 50 transition count 49
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 235 place count 49 transition count 48
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 255 place count 39 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 37 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 258 place count 36 transition count 54
Applied a total of 258 rules in 43 ms. Remains 36 /167 variables (removed 131) and now considering 54/167 (removed 113) transitions.
// Phase 1: matrix 54 rows 36 cols
[2022-05-20 18:42:10] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 18:42:10] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 54 rows 36 cols
[2022-05-20 18:42:10] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 18:42:10] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2022-05-20 18:42:10] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 36 cols
[2022-05-20 18:42:10] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 18:42:10] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/167 places, 54/167 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/167 places, 54/167 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) p2), p2, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s3 1), p2:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-07 finished in 401 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 166 transition count 118
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 118 transition count 118
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 96 place count 118 transition count 93
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 146 place count 93 transition count 93
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 151 place count 88 transition count 88
Iterating global reduction 2 with 5 rules applied. Total rules applied 156 place count 88 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 156 place count 88 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 160 place count 86 transition count 86
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 236 place count 48 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 48 transition count 47
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 239 place count 47 transition count 46
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 259 place count 37 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 35 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 262 place count 34 transition count 53
Applied a total of 262 rules in 15 ms. Remains 34 /167 variables (removed 133) and now considering 53/167 (removed 114) transitions.
// Phase 1: matrix 53 rows 34 cols
[2022-05-20 18:42:10] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 18:42:10] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 53 rows 34 cols
[2022-05-20 18:42:10] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 18:42:10] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-05-20 18:42:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 53 rows 34 cols
[2022-05-20 18:42:10] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 18:42:10] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/167 places, 53/167 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/167 places, 53/167 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s32 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]]
Product exploration explored 100000 steps with 19464 reset in 148 ms.
Stack based approach found an accepted trace after 1568 steps with 301 reset with depth 8 and stack size 8 in 11 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-08 finished in 473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 158 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 158 transition count 158
Applied a total of 18 rules in 6 ms. Remains 158 /167 variables (removed 9) and now considering 158/167 (removed 9) transitions.
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:10] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:10] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:10] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 18:42:11] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:11] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 18:42:11] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/167 places, 158/167 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/167 places, 158/167 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s45 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 2702 reset in 150 ms.
Product exploration explored 100000 steps with 2711 reset in 201 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Detected a total of 47/158 stabilizing places and 47/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 229 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 40 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:12] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-20 18:42:12] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-20 18:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 18:42:12] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-20 18:42:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 18:42:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2022-05-20 18:42:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 18:42:12] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-20 18:42:12] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 2 ms to minimize.
[2022-05-20 18:42:12] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2022-05-20 18:42:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2022-05-20 18:42:12] [INFO ] Computed and/alt/rep : 157/231/157 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-20 18:42:13] [INFO ] Added : 153 causal constraints over 31 iterations in 436 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 158/158 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 158/158 (removed 0) transitions.
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:13] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:13] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:13] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:13] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:13] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-20 18:42:13] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 158/158 transitions.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Detected a total of 47/158 stabilizing places and 47/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 40 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:14] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:14] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-20 18:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 18:42:14] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-20 18:42:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 18:42:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-20 18:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 18:42:14] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-20 18:42:14] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2022-05-20 18:42:14] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 2 ms to minimize.
[2022-05-20 18:42:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2022-05-20 18:42:14] [INFO ] Computed and/alt/rep : 157/231/157 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-20 18:42:15] [INFO ] Added : 153 causal constraints over 31 iterations in 425 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2691 reset in 125 ms.
Product exploration explored 100000 steps with 2673 reset in 151 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 158/158 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 158 transition count 158
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 43 place count 158 transition count 174
Deduced a syphon composed of 59 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 59 place count 158 transition count 174
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 106 place count 158 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 107 place count 158 transition count 173
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 138 place count 127 transition count 142
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 169 place count 127 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 127 transition count 142
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 172 place count 125 transition count 140
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 174 place count 125 transition count 140
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -103
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 189 place count 125 transition count 243
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 204 place count 110 transition count 213
Deduced a syphon composed of 74 places in 1 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 219 place count 110 transition count 213
Deduced a syphon composed of 74 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 222 place count 110 transition count 210
Deduced a syphon composed of 74 places in 0 ms
Applied a total of 222 rules in 40 ms. Remains 110 /158 variables (removed 48) and now considering 210/158 (removed -52) transitions.
[2022-05-20 18:42:15] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 210 rows 110 cols
[2022-05-20 18:42:15] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:15] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/158 places, 210/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/158 places, 210/158 transitions.
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 1 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-10 finished in 5069 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(F((G(p0)||p1))))))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 166 transition count 119
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 119 transition count 119
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 94 place count 119 transition count 94
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 144 place count 94 transition count 94
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 148 place count 90 transition count 90
Iterating global reduction 2 with 4 rules applied. Total rules applied 152 place count 90 transition count 90
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 152 place count 90 transition count 88
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 156 place count 88 transition count 88
Performed 37 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 230 place count 51 transition count 50
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 252 place count 40 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 254 place count 38 transition count 57
Applied a total of 254 rules in 12 ms. Remains 38 /167 variables (removed 129) and now considering 57/167 (removed 110) transitions.
// Phase 1: matrix 57 rows 38 cols
[2022-05-20 18:42:15] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:15] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 57 rows 38 cols
[2022-05-20 18:42:15] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 18:42:16] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2022-05-20 18:42:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 57 rows 38 cols
[2022-05-20 18:42:16] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:16] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/167 places, 57/167 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/167 places, 57/167 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s30 1), p1:(AND (EQ s36 1) (EQ s11 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 623 steps with 5 reset in 7 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-12 finished in 265 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G(X(p1))&&X(p2)))))'
Support contains 3 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 158 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 158 transition count 158
Applied a total of 18 rules in 7 ms. Remains 158 /167 variables (removed 9) and now considering 158/167 (removed 9) transitions.
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:16] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 18:42:16] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:16] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:16] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:16] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:16] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/167 places, 158/167 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/167 places, 158/167 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-13 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: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(EQ s68 1), p1:(EQ s100 1), p2:(AND (EQ s68 1) (EQ s63 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-13 finished in 410 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((X(p0)||(G(p1)&&p2))))||X(p3)))'
Support contains 5 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 158 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 158 transition count 158
Applied a total of 18 rules in 4 ms. Remains 158 /167 variables (removed 9) and now considering 158/167 (removed 9) transitions.
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:16] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 18:42:16] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:16] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:16] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:16] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-20 18:42:16] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/167 places, 158/167 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/167 places, 158/167 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p3) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p2:(EQ s140 1), p3:(EQ s151 1), p1:(EQ s151 0), p0:(AND (EQ s52 1) (EQ s94 1) (EQ s120 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18675 steps with 0 reset in 48 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-14 finished in 543 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(G(X(p1)))))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 158 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 158 transition count 158
Applied a total of 18 rules in 7 ms. Remains 158 /167 variables (removed 9) and now considering 158/167 (removed 9) transitions.
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:17] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:17] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:17] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-20 18:42:17] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 158 cols
[2022-05-20 18:42:17] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 18:42:17] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/167 places, 158/167 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/167 places, 158/167 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s44 1) (EQ s119 1)), p1:(EQ s119 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, null][false, false, false]]
Stuttering criterion allowed to conclude after 14829 steps with 13 reset in 27 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-15 finished in 384 ms.
All properties solved by simple procedures.
Total runtime 13178 ms.

BK_STOP 1653072137628

--------------------
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-004B"
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-004B, 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-165286026000940"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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