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.r102-smll-162075331000037.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 FlexibleBarrier-PT-08a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331000037
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 11:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 11:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 19:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 19:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 64K May 5 16:51 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 FlexibleBarrier-PT-08a-00
FORMULA_NAME FlexibleBarrier-PT-08a-01
FORMULA_NAME FlexibleBarrier-PT-08a-02
FORMULA_NAME FlexibleBarrier-PT-08a-03
FORMULA_NAME FlexibleBarrier-PT-08a-04
FORMULA_NAME FlexibleBarrier-PT-08a-05
FORMULA_NAME FlexibleBarrier-PT-08a-06
FORMULA_NAME FlexibleBarrier-PT-08a-07
FORMULA_NAME FlexibleBarrier-PT-08a-08
FORMULA_NAME FlexibleBarrier-PT-08a-09
FORMULA_NAME FlexibleBarrier-PT-08a-10
FORMULA_NAME FlexibleBarrier-PT-08a-11
FORMULA_NAME FlexibleBarrier-PT-08a-12
FORMULA_NAME FlexibleBarrier-PT-08a-13
FORMULA_NAME FlexibleBarrier-PT-08a-14
FORMULA_NAME FlexibleBarrier-PT-08a-15

=== Now, execution of the tool begins

BK_START 1621120515857

Running Version 0
[2021-05-15 23:15:18] [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-15 23:15:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 23:15:18] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2021-05-15 23:15:19] [INFO ] Transformed 99 places.
[2021-05-15 23:15:19] [INFO ] Transformed 236 transitions.
[2021-05-15 23:15:19] [INFO ] Found NUPN structural information;
[2021-05-15 23:15:19] [INFO ] Parsed PT model containing 99 places and 236 transitions in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 23:15:19] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 50 transitions
Reduce redundant transitions removed 50 transitions.
FORMULA FlexibleBarrier-PT-08a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 186/186 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 99 transition count 178
Applied a total of 8 rules in 25 ms. Remains 99 /99 variables (removed 0) and now considering 178/186 (removed 8) transitions.
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:15:19] [INFO ] Computed 10 place invariants in 14 ms
[2021-05-15 23:15:19] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:15:19] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-15 23:15:19] [INFO ] State equation strengthened by 97 read => feed constraints.
[2021-05-15 23:15:19] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:15:19] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-15 23:15:20] [INFO ] Dead Transitions using invariants and state equation in 191 ms returned []
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 178/186 transitions.
[2021-05-15 23:15:20] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-15 23:15:20] [INFO ] Flatten gal took : 82 ms
FORMULA FlexibleBarrier-PT-08a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 23:15:20] [INFO ] Flatten gal took : 32 ms
[2021-05-15 23:15:20] [INFO ] Input system was already deterministic with 178 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 442 ms. (steps per millisecond=226 ) properties (out of 32) seen :31
Running SMT prover for 1 properties.
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:15:21] [INFO ] Computed 10 place invariants in 7 ms
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0&&F(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 8 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:15:21] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-15 23:15:21] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:15:21] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-15 23:15:21] [INFO ] State equation strengthened by 97 read => feed constraints.
[2021-05-15 23:15:21] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:15:21] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-15 23:15:21] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 178/178 transitions.
Stuttering acceptance computed with spot in 526 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08a-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (NEQ s71 1) (NEQ s84 1) (NEQ s97 1)), p1:(AND (EQ s45 1) (EQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 545 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 1 ms.
FORMULA FlexibleBarrier-PT-08a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-00 finished in 1681 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (F(p1)||G((p2&&F(p3))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 178/178 transitions.
Graph (trivial) has 72 edges and 99 vertex of which 18 / 99 are part of one of the 6 SCC in 6 ms
Free SCC test removed 12 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 47 place count 64 transition count 133
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 68 place count 64 transition count 112
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 64 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 63 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 63 transition count 111
Applied a total of 72 rules in 78 ms. Remains 63 /99 variables (removed 36) and now considering 111/178 (removed 67) transitions.
[2021-05-15 23:15:23] [INFO ] Flow matrix only has 84 transitions (discarded 27 similar events)
// Phase 1: matrix 84 rows 63 cols
[2021-05-15 23:15:23] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 23:15:23] [INFO ] Implicit Places using invariants in 50 ms returned []
[2021-05-15 23:15:23] [INFO ] Flow matrix only has 84 transitions (discarded 27 similar events)
// Phase 1: matrix 84 rows 63 cols
[2021-05-15 23:15:23] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 23:15:23] [INFO ] State equation strengthened by 63 read => feed constraints.
[2021-05-15 23:15:23] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2021-05-15 23:15:23] [INFO ] Redundant transitions in 51 ms returned [46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Found 12 redundant transitions using SMT.
Drop transitions removed 12 transitions
Redundant transitions reduction (with SMT) removed 12 transitions :[57, 56, 55, 54, 53, 52, 51, 50, 49, 48, 47, 46]
[2021-05-15 23:15:23] [INFO ] Flow matrix only has 83 transitions (discarded 16 similar events)
// Phase 1: matrix 83 rows 63 cols
[2021-05-15 23:15:23] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 23:15:23] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Starting structural reductions, iteration 1 : 63/99 places, 99/178 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 63 transition count 98
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 98
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 62 transition count 93
Applied a total of 7 rules in 26 ms. Remains 62 /63 variables (removed 1) and now considering 93/99 (removed 6) transitions.
[2021-05-15 23:15:23] [INFO ] Flow matrix only has 80 transitions (discarded 13 similar events)
// Phase 1: matrix 80 rows 62 cols
[2021-05-15 23:15:23] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 23:15:23] [INFO ] Implicit Places using invariants in 76 ms returned []
[2021-05-15 23:15:23] [INFO ] Flow matrix only has 80 transitions (discarded 13 similar events)
// Phase 1: matrix 80 rows 62 cols
[2021-05-15 23:15:23] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-15 23:15:23] [INFO ] State equation strengthened by 59 read => feed constraints.
[2021-05-15 23:15:23] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 62/99 places, 93/178 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-08a-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s7 1), p2:(EQ s11 1), p0:(AND (EQ s22 1) (EQ s60 1) (EQ s39 1) (EQ s61 1)), p3:(AND (EQ s39 1) (EQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-01 finished in 863 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(X((p1||F(p2))))&&p0) U X((G(p3) U p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:15:23] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 23:15:23] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:15:23] [INFO ] Computed 10 place invariants in 8 ms
[2021-05-15 23:15:23] [INFO ] State equation strengthened by 97 read => feed constraints.
[2021-05-15 23:15:24] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:15:24] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 23:15:24] [INFO ] Dead Transitions using invariants and state equation in 186 ms returned []
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 178/178 transitions.
Stuttering acceptance computed with spot in 415 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-08a-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) p3 (NOT p2)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND p3 (NOT p2)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(AND (EQ s42 1) (EQ s97 1)), p1:(EQ s20 1), p3:(OR (EQ s28 0) (EQ s98 0)), p2:(AND (EQ s42 1) (EQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 872 steps with 0 reset in 24 ms.
FORMULA FlexibleBarrier-PT-08a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-02 finished in 905 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((X(F(p0)) U (p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:15:24] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 23:15:24] [INFO ] Implicit Places using invariants in 121 ms returned [98]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 128 ms to find 1 implicit places.
// Phase 1: matrix 178 rows 98 cols
[2021-05-15 23:15:24] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-15 23:15:25] [INFO ] Dead Transitions using invariants and state equation in 149 ms returned []
Starting structural reductions, iteration 1 : 98/99 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 98 cols
[2021-05-15 23:15:25] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-15 23:15:25] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Finished structural reductions, in 2 iterations. Remains : 98/99 places, 178/178 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-08a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s72 1) (EQ s95 1) (EQ s97 1)), p2:(AND (EQ s60 1) (EQ s95 1) (EQ s97 1)), p0:(EQ s82 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3344 reset in 559 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA FlexibleBarrier-PT-08a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-03 finished in 1238 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&((p1&&F(p2))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 178/178 transitions.
Graph (trivial) has 72 edges and 99 vertex of which 18 / 99 are part of one of the 6 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 47 place count 64 transition count 133
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 62 place count 64 transition count 118
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 63 place count 64 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 64 place count 63 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 63 transition count 117
Applied a total of 65 rules in 31 ms. Remains 63 /99 variables (removed 36) and now considering 117/178 (removed 61) transitions.
[2021-05-15 23:15:25] [INFO ] Flow matrix only has 83 transitions (discarded 34 similar events)
// Phase 1: matrix 83 rows 63 cols
[2021-05-15 23:15:25] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 23:15:26] [INFO ] Implicit Places using invariants in 100 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
[2021-05-15 23:15:26] [INFO ] Redundant transitions in 171 ms returned [46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63]
Found 18 redundant transitions using SMT.
Drop transitions removed 18 transitions
Redundant transitions reduction (with SMT) removed 18 transitions :[63, 62, 61, 60, 59, 58, 57, 56, 55, 54, 53, 52, 51, 50, 49, 48, 47, 46]
[2021-05-15 23:15:26] [INFO ] Flow matrix only has 82 transitions (discarded 17 similar events)
// Phase 1: matrix 82 rows 62 cols
[2021-05-15 23:15:26] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-15 23:15:26] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Starting structural reductions, iteration 1 : 62/99 places, 99/178 transitions.
Graph (trivial) has 74 edges and 62 vertex of which 15 / 62 are part of one of the 5 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 52 transition count 72
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 45 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 44 transition count 71
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 17 place count 44 transition count 63
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 33 place count 36 transition count 63
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 51 place count 27 transition count 54
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 57 place count 27 transition count 48
Applied a total of 57 rules in 11 ms. Remains 27 /62 variables (removed 35) and now considering 48/99 (removed 51) transitions.
[2021-05-15 23:15:26] [INFO ] Flow matrix only has 34 transitions (discarded 14 similar events)
// Phase 1: matrix 34 rows 27 cols
[2021-05-15 23:15:26] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-15 23:15:26] [INFO ] Implicit Places using invariants in 96 ms returned []
[2021-05-15 23:15:26] [INFO ] Flow matrix only has 34 transitions (discarded 14 similar events)
// Phase 1: matrix 34 rows 27 cols
[2021-05-15 23:15:26] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-15 23:15:26] [INFO ] State equation strengthened by 11 read => feed constraints.
[2021-05-15 23:15:26] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 27/99 places, 48/178 transitions.
[2021-05-15 23:15:26] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-08a-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s11 1), p0:(AND (EQ s5 1) (EQ s13 1) (EQ s26 1)), p2:(NEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-04 finished in 899 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((p0||X(p0)))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:15:26] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-15 23:15:26] [INFO ] Implicit Places using invariants in 93 ms returned [98]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
// Phase 1: matrix 178 rows 98 cols
[2021-05-15 23:15:26] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-15 23:15:27] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Starting structural reductions, iteration 1 : 98/99 places, 178/178 transitions.
Applied a total of 0 rules in 15 ms. Remains 98 /98 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 98 cols
[2021-05-15 23:15:27] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-15 23:15:27] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Finished structural reductions, in 2 iterations. Remains : 98/99 places, 178/178 transitions.
Stuttering acceptance computed with spot in 332 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08a-05 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 4}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=2, aps=[p0:(AND (EQ s12 1) (EQ s59 1) (EQ s97 1)), p1:(AND (OR (NEQ s23 1) (NEQ s60 1) (NEQ s97 1)) (OR (NEQ s36 1) (NEQ s59 1) (NEQ s97 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-05 finished in 699 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0)) U p1))], workingDir=/home/mcc/execution]
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 178/178 transitions.
Graph (trivial) has 73 edges and 99 vertex of which 18 / 99 are part of one of the 6 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 47 place count 64 transition count 133
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 62 place count 64 transition count 118
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 63 place count 64 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 64 place count 63 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 63 transition count 117
Applied a total of 65 rules in 22 ms. Remains 63 /99 variables (removed 36) and now considering 117/178 (removed 61) transitions.
[2021-05-15 23:15:27] [INFO ] Flow matrix only has 84 transitions (discarded 33 similar events)
// Phase 1: matrix 84 rows 63 cols
[2021-05-15 23:15:27] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 23:15:27] [INFO ] Implicit Places using invariants in 65 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
[2021-05-15 23:15:27] [INFO ] Redundant transitions in 26 ms returned [45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 63, 64, 65, 66, 67, 68]
Found 18 redundant transitions using SMT.
Drop transitions removed 18 transitions
Redundant transitions reduction (with SMT) removed 18 transitions :[68, 67, 66, 65, 64, 63, 56, 55, 54, 53, 52, 51, 50, 49, 48, 47, 46, 45]
[2021-05-15 23:15:27] [INFO ] Flow matrix only has 83 transitions (discarded 16 similar events)
// Phase 1: matrix 83 rows 62 cols
[2021-05-15 23:15:27] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-15 23:15:27] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Starting structural reductions, iteration 1 : 62/99 places, 99/178 transitions.
Graph (trivial) has 76 edges and 62 vertex of which 18 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 50 transition count 67
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 42 transition count 67
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 17 place count 42 transition count 59
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 33 place count 34 transition count 59
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 24 transition count 49
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 60 place count 24 transition count 42
Applied a total of 60 rules in 8 ms. Remains 24 /62 variables (removed 38) and now considering 42/99 (removed 57) transitions.
[2021-05-15 23:15:27] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 24 cols
[2021-05-15 23:15:27] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-15 23:15:27] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-15 23:15:27] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 24 cols
[2021-05-15 23:15:27] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-15 23:15:27] [INFO ] State equation strengthened by 11 read => feed constraints.
[2021-05-15 23:15:27] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 24/99 places, 42/178 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-07 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s19 1) (EQ s23 1)), p0:(NEQ s16 0)], 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 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-07 finished in 401 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||X(X(F(p0)))) U p1))], workingDir=/home/mcc/execution]
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:15:27] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 23:15:27] [INFO ] Implicit Places using invariants in 71 ms returned [98]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
// Phase 1: matrix 178 rows 98 cols
[2021-05-15 23:15:28] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-15 23:15:28] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Starting structural reductions, iteration 1 : 98/99 places, 178/178 transitions.
Applied a total of 0 rules in 11 ms. Remains 98 /98 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 98 cols
[2021-05-15 23:15:28] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-15 23:15:28] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Finished structural reductions, in 2 iterations. Remains : 98/99 places, 178/178 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s1 1), p0:(AND (EQ s12 1) (EQ s23 1) (EQ s97 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2835 reset in 387 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 0 ms.
FORMULA FlexibleBarrier-PT-08a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-09 finished in 900 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 178/178 transitions.
Graph (trivial) has 68 edges and 99 vertex of which 12 / 99 are part of one of the 4 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 47 place count 68 transition count 144
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 53 place count 68 transition count 138
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 55 place count 68 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 57 place count 66 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 59 place count 66 transition count 136
Applied a total of 59 rules in 29 ms. Remains 66 /99 variables (removed 33) and now considering 136/178 (removed 42) transitions.
[2021-05-15 23:15:28] [INFO ] Flow matrix only has 100 transitions (discarded 36 similar events)
// Phase 1: matrix 100 rows 66 cols
[2021-05-15 23:15:28] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 23:15:28] [INFO ] Implicit Places using invariants in 103 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
[2021-05-15 23:15:29] [INFO ] Redundant transitions in 55 ms returned [48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87]
Found 28 redundant transitions using SMT.
Drop transitions removed 28 transitions
Redundant transitions reduction (with SMT) removed 28 transitions :[87, 86, 85, 84, 83, 82, 81, 80, 79, 78, 77, 76, 75, 74, 61, 60, 59, 58, 57, 56, 55, 54, 53, 52, 51, 50, 49, 48]
[2021-05-15 23:15:29] [INFO ] Flow matrix only has 94 transitions (discarded 14 similar events)
// Phase 1: matrix 94 rows 65 cols
[2021-05-15 23:15:29] [INFO ] Computed 9 place invariants in 8 ms
[2021-05-15 23:15:29] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Starting structural reductions, iteration 1 : 65/99 places, 108/178 transitions.
Graph (trivial) has 74 edges and 65 vertex of which 12 / 65 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 57 transition count 84
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 49 transition count 84
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 17 place count 49 transition count 76
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 33 place count 41 transition count 76
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
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 57 place count 29 transition count 64
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 29 transition count 59
Applied a total of 62 rules in 13 ms. Remains 29 /65 variables (removed 36) and now considering 59/108 (removed 49) transitions.
[2021-05-15 23:15:29] [INFO ] Flow matrix only has 45 transitions (discarded 14 similar events)
// Phase 1: matrix 45 rows 29 cols
[2021-05-15 23:15:29] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-15 23:15:29] [INFO ] Implicit Places using invariants in 29 ms returned []
[2021-05-15 23:15:29] [INFO ] Flow matrix only has 45 transitions (discarded 14 similar events)
// Phase 1: matrix 45 rows 29 cols
[2021-05-15 23:15:29] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-15 23:15:29] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-15 23:15:29] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 29/99 places, 59/178 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08a-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s19 1) (EQ s24 1) (EQ s28 1)) (EQ s9 1)), p1:(AND (EQ s7 1) (EQ s14 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-10 finished in 489 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 178/178 transitions.
Graph (trivial) has 77 edges and 99 vertex of which 21 / 99 are part of one of the 7 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 111 edges and 82 vertex of which 75 / 82 are part of one of the 9 SCC in 0 ms
Free SCC test removed 66 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 16 transition count 147
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Graph (trivial) has 10 edges and 8 vertex of which 2 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 143 rules applied. Total rules applied 148 place count 7 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 150 place count 6 transition count 12
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 5 transition count 10
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 5 transition count 10
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 3 with 2 rules applied. Total rules applied 154 place count 5 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 156 place count 4 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 157 place count 3 transition count 7
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 159 place count 3 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 160 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 162 place count 2 transition count 3
Applied a total of 162 rules in 9 ms. Remains 2 /99 variables (removed 97) and now considering 3/178 (removed 175) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-15 23:15:29] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-15 23:15:29] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-15 23:15:29] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-15 23:15:29] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2021-05-15 23:15:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-15 23:15:29] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-15 23:15:29] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/99 places, 3/178 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-11 finished in 151 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:15:29] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 23:15:29] [INFO ] Implicit Places using invariants in 121 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 123 ms to find 1 implicit places.
// Phase 1: matrix 178 rows 98 cols
[2021-05-15 23:15:29] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-15 23:15:29] [INFO ] Dead Transitions using invariants and state equation in 187 ms returned []
Starting structural reductions, iteration 1 : 98/99 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 98 cols
[2021-05-15 23:15:29] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-15 23:15:29] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 2 iterations. Remains : 98/99 places, 178/178 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : FlexibleBarrier-PT-08a-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s88 0) (EQ s97 0)), p1:(EQ s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-13 finished in 573 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 99 cols
[2021-05-15 23:15:30] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 23:15:30] [INFO ] Implicit Places using invariants in 126 ms returned [98]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
// Phase 1: matrix 178 rows 98 cols
[2021-05-15 23:15:30] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-15 23:15:30] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Starting structural reductions, iteration 1 : 98/99 places, 178/178 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 98 cols
[2021-05-15 23:15:30] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-15 23:15:30] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Finished structural reductions, in 2 iterations. Remains : 98/99 places, 178/178 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08a-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s60 1) (EQ s83 1) (EQ s97 1)) (AND (EQ s12 1) (EQ s35 1) (EQ s97 1))), p1:(AND (EQ s89 1) (EQ s12 1) (EQ s35 1) (EQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-14 finished in 497 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 178/178 transitions.
Graph (trivial) has 78 edges and 99 vertex of which 24 / 99 are part of one of the 8 SCC in 0 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 109 edges and 80 vertex of which 75 / 80 are part of one of the 9 SCC in 0 ms
Free SCC test removed 66 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 14 transition count 139
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 1 with 136 rules applied. Total rules applied 141 place count 6 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 143 place count 5 transition count 10
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 5 transition count 7
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 147 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 148 place count 4 transition count 6
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 149 place count 3 transition count 5
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 3 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 151 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 151 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 153 place count 2 transition count 3
Applied a total of 153 rules in 19 ms. Remains 2 /99 variables (removed 97) and now considering 3/178 (removed 175) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-15 23:15:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-15 23:15:30] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-15 23:15:30] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-15 23:15:30] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-15 23:15:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-15 23:15:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-15 23:15:30] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/99 places, 3/178 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-15 finished in 145 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621120531618

--------------------
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="FlexibleBarrier-PT-08a"
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 FlexibleBarrier-PT-08a, 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 r102-smll-162075331000037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-08a.tgz
mv FlexibleBarrier-PT-08a 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 ;