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-165286024600028.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 ShieldIIPs-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-165286024600028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 8.2K Apr 29 15:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 29 15:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:47 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 33K 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 ShieldIIPs-PT-002B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652908441756

Running Version 202205111006
[2022-05-18 21:14:02] [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-18 21:14:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 21:14:03] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2022-05-18 21:14:03] [INFO ] Transformed 123 places.
[2022-05-18 21:14:03] [INFO ] Transformed 121 transitions.
[2022-05-18 21:14:03] [INFO ] Found NUPN structural information;
[2022-05-18 21:14:03] [INFO ] Parsed PT model containing 123 places and 121 transitions in 162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldIIPs-PT-002B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 112 transition count 110
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 112 transition count 110
Applied a total of 22 rules in 18 ms. Remains 112 /123 variables (removed 11) and now considering 110/121 (removed 11) transitions.
// Phase 1: matrix 110 rows 112 cols
[2022-05-18 21:14:03] [INFO ] Computed 19 place invariants in 11 ms
[2022-05-18 21:14:03] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 110 rows 112 cols
[2022-05-18 21:14:03] [INFO ] Computed 19 place invariants in 7 ms
[2022-05-18 21:14:03] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 112 cols
[2022-05-18 21:14:03] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:03] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/123 places, 110/121 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/123 places, 110/121 transitions.
Support contains 35 out of 112 places after structural reductions.
[2022-05-18 21:14:03] [INFO ] Flatten gal took : 39 ms
[2022-05-18 21:14:03] [INFO ] Flatten gal took : 12 ms
[2022-05-18 21:14:03] [INFO ] Input system was already deterministic with 110 transitions.
Finished random walk after 835 steps, including 2 resets, run visited all 32 properties in 79 ms. (steps per millisecond=10 )
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(X(X((G(F(G((X(X(p1))&&p0))))||p2)))))'
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 106
Applied a total of 8 rules in 9 ms. Remains 108 /112 variables (removed 4) and now considering 106/110 (removed 4) transitions.
// Phase 1: matrix 106 rows 108 cols
[2022-05-18 21:14:04] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:04] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 106 rows 108 cols
[2022-05-18 21:14:04] [INFO ] Computed 19 place invariants in 10 ms
[2022-05-18 21:14:04] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
// Phase 1: matrix 106 rows 108 cols
[2022-05-18 21:14:04] [INFO ] Computed 19 place invariants in 3 ms
[2022-05-18 21:14:04] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 106/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/112 places, 106/110 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s19 1) (EQ s35 1)), p1:(EQ s99 1), p2:(EQ s99 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 223 ms.
Product exploration explored 100000 steps with 33333 reset in 126 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/108 stabilizing places and 23/106 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1) p2)
Knowledge based reduction with 5 factoid took 345 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-002B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-00 finished in 1295 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((G(p0)&&p1))||X(p2)))))'
Support contains 7 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 112 transition count 104
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 106 transition count 104
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 12 place count 106 transition count 94
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 32 place count 96 transition count 94
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 92 transition count 90
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 92 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 40 place count 92 transition count 89
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 91 transition count 89
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 112 place count 56 transition count 54
Applied a total of 112 rules in 29 ms. Remains 56 /112 variables (removed 56) and now considering 54/110 (removed 56) transitions.
// Phase 1: matrix 54 rows 56 cols
[2022-05-18 21:14:05] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 21:14:05] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 54 rows 56 cols
[2022-05-18 21:14:05] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:05] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2022-05-18 21:14:05] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 54 rows 56 cols
[2022-05-18 21:14:05] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:05] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/112 places, 54/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 56/112 places, 54/110 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 (NOT p1)) (AND p2 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s13 0) (EQ s24 0) (EQ s29 0)), p0:(AND (EQ s40 1) (EQ s50 1) (EQ s55 1)), p2:(EQ s0 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-01 finished in 376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(X((G(p1) U p1)))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 106
Applied a total of 8 rules in 11 ms. Remains 108 /112 variables (removed 4) and now considering 106/110 (removed 4) transitions.
// Phase 1: matrix 106 rows 108 cols
[2022-05-18 21:14:06] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:06] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 106 rows 108 cols
[2022-05-18 21:14:06] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:06] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 106 rows 108 cols
[2022-05-18 21:14:06] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:06] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 106/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/112 places, 106/110 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s62 1), p0:(AND (EQ s25 1) (EQ s35 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-02 finished in 340 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1 U p2)))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 111 transition count 100
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 102 transition count 100
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 18 place count 102 transition count 89
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 40 place count 91 transition count 89
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 87 transition count 85
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 87 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 48 place count 87 transition count 84
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 86 transition count 84
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 114 place count 54 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 52 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 51 transition count 50
Applied a total of 117 rules in 22 ms. Remains 51 /112 variables (removed 61) and now considering 50/110 (removed 60) transitions.
// Phase 1: matrix 50 rows 51 cols
[2022-05-18 21:14:06] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-18 21:14:06] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 50 rows 51 cols
[2022-05-18 21:14:06] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-18 21:14:06] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2022-05-18 21:14:06] [INFO ] Redundant transitions in 15 ms returned [49]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 49 rows 51 cols
[2022-05-18 21:14:06] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-18 21:14:06] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/112 places, 49/110 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 51/112 places, 49/110 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s5 1) (EQ s11 1)), p0:(EQ s5 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 7276 steps with 161 reset in 19 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-07 finished in 281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1 U !(G(X(p2))&&p3))))'
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 107
Applied a total of 6 rules in 6 ms. Remains 109 /112 variables (removed 3) and now considering 107/110 (removed 3) transitions.
// Phase 1: matrix 107 rows 109 cols
[2022-05-18 21:14:06] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:06] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 107 rows 109 cols
[2022-05-18 21:14:06] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 21:14:06] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 109 cols
[2022-05-18 21:14:06] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:06] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 107/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/112 places, 107/110 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND p2 p3), (OR (AND (NOT p0) p2) (AND p2 p3)), (AND p2 p3), (AND p2 p3), p2]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p3 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p3 p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p3 (NOT p1) p0 p2), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p1 p0 p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND p3 (NOT p1) p0 p2), acceptance={0} source=2 dest: 1}, { cond=(AND p3 p1 p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p3 p1 (NOT p0) p2), acceptance={0} source=2 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 4}], [{ cond=(AND p3 p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p3 (NOT p1) p2), acceptance={0} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(NEQ s81 1), p1:(EQ s69 1), p0:(AND (NEQ s69 1) (EQ s28 1) (EQ s44 1) (EQ s55 1)), p2:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/109 stabilizing places and 24/107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p3 p1 p0 p2))), (X (NOT (AND p3 (NOT p1) p0 p2))), (X (NOT (AND p3 p1 (NOT p0) p2))), (X (NOT (AND p3 (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND p3 p1 p0 p2)))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p1) p0 p2)))), (X (X (NOT (AND p3 p1 (NOT p0) p2)))), (X (X (NOT (AND p3 p1 p2)))), (X (X (NOT (AND p3 (NOT p1) p2)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p2)))
Knowledge based reduction with 16 factoid took 400 ms. Reduced automaton from 5 states, 12 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-002B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-08 finished in 1242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(G(X(G(p0)))))||F(p1)))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 107
Applied a total of 6 rules in 4 ms. Remains 109 /112 variables (removed 3) and now considering 107/110 (removed 3) transitions.
// Phase 1: matrix 107 rows 109 cols
[2022-05-18 21:14:07] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:08] [INFO ] Implicit Places using invariants in 404 ms returned []
// Phase 1: matrix 107 rows 109 cols
[2022-05-18 21:14:08] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:08] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 109 cols
[2022-05-18 21:14:08] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-18 21:14:08] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 107/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/112 places, 107/110 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s58 1), p0:(EQ s85 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 346 steps with 1 reset in 2 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-09 finished in 868 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((!p0 U F(((p0 U F(p0))&&p1))) U p2))'
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 111 transition count 103
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 105 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 104 transition count 102
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 14 place count 104 transition count 92
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 34 place count 94 transition count 92
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 37 place count 91 transition count 89
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 91 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 40 place count 91 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 90 transition count 88
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 108 place count 57 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 55 transition count 53
Applied a total of 110 rules in 20 ms. Remains 55 /112 variables (removed 57) and now considering 53/110 (removed 57) transitions.
// Phase 1: matrix 53 rows 55 cols
[2022-05-18 21:14:08] [INFO ] Computed 19 place invariants in 7 ms
[2022-05-18 21:14:08] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 53 rows 55 cols
[2022-05-18 21:14:08] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:08] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2022-05-18 21:14:08] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 53 rows 55 cols
[2022-05-18 21:14:08] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 21:14:08] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/112 places, 53/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/112 places, 53/110 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, p2, (AND p0 p2), p0, (AND p2 p1 p0), (AND p0 p1)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 p0 p2), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(OR (AND (EQ s39 1) (EQ s47 1) (EQ s54 1)) (EQ s48 1)), p1:(AND (EQ s33 1) (EQ s35 1)), p0:(AND (EQ s10 1) (EQ s17 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 167 steps with 1 reset in 1 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-10 finished in 479 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(X((F(p0)||p1)))))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 111 transition count 100
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 102 transition count 100
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 18 place count 102 transition count 89
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 40 place count 91 transition count 89
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 87 transition count 85
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 87 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 48 place count 87 transition count 84
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 86 transition count 84
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 116 place count 53 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 52 transition count 50
Applied a total of 117 rules in 16 ms. Remains 52 /112 variables (removed 60) and now considering 50/110 (removed 60) transitions.
// Phase 1: matrix 50 rows 52 cols
[2022-05-18 21:14:09] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 21:14:09] [INFO ] Implicit Places using invariants in 75 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/112 places, 50/110 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 51/112 places, 50/110 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s28 0), p0:(EQ s16 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 757 reset in 308 ms.
Product exploration explored 100000 steps with 755 reset in 238 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/51 stabilizing places and 2/50 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 273 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 74 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 51 cols
[2022-05-18 21:14:10] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-18 21:14:10] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 21:14:10] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2022-05-18 21:14:10] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 21:14:10] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-18 21:14:10] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 51/51 places, 50/50 transitions.
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 51 transition count 50
Applied a total of 10 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 50/50 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2938504 steps, run timeout after 3001 ms. (steps per millisecond=979 ) properties seen :{}
Probabilistic random walk after 2938504 steps, saw 545803 distinct states, run finished after 3002 ms. (steps per millisecond=978 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 51 cols
[2022-05-18 21:14:13] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-18 21:14:13] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 21:14:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2022-05-18 21:14:13] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 21:14:13] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2022-05-18 21:14:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-05-18 21:14:13] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-18 21:14:13] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 51/51 places, 50/50 transitions.
Applied a total of 0 rules in 5 ms. Remains 51 /51 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 50/50 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 51/51 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 51 cols
[2022-05-18 21:14:13] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-18 21:14:13] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 50 rows 51 cols
[2022-05-18 21:14:13] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-18 21:14:13] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2022-05-18 21:14:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 51 cols
[2022-05-18 21:14:14] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-18 21:14:14] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 51 cols
[2022-05-18 21:14:14] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-18 21:14:14] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 21:14:14] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2022-05-18 21:14:14] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 21:14:14] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2022-05-18 21:14:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-18 21:14:14] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-18 21:14:14] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 21:14:14] [INFO ] Flatten gal took : 9 ms
[2022-05-18 21:14:14] [INFO ] Flatten gal took : 5 ms
[2022-05-18 21:14:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2941364481947000437.gal : 10 ms
[2022-05-18 21:14:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16159043138886840795.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms8873022726213053658;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2941364481947000437.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16159043138886840795.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality16159043138886840795.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 108
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :108 after 277
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2613 after 6363
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6363 after 7799
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :49579 after 104137
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :104137 after 332086
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.34742e+06 after 3.83484e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.25912e+07,0.330959,15620,2,2910,19,44249,7,0,259,80102,0
Total reachable state count : 12591176

Verifying 1 reachability properties.
Reachability property apf0 does not hold.
No reachable states exhibit your property : apf0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,0,0.33404,15620,1,0,19,44249,7,0,261,80102,0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 162 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-002B-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-11 finished in 5621 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(F(p0) U (G((p1 U p0))&&p1))&&X(p2))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 106
Applied a total of 8 rules in 7 ms. Remains 108 /112 variables (removed 4) and now considering 106/110 (removed 4) transitions.
// Phase 1: matrix 106 rows 108 cols
[2022-05-18 21:14:14] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:14] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 106 rows 108 cols
[2022-05-18 21:14:14] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-18 21:14:14] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 106 rows 108 cols
[2022-05-18 21:14:14] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:15] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 106/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/112 places, 106/110 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p2) (AND p0 p1)), p0, (NOT p2), true]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s48 1), p0:(EQ s59 1), p2:(EQ s48 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 27 steps with 6 reset in 1 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-12 finished in 325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))||p1||((p2 U p3)&&p0))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 107
Applied a total of 6 rules in 7 ms. Remains 109 /112 variables (removed 3) and now considering 107/110 (removed 3) transitions.
// Phase 1: matrix 107 rows 109 cols
[2022-05-18 21:14:15] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 21:14:15] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 107 rows 109 cols
[2022-05-18 21:14:15] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:15] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 109 cols
[2022-05-18 21:14:15] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 21:14:15] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 107/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/112 places, 107/110 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(EQ s89 1), p2:(EQ s27 1), p1:(EQ s27 0), p0:(OR (EQ s71 0) (EQ s86 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) p1 p0), (X (NOT (AND (NOT p1) p0 (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND p0 (NOT p3) (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p2)))))
Knowledge based reduction with 8 factoid took 161 ms. Reduced automaton from 6 states, 12 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-002B-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-14 finished in 823 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(G(p0))&&G((G(p0)&&p1)))) U G(X(X(p2)))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 106
Applied a total of 8 rules in 7 ms. Remains 108 /112 variables (removed 4) and now considering 106/110 (removed 4) transitions.
// Phase 1: matrix 106 rows 108 cols
[2022-05-18 21:14:15] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 21:14:16] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 106 rows 108 cols
[2022-05-18 21:14:16] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-18 21:14:16] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
// Phase 1: matrix 106 rows 108 cols
[2022-05-18 21:14:16] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-18 21:14:16] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 106/110 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/112 places, 106/110 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s21 1) (EQ s45 1)), p0:(AND (EQ s73 1) (EQ s97 1)), p1:(AND (EQ s21 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 328 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-15 finished in 377 ms.
All properties solved by simple procedures.
Total runtime 13450 ms.

BK_STOP 1652908456414

--------------------
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="ShieldIIPs-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 ShieldIIPs-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-165286024600028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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