fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r235-smll-162106564600205
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ShieldRVt-PT-002B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
338.867 17304.00 37081.00 385.90 FFTTFFTFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r235-smll-162106564600205.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 r235-smll-162106564600205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 18:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 18:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 24K May 5 16:52 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-00
FORMULA_NAME ShieldRVt-PT-002B-01
FORMULA_NAME ShieldRVt-PT-002B-02
FORMULA_NAME ShieldRVt-PT-002B-03
FORMULA_NAME ShieldRVt-PT-002B-04
FORMULA_NAME ShieldRVt-PT-002B-05
FORMULA_NAME ShieldRVt-PT-002B-06
FORMULA_NAME ShieldRVt-PT-002B-07
FORMULA_NAME ShieldRVt-PT-002B-08
FORMULA_NAME ShieldRVt-PT-002B-09
FORMULA_NAME ShieldRVt-PT-002B-10
FORMULA_NAME ShieldRVt-PT-002B-11
FORMULA_NAME ShieldRVt-PT-002B-12
FORMULA_NAME ShieldRVt-PT-002B-13
FORMULA_NAME ShieldRVt-PT-002B-14
FORMULA_NAME ShieldRVt-PT-002B-15

=== Now, execution of the tool begins

BK_START 1621240549989

Running Version 0
[2021-05-17 08:35:52] [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]
[2021-05-17 08:35:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 08:35:53] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2021-05-17 08:35:53] [INFO ] Transformed 103 places.
[2021-05-17 08:35:53] [INFO ] Transformed 103 transitions.
[2021-05-17 08:35:53] [INFO ] Found NUPN structural information;
[2021-05-17 08:35:53] [INFO ] Parsed PT model containing 103 places and 103 transitions in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 08:35:53] [INFO ] Initial state test concluded for 3 properties.
FORMULA ShieldRVt-PT-002B-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 103/103 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 90 transition count 90
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 90 transition count 90
Applied a total of 26 rules in 28 ms. Remains 90 /103 variables (removed 13) and now considering 90/103 (removed 13) transitions.
// Phase 1: matrix 90 rows 90 cols
[2021-05-17 08:35:53] [INFO ] Computed 9 place invariants in 24 ms
[2021-05-17 08:35:53] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 90 rows 90 cols
[2021-05-17 08:35:53] [INFO ] Computed 9 place invariants in 7 ms
[2021-05-17 08:35:53] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 90 cols
[2021-05-17 08:35:53] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 08:35:53] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Finished structural reductions, in 1 iterations. Remains : 90/103 places, 90/103 transitions.
[2021-05-17 08:35:54] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 08:35:54] [INFO ] Flatten gal took : 48 ms
FORMULA ShieldRVt-PT-002B-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 08:35:54] [INFO ] Flatten gal took : 17 ms
[2021-05-17 08:35:54] [INFO ] Input system was already deterministic with 90 transitions.
Finished random walk after 564 steps, including 0 resets, run visited all 24 properties in 16 ms. (steps per millisecond=35 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 90/90 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 89 transition count 64
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 64 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 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 53 place count 63 transition count 50
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 77 place count 51 transition count 50
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 46 transition count 45
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 46 transition count 45
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 46 transition count 42
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 43 transition count 42
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 26 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
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 133 place count 23 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 22 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 135 place count 21 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 20 transition count 24
Applied a total of 136 rules in 38 ms. Remains 20 /90 variables (removed 70) and now considering 24/90 (removed 66) transitions.
// Phase 1: matrix 24 rows 20 cols
[2021-05-17 08:35:54] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 08:35:54] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 24 rows 20 cols
[2021-05-17 08:35:54] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 08:35:54] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2021-05-17 08:35:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 20 cols
[2021-05-17 08:35:54] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 08:35:54] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/90 places, 24/90 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-002B-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s11 1), p1:(NEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-002B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-00 finished in 655 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 90/90 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 82 transition count 82
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 80
Applied a total of 20 rules in 34 ms. Remains 80 /90 variables (removed 10) and now considering 80/90 (removed 10) transitions.
// Phase 1: matrix 80 rows 80 cols
[2021-05-17 08:35:55] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 08:35:55] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 80 rows 80 cols
[2021-05-17 08:35:55] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 08:35:55] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 80 cols
[2021-05-17 08:35:55] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 08:35:55] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/90 places, 80/90 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-002B-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s42 1), p1:(OR (NEQ s52 1) (NEQ s21 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 48 reset in 549 ms.
Stack based approach found an accepted trace after 455 steps with 0 reset with depth 456 and stack size 456 in 3 ms.
FORMULA ShieldRVt-PT-002B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-01 finished in 1034 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 90/90 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 89 transition count 63
Reduce places removed 26 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 28 rules applied. Total rules applied 54 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 55 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 55 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 77 place count 51 transition count 50
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 47 transition count 46
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 47 transition count 46
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 85 place count 47 transition count 44
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 45 transition count 44
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 123 place count 28 transition count 27
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 131 place count 24 transition count 30
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 24 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 23 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 22 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 21 transition count 28
Applied a total of 135 rules in 36 ms. Remains 21 /90 variables (removed 69) and now considering 28/90 (removed 62) transitions.
// Phase 1: matrix 28 rows 21 cols
[2021-05-17 08:35:56] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 08:35:56] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 28 rows 21 cols
[2021-05-17 08:35:56] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 08:35:56] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2021-05-17 08:35:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 28 rows 21 cols
[2021-05-17 08:35:56] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 08:35:56] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/90 places, 28/90 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-002B-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s5 0) (EQ s17 1)), p1:(EQ s14 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]]
Product exploration explored 100000 steps with 29968 reset in 258 ms.
Product exploration explored 100000 steps with 29984 reset in 353 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 30030 reset in 158 ms.
Product exploration explored 100000 steps with 29937 reset in 239 ms.
[2021-05-17 08:35:57] [INFO ] Flatten gal took : 6 ms
[2021-05-17 08:35:57] [INFO ] Flatten gal took : 5 ms
[2021-05-17 08:35:57] [INFO ] Time to serialize gal into /tmp/LTL6803560847083084110.gal : 2 ms
[2021-05-17 08:35:57] [INFO ] Time to serialize properties into /tmp/LTL16115771663174920332.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6803560847083084110.gal, -t, CGAL, -LTL, /tmp/LTL16115771663174920332.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6803560847083084110.gal -t CGAL -LTL /tmp/LTL16115771663174920332.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((p25==0)&&(p87==1))"))||(G("(p81==1)"))))
Formula 0 simplified : !(F"((p25==0)&&(p87==1))" | G"(p81==1)")
Reverse transition relation is NOT exact ! Due to transitions t19, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/27/1/28
Computing Next relation with stutter on 8 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.04765,16700,1,0,59,1929,89,25,793,1280,90
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-002B-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVt-PT-002B-02 finished in 1647 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 90/90 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 89 transition count 64
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 64 transition count 62
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 55 place count 63 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 61 transition count 60
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 57 place count 61 transition count 48
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 81 place count 49 transition count 48
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 86 place count 44 transition count 43
Iterating global reduction 4 with 5 rules applied. Total rules applied 91 place count 44 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 91 place count 44 transition count 41
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 95 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 4 with 34 rules applied. Total rules applied 129 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 4 with 8 rules applied. Total rules applied 137 place count 21 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 20 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 19 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 18 transition count 24
Applied a total of 140 rules in 31 ms. Remains 18 /90 variables (removed 72) and now considering 24/90 (removed 66) transitions.
// Phase 1: matrix 24 rows 18 cols
[2021-05-17 08:35:57] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 08:35:57] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 24 rows 18 cols
[2021-05-17 08:35:57] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-17 08:35:57] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2021-05-17 08:35:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 24 rows 18 cols
[2021-05-17 08:35:57] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-17 08:35:57] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/90 places, 24/90 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-04 finished in 174 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 90/90 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 82 transition count 82
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 82 transition count 82
Applied a total of 16 rules in 7 ms. Remains 82 /90 variables (removed 8) and now considering 82/90 (removed 8) transitions.
// Phase 1: matrix 82 rows 82 cols
[2021-05-17 08:35:57] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 08:35:57] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 82 rows 82 cols
[2021-05-17 08:35:57] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 08:35:58] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 82 rows 82 cols
[2021-05-17 08:35:58] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 08:35:58] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/90 places, 82/90 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s73 1) (NEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 102 ms.
Product exploration explored 100000 steps with 25000 reset in 157 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 92 ms.
Product exploration explored 100000 steps with 25000 reset in 104 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 82 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 82/82 places, 82/82 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 82 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 82 transition count 81
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 22 place count 82 transition count 92
Deduced a syphon composed of 33 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 34 place count 82 transition count 92
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 78 transition count 88
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 78 transition count 88
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 62 place count 78 transition count 88
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 74 place count 66 transition count 76
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 66 transition count 76
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 92 place count 66 transition count 120
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 98 place count 60 transition count 108
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 60 transition count 108
Deduced a syphon composed of 37 places in 0 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 113 place count 60 transition count 99
Deduced a syphon composed of 37 places in 0 ms
Applied a total of 113 rules in 27 ms. Remains 60 /82 variables (removed 22) and now considering 99/82 (removed -17) transitions.
[2021-05-17 08:35:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 99 rows 60 cols
[2021-05-17 08:35:59] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 08:35:59] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/82 places, 99/82 transitions.
Product exploration explored 100000 steps with 25000 reset in 614 ms.
Product exploration explored 100000 steps with 25000 reset in 317 ms.
[2021-05-17 08:36:00] [INFO ] Flatten gal took : 8 ms
[2021-05-17 08:36:00] [INFO ] Flatten gal took : 7 ms
[2021-05-17 08:36:00] [INFO ] Time to serialize gal into /tmp/LTL6722060407523637296.gal : 3 ms
[2021-05-17 08:36:00] [INFO ] Time to serialize properties into /tmp/LTL10004589403025725298.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6722060407523637296.gal, -t, CGAL, -LTL, /tmp/LTL10004589403025725298.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6722060407523637296.gal -t CGAL -LTL /tmp/LTL10004589403025725298.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((p91!=1)&&(p68!=1))"))))))
Formula 0 simplified : !XXXF"((p91!=1)&&(p68!=1))"
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t17, t22, t26, t37, t42, t48, t53, t58, t69, t72, t76, t79, t84, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/66/16/82
Computing Next relation with stutter on 8 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
34 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.354318,22284,1,0,161,27853,190,88,2239,28462,183
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-002B-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVt-PT-002B-06 finished in 2968 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 90/90 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 89 transition count 63
Reduce places removed 26 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 28 rules applied. Total rules applied 54 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 55 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 55 place count 62 transition count 50
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 77 place count 51 transition count 50
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 47 transition count 46
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 47 transition count 46
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 85 place count 47 transition count 43
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 91 place count 44 transition count 43
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 127 place count 26 transition count 25
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 22 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 21 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 20 transition count 25
Applied a total of 137 rules in 31 ms. Remains 20 /90 variables (removed 70) and now considering 25/90 (removed 65) transitions.
// Phase 1: matrix 25 rows 20 cols
[2021-05-17 08:36:00] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 08:36:00] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 25 rows 20 cols
[2021-05-17 08:36:00] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 08:36:01] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2021-05-17 08:36:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 25 rows 20 cols
[2021-05-17 08:36:01] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 08:36:01] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/90 places, 25/90 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-002B-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(NEQ s9 1), p1:(NEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 5 ms.
FORMULA ShieldRVt-PT-002B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-08 finished in 365 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F((p0||(X(p2)&&p1))))||(p3&&F(p4)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 90/90 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 81 transition count 81
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 81 transition count 81
Applied a total of 18 rules in 13 ms. Remains 81 /90 variables (removed 9) and now considering 81/90 (removed 9) transitions.
// Phase 1: matrix 81 rows 81 cols
[2021-05-17 08:36:01] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 08:36:01] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 81 rows 81 cols
[2021-05-17 08:36:01] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 08:36:01] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 81 cols
[2021-05-17 08:36:01] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 08:36:01] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 1 iterations. Remains : 81/90 places, 81/90 transitions.
Stuttering acceptance computed with spot in 519 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p2) (NOT p4)), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4)))]
Running random walk in product with property : ShieldRVt-PT-002B-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND p3 (NOT p4)), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p0) p3 (NOT p4)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p4)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p4), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p4)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p4)), acceptance={} source=5 dest: 7}], [{ cond=(AND p1 (NOT p0) (NOT p4) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p2)), acceptance={0} source=6 dest: 7}], [{ cond=(AND p1 (NOT p0) (NOT p4)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p4)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s24 1) (EQ s38 1)), p0:(AND (EQ s24 1) (EQ s38 1) (EQ s31 1)), p3:(EQ s51 0), p4:(EQ s55 1), p2:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5161 reset in 184 ms.
Stack based approach found an accepted trace after 13040 steps with 666 reset with depth 36 and stack size 36 in 52 ms.
FORMULA ShieldRVt-PT-002B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-10 finished in 1095 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U (X(X(p1))||(F(p2)&&G(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 90/90 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 82 transition count 82
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 80
Applied a total of 20 rules in 8 ms. Remains 80 /90 variables (removed 10) and now considering 80/90 (removed 10) transitions.
// Phase 1: matrix 80 rows 80 cols
[2021-05-17 08:36:02] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 08:36:02] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 80 rows 80 cols
[2021-05-17 08:36:02] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 08:36:02] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 80 cols
[2021-05-17 08:36:02] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 08:36:02] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/90 places, 80/90 transitions.
Stuttering acceptance computed with spot in 402 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-002B-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s21 1), p2:(EQ s72 1), p1:(OR (EQ s25 1) (EQ s72 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], 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 46 steps with 12 reset in 1 ms.
FORMULA ShieldRVt-PT-002B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-12 finished in 677 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&(X((p1 U ((p1&&G(p2))||G(p1)))) U ((p3&&X((p1 U ((p1&&G(p2))||G(p1)))))||X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 90/90 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 82 transition count 82
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 80
Applied a total of 20 rules in 5 ms. Remains 80 /90 variables (removed 10) and now considering 80/90 (removed 10) transitions.
// Phase 1: matrix 80 rows 80 cols
[2021-05-17 08:36:03] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 08:36:03] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 80 rows 80 cols
[2021-05-17 08:36:03] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 08:36:03] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 80 cols
[2021-05-17 08:36:03] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 08:36:03] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/90 places, 80/90 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-002B-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s76 0), p3:(NEQ s76 1), p1:(NEQ s20 1), p2:(NEQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40 reset in 114 ms.
Product exploration explored 100000 steps with 45 reset in 166 ms.
Knowledge obtained : [p0, p3, p1, p2]
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 51 reset in 131 ms.
Product exploration explored 100000 steps with 44 reset in 223 ms.
Applying partial POR strategy [false, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 3 out of 80 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 80/80 places, 80/80 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 80 transition count 80
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 19 place count 80 transition count 94
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 28 place count 80 transition count 94
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 51 place count 80 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 80 transition count 94
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 67 place count 65 transition count 78
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 82 place count 65 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 63 transition count 76
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 63 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 63 transition count 109
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 95 place count 59 transition count 101
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 59 transition count 101
Deduced a syphon composed of 35 places in 0 ms
Applied a total of 99 rules in 15 ms. Remains 59 /80 variables (removed 21) and now considering 101/80 (removed -21) transitions.
[2021-05-17 08:36:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 101 rows 59 cols
[2021-05-17 08:36:05] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 08:36:05] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Finished structural reductions, in 1 iterations. Remains : 59/80 places, 101/80 transitions.
Entered a terminal (fully accepting) state of product in 5024 steps with 11 reset in 34 ms.
FORMULA ShieldRVt-PT-002B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-13 finished in 2357 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 90/90 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 89 transition count 65
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 65 transition count 65
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 65 transition count 53
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 72 place count 53 transition count 53
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 50 transition count 50
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 50 transition count 50
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 78 place count 50 transition count 48
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 48 transition count 48
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 2 with 36 rules applied. Total rules applied 118 place count 30 transition count 30
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 130 place count 24 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 23 transition count 34
Applied a total of 131 rules in 9 ms. Remains 23 /90 variables (removed 67) and now considering 34/90 (removed 56) transitions.
// Phase 1: matrix 34 rows 23 cols
[2021-05-17 08:36:05] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 08:36:05] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 34 rows 23 cols
[2021-05-17 08:36:05] [INFO ] Computed 9 place invariants in 5 ms
[2021-05-17 08:36:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-17 08:36:05] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2021-05-17 08:36:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 34 rows 23 cols
[2021-05-17 08:36:05] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 08:36:05] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/90 places, 34/90 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-002B-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s14 0) (AND (EQ s1 1) (EQ s8 1))), p1:(NEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-14 finished in 254 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p0||F(p1))&&(p0||X(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 90/90 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 81 transition count 81
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 79 transition count 79
Applied a total of 22 rules in 5 ms. Remains 79 /90 variables (removed 11) and now considering 79/90 (removed 11) transitions.
// Phase 1: matrix 79 rows 79 cols
[2021-05-17 08:36:05] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 08:36:05] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 79 rows 79 cols
[2021-05-17 08:36:05] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 08:36:05] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 79 rows 79 cols
[2021-05-17 08:36:05] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 08:36:05] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/90 places, 79/90 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-002B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s68 1), p1:(EQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 27593 steps with 237 reset in 131 ms.
FORMULA ShieldRVt-PT-002B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-15 finished in 432 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621240567293

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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 r235-smll-162106564600205"
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 ;