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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 7.4K Apr 30 00:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 30 00:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 00:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 00:30 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.6K May 9 09:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 09:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 24K 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-002B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653071407663

Running Version 202205111006
[2022-05-20 18:30:08] [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:30:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 18:30:09] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2022-05-20 18:30:09] [INFO ] Transformed 103 places.
[2022-05-20 18:30:09] [INFO ] Transformed 103 transitions.
[2022-05-20 18:30:09] [INFO ] Found NUPN structural information;
[2022-05-20 18:30:09] [INFO ] Parsed PT model containing 103 places and 103 transitions in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVt-PT-002B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 89 transition count 89
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 89 transition count 89
Applied a total of 28 rules in 16 ms. Remains 89 /103 variables (removed 14) and now considering 89/103 (removed 14) transitions.
// Phase 1: matrix 89 rows 89 cols
[2022-05-20 18:30:09] [INFO ] Computed 9 place invariants in 12 ms
[2022-05-20 18:30:09] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 89 rows 89 cols
[2022-05-20 18:30:09] [INFO ] Computed 9 place invariants in 4 ms
[2022-05-20 18:30:09] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
// Phase 1: matrix 89 rows 89 cols
[2022-05-20 18:30:09] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-20 18:30:09] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/103 places, 89/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/103 places, 89/103 transitions.
Support contains 35 out of 89 places after structural reductions.
[2022-05-20 18:30:09] [INFO ] Flatten gal took : 26 ms
[2022-05-20 18:30:09] [INFO ] Flatten gal took : 10 ms
[2022-05-20 18:30:09] [INFO ] Input system was already deterministic with 89 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 29) seen :28
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 89 rows 89 cols
[2022-05-20 18:30:09] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-20 18:30:09] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2022-05-20 18:30:09] [INFO ] After 30ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 18:30:09] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
[2022-05-20 18:30:10] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2022-05-20 18:30:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2022-05-20 18:30:10] [INFO ] After 118ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 18:30:10] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 18:30:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-20 18:30:10] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 18:30:10] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2022-05-20 18:30:10] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 2 ms to minimize.
[2022-05-20 18:30:10] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2022-05-20 18:30:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 106 ms
[2022-05-20 18:30:10] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-20 18:30:10] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 89/89 places, 89/89 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 89 transition count 65
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 65 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 64 transition count 63
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 51 place count 64 transition count 52
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 73 place count 53 transition count 52
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 78 place count 48 transition count 47
Iterating global reduction 3 with 5 rules applied. Total rules applied 83 place count 48 transition count 47
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 83 place count 48 transition count 44
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 89 place count 45 transition count 44
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 127 place count 26 transition count 25
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 137 place count 21 transition count 29
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 21 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 20 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 19 transition count 27
Applied a total of 140 rules in 35 ms. Remains 19 /89 variables (removed 70) and now considering 27/89 (removed 62) transitions.
Finished structural reductions, in 1 iterations. Remains : 19/89 places, 27/89 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Probably explored full state space saw : 386 states, properties seen :0
Probabilistic random walk after 2116 steps, saw 386 distinct states, run finished after 15 ms. (steps per millisecond=141 ) properties seen :0
Explored full state space saw : 386 states, properties seen :0
Exhaustive walk after 2116 steps, saw 386 distinct states, run finished after 4 ms. (steps per millisecond=529 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 25 stabilizing places and 25 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(X(G(p1))||(X(p2) U X(p3))))))'
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 89/89 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 81 transition count 81
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 80 transition count 80
Applied a total of 18 rules in 10 ms. Remains 80 /89 variables (removed 9) and now considering 80/89 (removed 9) transitions.
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:30:10] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:10] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:30:10] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:10] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:30:10] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:10] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 80/89 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/89 places, 80/89 transitions.
Stuttering acceptance computed with spot in 981 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p0 p1 (NOT p3)) (AND p1 (NOT p3) p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s22 0), p1:(EQ s48 1), p3:(EQ s25 1), p2:(EQ s22 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 4148 reset in 336 ms.
Stack based approach found an accepted trace after 50155 steps with 2060 reset with depth 43 and stack size 43 in 111 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-00 finished in 1658 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 89/89 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 81 transition count 81
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 80 transition count 80
Applied a total of 18 rules in 12 ms. Remains 80 /89 variables (removed 9) and now considering 80/89 (removed 9) transitions.
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:30:12] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:12] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:30:12] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:12] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:30:12] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:12] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 80/89 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/89 places, 80/89 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-01 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 s45 0) (EQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 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 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-002B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-002B-LTLFireability-01 finished in 640 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0)) U (X(p1)||G(p1)))))'
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 89/89 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 81 transition count 81
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 80 transition count 80
Applied a total of 18 rules in 16 ms. Remains 80 /89 variables (removed 9) and now considering 80/89 (removed 9) transitions.
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:30:12] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:13] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:30:13] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-20 18:30:13] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:30:13] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:13] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 80/89 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/89 places, 80/89 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s72 1), p0:(AND (EQ s2 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-02 finished in 382 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 89/89 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 80 transition count 80
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 79 transition count 79
Applied a total of 20 rules in 13 ms. Remains 79 /89 variables (removed 10) and now considering 79/89 (removed 10) transitions.
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:30:13] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-20 18:30:13] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:30:13] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:13] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:30:13] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:13] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/89 places, 79/89 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/89 places, 79/89 transitions.
Stuttering acceptance computed with spot in 349 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(EQ s13 0), p1:(EQ s41 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 105 ms.
Product exploration explored 100000 steps with 33333 reset in 210 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 7 states, 11 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-002B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-002B-LTLFireability-03 finished in 947 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 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 88 transition count 64
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 64 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 63 transition count 62
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 51 place count 63 transition count 50
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 75 place count 51 transition count 50
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 81 place count 45 transition count 44
Iterating global reduction 3 with 6 rules applied. Total rules applied 87 place count 45 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 87 place count 45 transition count 41
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 93 place count 42 transition count 41
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 127 place count 25 transition count 24
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 135 place count 21 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 19 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 18 transition count 24
Applied a total of 138 rules in 12 ms. Remains 18 /89 variables (removed 71) and now considering 24/89 (removed 65) transitions.
// Phase 1: matrix 24 rows 18 cols
[2022-05-20 18:30:14] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 18:30:14] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 24 rows 18 cols
[2022-05-20 18:30:14] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 18:30:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-20 18:30:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 18 cols
[2022-05-20 18:30:14] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 18:30:14] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/89 places, 24/89 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/89 places, 24/89 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-04 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 s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-04 finished in 189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F((F(p1)||G(p2)||p0))))))'
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 88 transition count 68
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 68 transition count 66
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 67 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 66 transition count 65
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 45 place count 66 transition count 53
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 69 place count 54 transition count 53
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 76 place count 47 transition count 46
Iterating global reduction 4 with 7 rules applied. Total rules applied 83 place count 47 transition count 46
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 83 place count 47 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 87 place count 45 transition count 44
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 113 place count 32 transition count 31
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 123 place count 27 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 25 transition count 33
Applied a total of 125 rules in 24 ms. Remains 25 /89 variables (removed 64) and now considering 33/89 (removed 56) transitions.
// Phase 1: matrix 33 rows 25 cols
[2022-05-20 18:30:14] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:14] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 33 rows 25 cols
[2022-05-20 18:30:14] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-20 18:30:14] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2022-05-20 18:30:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 33 rows 25 cols
[2022-05-20 18:30:14] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:14] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/89 places, 33/89 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/89 places, 33/89 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s15 1), p2:(AND (EQ s8 1) (EQ s11 1) (EQ s20 1)), p0:(OR (EQ s17 1) (EQ s13 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 10 steps with 2 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-07 finished in 216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(G(p0))||X(p1)||p0))))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 88 transition count 63
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 52 place count 63 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 62 transition count 61
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 53 place count 62 transition count 50
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 75 place count 51 transition count 50
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 81 place count 45 transition count 44
Iterating global reduction 3 with 6 rules applied. Total rules applied 87 place count 45 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 87 place count 45 transition count 41
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 93 place count 42 transition count 41
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 123 place count 27 transition count 26
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 133 place count 22 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 20 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 19 transition count 28
Applied a total of 136 rules in 15 ms. Remains 19 /89 variables (removed 70) and now considering 28/89 (removed 61) transitions.
// Phase 1: matrix 28 rows 19 cols
[2022-05-20 18:30:14] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 18:30:14] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 28 rows 19 cols
[2022-05-20 18:30:14] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 18:30:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 18:30:14] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2022-05-20 18:30:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 19 cols
[2022-05-20 18:30:14] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 18:30:14] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/89 places, 28/89 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/89 places, 28/89 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s13 1), p1:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-08 finished in 210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(G(F((G(F(G(p0)))&&G(p1)))))))))'
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 88 transition count 65
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 48 place count 65 transition count 63
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 64 transition count 61
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 53 place count 62 transition count 61
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 53 place count 62 transition count 49
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 77 place count 50 transition count 49
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 82 place count 45 transition count 44
Iterating global reduction 4 with 5 rules applied. Total rules applied 87 place count 45 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 87 place count 45 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 93 place count 42 transition count 41
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 123 place count 27 transition count 26
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 133 place count 22 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 21 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 135 place count 20 transition count 29
Applied a total of 135 rules in 11 ms. Remains 20 /89 variables (removed 69) and now considering 29/89 (removed 60) transitions.
// Phase 1: matrix 29 rows 20 cols
[2022-05-20 18:30:14] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 18:30:14] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 29 rows 20 cols
[2022-05-20 18:30:14] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 18:30:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-20 18:30:15] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-20 18:30:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 29 rows 20 cols
[2022-05-20 18:30:15] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 18:30:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/89 places, 29/89 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/89 places, 29/89 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s9 0), p0:(EQ s3 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-002B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-09 finished in 394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(((F(p2)&&p1)||p3))))'
Support contains 5 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 88 transition count 66
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 46 place count 66 transition count 64
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 65 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 64 transition count 63
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 49 place count 64 transition count 52
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 71 place count 53 transition count 52
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 75 place count 49 transition count 48
Iterating global reduction 4 with 4 rules applied. Total rules applied 79 place count 49 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 79 place count 49 transition count 47
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 81 place count 48 transition count 47
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 115 place count 31 transition count 30
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 125 place count 26 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 127 place count 24 transition count 32
Applied a total of 127 rules in 20 ms. Remains 24 /89 variables (removed 65) and now considering 32/89 (removed 57) transitions.
// Phase 1: matrix 32 rows 24 cols
[2022-05-20 18:30:15] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:15] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 32 rows 24 cols
[2022-05-20 18:30:15] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-20 18:30:15] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-20 18:30:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 24 cols
[2022-05-20 18:30:15] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:15] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/89 places, 32/89 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/89 places, 32/89 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p3:(EQ s5 1), p1:(AND (EQ s8 1) (EQ s12 1)), p2:(EQ s16 1), p0:(OR (EQ s21 1) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-11 finished in 302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 88 transition count 64
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 64 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 63 transition count 62
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 51 place count 63 transition count 51
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 73 place count 52 transition count 51
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 77 place count 48 transition count 47
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 48 transition count 47
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 81 place count 48 transition count 45
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 85 place count 46 transition count 45
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 121 place count 28 transition count 27
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 131 place count 23 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 21 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 20 transition count 29
Applied a total of 134 rules in 14 ms. Remains 20 /89 variables (removed 69) and now considering 29/89 (removed 60) transitions.
// Phase 1: matrix 29 rows 20 cols
[2022-05-20 18:30:15] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 18:30:15] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 29 rows 20 cols
[2022-05-20 18:30:15] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 18:30:15] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-20 18:30:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 29 rows 20 cols
[2022-05-20 18:30:15] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-20 18:30:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/89 places, 29/89 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/89 places, 29/89 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s6 1) (EQ s11 1)), p0:(AND (EQ s10 1) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-12 finished in 195 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 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 89/89 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 81 transition count 81
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 80 transition count 80
Applied a total of 18 rules in 6 ms. Remains 80 /89 variables (removed 9) and now considering 80/89 (removed 9) transitions.
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:30:15] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:15] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:30:15] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:15] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 80 cols
[2022-05-20 18:30:15] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:15] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/89 places, 80/89 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/89 places, 80/89 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-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: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s78 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 15 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-13 finished in 224 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p1)&&p0) U X((F(p3)&&p2))))'
Support contains 7 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 89/89 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 80 transition count 80
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 79 transition count 79
Applied a total of 20 rules in 7 ms. Remains 79 /89 variables (removed 10) and now considering 79/89 (removed 10) transitions.
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:30:16] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-20 18:30:16] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:30:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 18:30:16] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 79 rows 79 cols
[2022-05-20 18:30:16] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 18:30:16] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/89 places, 79/89 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/89 places, 79/89 transitions.
Stuttering acceptance computed with spot in 1184 ms :[(OR (NOT p3) (NOT p2)), true, (OR (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s53 1) (EQ s78 1)), p2:(AND (EQ s2 1) (EQ s29 1)), p3:(AND (EQ s76 1) (EQ s15 1)), p1:(EQ s76 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-14 finished in 1350 ms.
All properties solved by simple procedures.
Total runtime 8522 ms.

BK_STOP 1653071417449

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

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