Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905975000236.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
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 r421-tajo-167905975000236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 22:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 22:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 22:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 22:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 22:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 22:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 48K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1679170944977

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-004B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 20:22:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 20:22:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:22:26] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-18 20:22:26] [INFO ] Transformed 203 places.
[2023-03-18 20:22:26] [INFO ] Transformed 203 transitions.
[2023-03-18 20:22:26] [INFO ] Found NUPN structural information;
[2023-03-18 20:22:26] [INFO ] Parsed PT model containing 203 places and 203 transitions and 478 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-004B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 175 transition count 175
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 175 transition count 175
Applied a total of 56 rules in 38 ms. Remains 175 /203 variables (removed 28) and now considering 175/203 (removed 28) transitions.
// Phase 1: matrix 175 rows 175 cols
[2023-03-18 20:22:26] [INFO ] Computed 17 place invariants in 12 ms
[2023-03-18 20:22:27] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-18 20:22:27] [INFO ] Invariant cache hit.
[2023-03-18 20:22:27] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-18 20:22:27] [INFO ] Invariant cache hit.
[2023-03-18 20:22:27] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 175/203 places, 175/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 175/203 places, 175/203 transitions.
Support contains 35 out of 175 places after structural reductions.
[2023-03-18 20:22:27] [INFO ] Flatten gal took : 44 ms
[2023-03-18 20:22:27] [INFO ] Flatten gal took : 12 ms
[2023-03-18 20:22:27] [INFO ] Input system was already deterministic with 175 transitions.
Support contains 33 out of 175 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 31) seen :30
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 20:22:27] [INFO ] Invariant cache hit.
[2023-03-18 20:22:27] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:22:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-18 20:22:28] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:22:28] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 5 ms to minimize.
[2023-03-18 20:22:28] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2023-03-18 20:22:28] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 27 ms to minimize.
[2023-03-18 20:22:28] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2023-03-18 20:22:28] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2023-03-18 20:22:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 324 ms
[2023-03-18 20:22:28] [INFO ] After 411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 20:22:28] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 175/175 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 175 transition count 125
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 125 transition count 125
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 100 place count 125 transition count 103
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 144 place count 103 transition count 103
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 155 place count 92 transition count 92
Iterating global reduction 2 with 11 rules applied. Total rules applied 166 place count 92 transition count 92
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 166 place count 92 transition count 82
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 186 place count 82 transition count 82
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 254 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 255 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 257 place count 47 transition count 46
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 279 place count 36 transition count 54
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 280 place count 36 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 281 place count 35 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 282 place count 34 transition count 52
Applied a total of 282 rules in 29 ms. Remains 34 /175 variables (removed 141) and now considering 52/175 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 34/175 places, 52/175 transitions.
Finished random walk after 70 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=70 )
FORMULA ShieldRVt-PT-004B-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 55 stabilizing places and 55 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 175/175 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 161 transition count 161
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 159 transition count 159
Applied a total of 32 rules in 33 ms. Remains 159 /175 variables (removed 16) and now considering 159/175 (removed 16) transitions.
// Phase 1: matrix 159 rows 159 cols
[2023-03-18 20:22:28] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-18 20:22:28] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-18 20:22:28] [INFO ] Invariant cache hit.
[2023-03-18 20:22:29] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-18 20:22:29] [INFO ] Invariant cache hit.
[2023-03-18 20:22:29] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 159/175 places, 159/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 159/175 places, 159/175 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s62 1), p0:(OR (EQ s27 1) (NEQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4 reset in 296 ms.
Product exploration explored 100000 steps with 16 reset in 225 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Detected a total of 48/159 stabilizing places and 48/159 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 192 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2023-03-18 20:22:30] [INFO ] Invariant cache hit.
[2023-03-18 20:22:30] [INFO ] [Real]Absence check using 17 positive place invariants in 1 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 5 factoid took 127 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-004B-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-004B-LTLFireability-00 finished in 2181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 175/175 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 174 transition count 127
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 127 transition count 127
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 94 place count 127 transition count 103
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 142 place count 103 transition count 103
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 155 place count 90 transition count 90
Iterating global reduction 2 with 13 rules applied. Total rules applied 168 place count 90 transition count 90
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 168 place count 90 transition count 80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 188 place count 80 transition count 80
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 248 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 249 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 251 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 3 with 22 rules applied. Total rules applied 273 place count 38 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 275 place count 36 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 276 place count 35 transition count 56
Applied a total of 276 rules in 34 ms. Remains 35 /175 variables (removed 140) and now considering 56/175 (removed 119) transitions.
// Phase 1: matrix 56 rows 35 cols
[2023-03-18 20:22:31] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-18 20:22:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-18 20:22:31] [INFO ] Invariant cache hit.
[2023-03-18 20:22:31] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-18 20:22:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:22:31] [INFO ] Invariant cache hit.
[2023-03-18 20:22:31] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/175 places, 56/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 35/175 places, 56/175 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s11 0) (EQ s17 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-01 finished in 326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F((p0&&F(p1))))))))'
Support contains 1 out of 175 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 175/175 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 159 transition count 159
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 159 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 158 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 158 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 157 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 157 transition count 157
Applied a total of 36 rules in 7 ms. Remains 157 /175 variables (removed 18) and now considering 157/175 (removed 18) transitions.
// Phase 1: matrix 157 rows 157 cols
[2023-03-18 20:22:31] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-18 20:22:31] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-18 20:22:31] [INFO ] Invariant cache hit.
[2023-03-18 20:22:31] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-18 20:22:31] [INFO ] Invariant cache hit.
[2023-03-18 20:22:31] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/175 places, 157/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 157/175 places, 157/175 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s7 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 6850 reset in 357 ms.
Product exploration explored 100000 steps with 6759 reset in 158 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/157 stabilizing places and 46/157 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 284 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-18 20:22:32] [INFO ] Invariant cache hit.
[2023-03-18 20:22:32] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-18 20:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:22:32] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-18 20:22:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:22:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-18 20:22:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:22:33] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-18 20:22:33] [INFO ] Computed and/alt/rep : 156/229/156 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-18 20:22:33] [INFO ] Added : 144 causal constraints over 29 iterations in 367 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 157 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 : 157/157 places, 157/157 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 156 transition count 115
Reduce places removed 41 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 43 rules applied. Total rules applied 84 place count 115 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 113 transition count 113
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 86 place count 113 transition count 82
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 148 place count 82 transition count 82
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 210 place count 51 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 211 place count 51 transition count 50
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 213 place count 50 transition count 49
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 235 place count 39 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 37 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 238 place count 36 transition count 57
Applied a total of 238 rules in 37 ms. Remains 36 /157 variables (removed 121) and now considering 57/157 (removed 100) transitions.
// Phase 1: matrix 57 rows 36 cols
[2023-03-18 20:22:33] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-18 20:22:33] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-18 20:22:33] [INFO ] Invariant cache hit.
[2023-03-18 20:22:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 20:22:33] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-18 20:22:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:22:33] [INFO ] Invariant cache hit.
[2023-03-18 20:22:33] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/157 places, 57/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 36/157 places, 57/157 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/36 stabilizing places and 2/57 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2023-03-18 20:22:34] [INFO ] Invariant cache hit.
[2023-03-18 20:22:34] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-18 20:22:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:22:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-18 20:22:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:22:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-18 20:22:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:22:34] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-18 20:22:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 20:22:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-03-18 20:22:34] [INFO ] Computed and/alt/rep : 52/232/52 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 20:22:34] [INFO ] Added : 32 causal constraints over 7 iterations in 59 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-02 finished in 2938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0||X(p1)))||(p2&&(p3||F(G(p3)))))))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 175/175 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 162 transition count 162
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 162 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 161 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 160 transition count 160
Applied a total of 30 rules in 7 ms. Remains 160 /175 variables (removed 15) and now considering 160/175 (removed 15) transitions.
// Phase 1: matrix 160 rows 160 cols
[2023-03-18 20:22:34] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-18 20:22:34] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-18 20:22:34] [INFO ] Invariant cache hit.
[2023-03-18 20:22:34] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-18 20:22:34] [INFO ] Invariant cache hit.
[2023-03-18 20:22:34] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 160/175 places, 160/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 160/175 places, 160/175 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s121 0), p2:(EQ s57 1), p3:(EQ s36 1), p1:(EQ s114 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 237 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Detected a total of 48/160 stabilizing places and 48/160 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 8 factoid took 110 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-004B-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-004B-LTLFireability-04 finished in 971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X((p1||X(G(p2)))))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 175/175 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 160 transition count 160
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 159 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 158 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 158 transition count 158
Applied a total of 34 rules in 8 ms. Remains 158 /175 variables (removed 17) and now considering 158/175 (removed 17) transitions.
// Phase 1: matrix 158 rows 158 cols
[2023-03-18 20:22:35] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-18 20:22:35] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-18 20:22:35] [INFO ] Invariant cache hit.
[2023-03-18 20:22:35] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-18 20:22:35] [INFO ] Invariant cache hit.
[2023-03-18 20:22:35] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/175 places, 158/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 309 ms. Remains : 158/175 places, 158/175 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(EQ s18 1), p1:(EQ s146 0), p2:(EQ s86 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 149 ms.
Product exploration explored 100000 steps with 33333 reset in 161 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/158 stabilizing places and 46/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-004B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-004B-LTLFireability-05 finished in 896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 175/175 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 159 transition count 159
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 159 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 158 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 158 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 157 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 157 transition count 157
Applied a total of 36 rules in 6 ms. Remains 157 /175 variables (removed 18) and now considering 157/175 (removed 18) transitions.
// Phase 1: matrix 157 rows 157 cols
[2023-03-18 20:22:36] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-18 20:22:36] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-18 20:22:36] [INFO ] Invariant cache hit.
[2023-03-18 20:22:36] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-18 20:22:36] [INFO ] Invariant cache hit.
[2023-03-18 20:22:36] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/175 places, 157/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 157/175 places, 157/175 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s47 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 4804 reset in 173 ms.
Product exploration explored 100000 steps with 4806 reset in 140 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/157 stabilizing places and 46/157 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2023-03-18 20:22:37] [INFO ] Invariant cache hit.
[2023-03-18 20:22:37] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-18 20:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:22:37] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2023-03-18 20:22:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:22:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-18 20:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:22:37] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-18 20:22:37] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2023-03-18 20:22:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-18 20:22:37] [INFO ] Computed and/alt/rep : 156/229/156 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-18 20:22:37] [INFO ] Added : 146 causal constraints over 30 iterations in 308 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 157/157 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 156 transition count 114
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 114 transition count 114
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 84 place count 114 transition count 81
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 150 place count 81 transition count 81
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 214 place count 49 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 215 place count 49 transition count 48
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 217 place count 48 transition count 47
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 3 with 22 rules applied. Total rules applied 239 place count 37 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 35 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 242 place count 34 transition count 55
Applied a total of 242 rules in 20 ms. Remains 34 /157 variables (removed 123) and now considering 55/157 (removed 102) transitions.
// Phase 1: matrix 55 rows 34 cols
[2023-03-18 20:22:37] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-18 20:22:37] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-18 20:22:37] [INFO ] Invariant cache hit.
[2023-03-18 20:22:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 20:22:38] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-18 20:22:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:22:38] [INFO ] Invariant cache hit.
[2023-03-18 20:22:38] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/157 places, 55/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 34/157 places, 55/157 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/34 stabilizing places and 2/55 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-18 20:22:38] [INFO ] Invariant cache hit.
[2023-03-18 20:22:38] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-18 20:22:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:22:38] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-18 20:22:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:22:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-18 20:22:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:22:38] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-18 20:22:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 20:22:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-03-18 20:22:38] [INFO ] Computed and/alt/rep : 38/111/38 causal constraints (skipped 12 transitions) in 3 ms.
[2023-03-18 20:22:38] [INFO ] Added : 16 causal constraints over 4 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
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 2650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||(G(p1)&&X(F(p2)))))'
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 175/175 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 160 transition count 160
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 159 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 158 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 158 transition count 158
Applied a total of 34 rules in 6 ms. Remains 158 /175 variables (removed 17) and now considering 158/175 (removed 17) transitions.
// Phase 1: matrix 158 rows 158 cols
[2023-03-18 20:22:38] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-18 20:22:38] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-18 20:22:38] [INFO ] Invariant cache hit.
[2023-03-18 20:22:38] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-18 20:22:38] [INFO ] Invariant cache hit.
[2023-03-18 20:22:39] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/175 places, 158/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 158/175 places, 158/175 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}, { cond=p1, acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={} source=6 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND p1 p2), acceptance={} source=7 dest: 3}, { cond=(NOT p1), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=5, aps=[p1:(EQ s72 1), p2:(EQ s152 1), p0:(EQ s152 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 77 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 552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 175/175 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 174 transition count 125
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 125 transition count 125
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 98 place count 125 transition count 104
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 140 place count 104 transition count 104
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 153 place count 91 transition count 91
Iterating global reduction 2 with 13 rules applied. Total rules applied 166 place count 91 transition count 91
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 166 place count 91 transition count 79
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 190 place count 79 transition count 79
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 252 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 253 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 255 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 275 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 277 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 278 place count 34 transition count 53
Applied a total of 278 rules in 15 ms. Remains 34 /175 variables (removed 141) and now considering 53/175 (removed 122) transitions.
// Phase 1: matrix 53 rows 34 cols
[2023-03-18 20:22:39] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-18 20:22:39] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 20:22:39] [INFO ] Invariant cache hit.
[2023-03-18 20:22:39] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-18 20:22:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:22:39] [INFO ] Invariant cache hit.
[2023-03-18 20:22:39] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/175 places, 53/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 34/175 places, 53/175 transitions.
Stuttering acceptance computed with spot in 74 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 s33 0)], 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 10107 reset in 141 ms.
Stack based approach found an accepted trace after 3413 steps with 317 reset with depth 27 and stack size 23 in 6 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-08 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||G(p0)))))'
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 175/175 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 159 transition count 159
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 159 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 158 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 158 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 157 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 157 transition count 157
Applied a total of 36 rules in 5 ms. Remains 157 /175 variables (removed 18) and now considering 157/175 (removed 18) transitions.
// Phase 1: matrix 157 rows 157 cols
[2023-03-18 20:22:39] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-18 20:22:39] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-18 20:22:39] [INFO ] Invariant cache hit.
[2023-03-18 20:22:39] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-18 20:22:39] [INFO ] Invariant cache hit.
[2023-03-18 20:22:40] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/175 places, 157/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 157/175 places, 157/175 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NEQ s20 1) (NEQ s139 1)), p0:(NEQ s139 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]]
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/157 stabilizing places and 46/157 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (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 (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 8 factoid took 189 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-004B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-004B-LTLFireability-09 finished in 841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||G(F(p1))||(p2&&F(p1))))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 175/175 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 161 transition count 161
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 159 transition count 159
Applied a total of 32 rules in 7 ms. Remains 159 /175 variables (removed 16) and now considering 159/175 (removed 16) transitions.
// Phase 1: matrix 159 rows 159 cols
[2023-03-18 20:22:40] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-18 20:22:40] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-18 20:22:40] [INFO ] Invariant cache hit.
[2023-03-18 20:22:40] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-18 20:22:40] [INFO ] Invariant cache hit.
[2023-03-18 20:22:40] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 159/175 places, 159/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 159/175 places, 159/175 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), 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}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p2:(NEQ s58 1), p0:(EQ s50 1), p1:(NEQ s141 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Product exploration explored 100000 steps with 50000 reset in 123 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/159 stabilizing places and 47/159 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X p2), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 (NOT p0) p1)
Knowledge based reduction with 9 factoid took 284 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-004B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-004B-LTLFireability-10 finished in 927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 175/175 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 160 transition count 160
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 159 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 158 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 158 transition count 158
Applied a total of 34 rules in 4 ms. Remains 158 /175 variables (removed 17) and now considering 158/175 (removed 17) transitions.
// Phase 1: matrix 158 rows 158 cols
[2023-03-18 20:22:41] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-18 20:22:41] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-18 20:22:41] [INFO ] Invariant cache hit.
[2023-03-18 20:22:41] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-18 20:22:41] [INFO ] Invariant cache hit.
[2023-03-18 20:22:41] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/175 places, 158/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 158/175 places, 158/175 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-12 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 s36 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 0 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-12 finished in 337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(G(p2))))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 175/175 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 174 transition count 127
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 127 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 126 transition count 126
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 96 place count 126 transition count 104
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 140 place count 104 transition count 104
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 153 place count 91 transition count 91
Iterating global reduction 3 with 13 rules applied. Total rules applied 166 place count 91 transition count 91
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 166 place count 91 transition count 80
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 188 place count 80 transition count 80
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 244 place count 52 transition count 52
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 3 with 22 rules applied. Total rules applied 266 place count 41 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 268 place count 39 transition count 60
Applied a total of 268 rules in 13 ms. Remains 39 /175 variables (removed 136) and now considering 60/175 (removed 115) transitions.
// Phase 1: matrix 60 rows 39 cols
[2023-03-18 20:22:41] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-18 20:22:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 20:22:41] [INFO ] Invariant cache hit.
[2023-03-18 20:22:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 20:22:41] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-18 20:22:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:22:41] [INFO ] Invariant cache hit.
[2023-03-18 20:22:41] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/175 places, 60/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 39/175 places, 60/175 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s27 1), p1:(EQ s19 1), p2:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-13 finished in 312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 175/175 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 161 transition count 161
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 159 transition count 159
Applied a total of 32 rules in 5 ms. Remains 159 /175 variables (removed 16) and now considering 159/175 (removed 16) transitions.
// Phase 1: matrix 159 rows 159 cols
[2023-03-18 20:22:42] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-18 20:22:42] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-18 20:22:42] [INFO ] Invariant cache hit.
[2023-03-18 20:22:42] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-18 20:22:42] [INFO ] Invariant cache hit.
[2023-03-18 20:22:42] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 159/175 places, 159/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 159/175 places, 159/175 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(OR (EQ s78 1) (EQ s74 0)), p0:(EQ s74 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-14 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 175/175 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 161 transition count 161
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 159 transition count 159
Applied a total of 32 rules in 5 ms. Remains 159 /175 variables (removed 16) and now considering 159/175 (removed 16) transitions.
// Phase 1: matrix 159 rows 159 cols
[2023-03-18 20:22:42] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-18 20:22:42] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-18 20:22:42] [INFO ] Invariant cache hit.
[2023-03-18 20:22:42] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-18 20:22:42] [INFO ] Invariant cache hit.
[2023-03-18 20:22:42] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 159/175 places, 159/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 159/175 places, 159/175 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s88 0) (EQ s115 0) (NEQ s156 1)), p0:(NEQ s115 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]]
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Product exploration explored 100000 steps with 50000 reset in 120 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 : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 112 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-004B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-004B-LTLFireability-15 finished in 685 ms.
All properties solved by simple procedures.
Total runtime 16655 ms.

BK_STOP 1679170963423

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="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-5348"
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 r421-tajo-167905975000236"
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 ;