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

About the Execution of ITS-Tools for FlexibleBarrier-PT-22a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
263.380 13111.00 26664.00 322.10 FFFFFFFTFFFFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r102-smll-162075331200148.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-22a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331200148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 15K 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 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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.1K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 11:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 11:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 19:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 19:55 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 384K 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-22a-00
FORMULA_NAME FlexibleBarrier-PT-22a-01
FORMULA_NAME FlexibleBarrier-PT-22a-02
FORMULA_NAME FlexibleBarrier-PT-22a-03
FORMULA_NAME FlexibleBarrier-PT-22a-04
FORMULA_NAME FlexibleBarrier-PT-22a-05
FORMULA_NAME FlexibleBarrier-PT-22a-06
FORMULA_NAME FlexibleBarrier-PT-22a-07
FORMULA_NAME FlexibleBarrier-PT-22a-08
FORMULA_NAME FlexibleBarrier-PT-22a-09
FORMULA_NAME FlexibleBarrier-PT-22a-10
FORMULA_NAME FlexibleBarrier-PT-22a-11
FORMULA_NAME FlexibleBarrier-PT-22a-12
FORMULA_NAME FlexibleBarrier-PT-22a-13
FORMULA_NAME FlexibleBarrier-PT-22a-14
FORMULA_NAME FlexibleBarrier-PT-22a-15

=== Now, execution of the tool begins

BK_START 1621188296593

Running Version 0
[2021-05-16 18:04:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-16 18:04:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 18:04:59] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2021-05-16 18:04:59] [INFO ] Transformed 267 places.
[2021-05-16 18:04:59] [INFO ] Transformed 1258 transitions.
[2021-05-16 18:04:59] [INFO ] Found NUPN structural information;
[2021-05-16 18:04:59] [INFO ] Parsed PT model containing 267 places and 1258 transitions in 308 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 18:04:59] [INFO ] Initial state test concluded for 5 properties.
Ensure Unique test removed 442 transitions
Reduce redundant transitions removed 442 transitions.
FORMULA FlexibleBarrier-PT-22a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 267 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 267/267 places, 816/816 transitions.
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 267 transition count 794
Applied a total of 22 rules in 77 ms. Remains 267 /267 variables (removed 0) and now considering 794/816 (removed 22) transitions.
// Phase 1: matrix 794 rows 267 cols
[2021-05-16 18:05:00] [INFO ] Computed 24 place invariants in 22 ms
[2021-05-16 18:05:00] [INFO ] Implicit Places using invariants in 810 ms returned [265, 266]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 856 ms to find 2 implicit places.
// Phase 1: matrix 794 rows 265 cols
[2021-05-16 18:05:00] [INFO ] Computed 22 place invariants in 9 ms
[2021-05-16 18:05:01] [INFO ] Dead Transitions using invariants and state equation in 730 ms returned []
Starting structural reductions, iteration 1 : 265/267 places, 794/816 transitions.
Applied a total of 0 rules in 18 ms. Remains 265 /265 variables (removed 0) and now considering 794/794 (removed 0) transitions.
// Phase 1: matrix 794 rows 265 cols
[2021-05-16 18:05:01] [INFO ] Computed 22 place invariants in 4 ms
[2021-05-16 18:05:02] [INFO ] Dead Transitions using invariants and state equation in 657 ms returned []
Finished structural reductions, in 2 iterations. Remains : 265/267 places, 794/816 transitions.
[2021-05-16 18:05:02] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-16 18:05:02] [INFO ] Flatten gal took : 140 ms
FORMULA FlexibleBarrier-PT-22a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-22a-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 18:05:02] [INFO ] Flatten gal took : 69 ms
[2021-05-16 18:05:03] [INFO ] Input system was already deterministic with 794 transitions.
Finished random walk after 2753 steps, including 0 resets, run visited all 13 properties in 67 ms. (steps per millisecond=41 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X((G(p1) U (p2&&G(p1))))||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 265/265 places, 794/794 transitions.
Applied a total of 0 rules in 13 ms. Remains 265 /265 variables (removed 0) and now considering 794/794 (removed 0) transitions.
// Phase 1: matrix 794 rows 265 cols
[2021-05-16 18:05:03] [INFO ] Computed 22 place invariants in 5 ms
[2021-05-16 18:05:03] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 794 rows 265 cols
[2021-05-16 18:05:03] [INFO ] Computed 22 place invariants in 9 ms
[2021-05-16 18:05:03] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
// Phase 1: matrix 794 rows 265 cols
[2021-05-16 18:05:03] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-16 18:05:04] [INFO ] Dead Transitions using invariants and state equation in 642 ms returned []
Finished structural reductions, in 1 iterations. Remains : 265/265 places, 794/794 transitions.
Stuttering acceptance computed with spot in 442 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-22a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s148 1) (EQ s196 1)), p2:(OR (EQ s8 0) (EQ s148 1) (EQ s196 1)), p1:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 127 steps with 0 reset in 7 ms.
FORMULA FlexibleBarrier-PT-22a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-01 finished in 1743 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 265/265 places, 794/794 transitions.
Graph (trivial) has 344 edges and 265 vertex of which 246 / 265 are part of one of the 26 SCC in 5 ms
Free SCC test removed 220 places
Ensure Unique test removed 467 transitions
Reduce isomorphic transitions removed 467 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 280 transitions
Reduce isomorphic transitions removed 280 transitions.
Graph (trivial) has 30 edges and 25 vertex of which 2 / 25 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 304 rules applied. Total rules applied 305 place count 24 transition count 42
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 312 place count 20 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 313 place count 19 transition count 39
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 316 place count 16 transition count 33
Iterating global reduction 3 with 3 rules applied. Total rules applied 319 place count 16 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 326 place count 16 transition count 26
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 331 place count 12 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 332 place count 11 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 334 place count 10 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 335 place count 10 transition count 23
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 341 place count 10 transition count 17
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 7 with 3 rules applied. Total rules applied 344 place count 10 transition count 14
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 349 place count 7 transition count 12
Applied a total of 349 rules in 30 ms. Remains 7 /265 variables (removed 258) and now considering 12/794 (removed 782) transitions.
[2021-05-16 18:05:04] [INFO ] Flow matrix only has 8 transitions (discarded 4 similar events)
// Phase 1: matrix 8 rows 7 cols
[2021-05-16 18:05:04] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 18:05:04] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-16 18:05:04] [INFO ] Flow matrix only has 8 transitions (discarded 4 similar events)
// Phase 1: matrix 8 rows 7 cols
[2021-05-16 18:05:04] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 18:05:04] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-05-16 18:05:04] [INFO ] Redundant transitions in 13 ms returned [2, 3, 4, 5]
Found 4 redundant transitions using SMT.
Drop transitions removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions :[5, 4, 3, 2]
// Phase 1: matrix 8 rows 7 cols
[2021-05-16 18:05:04] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 18:05:05] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 7/265 places, 8/794 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 7 transition count 7
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 6 transition count 7
Applied a total of 2 rules in 2 ms. Remains 6 /7 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 6 cols
[2021-05-16 18:05:05] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-16 18:05:05] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-05-16 18:05:05] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 18:05:05] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/265 places, 7/794 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-22a-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (EQ s0 0) (EQ s4 1)), p1:(AND (NEQ s0 0) (NEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-04 finished in 259 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G((G(p1) U p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 265 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 265/265 places, 794/794 transitions.
Graph (trivial) has 340 edges and 265 vertex of which 251 / 265 are part of one of the 23 SCC in 1 ms
Free SCC test removed 228 places
Ensure Unique test removed 496 transitions
Reduce isomorphic transitions removed 496 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 258 transitions
Reduce isomorphic transitions removed 258 transitions.
Graph (trivial) has 17 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 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 278 rules applied. Total rules applied 279 place count 17 transition count 38
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 285 place count 16 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 286 place count 15 transition count 33
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 287 place count 14 transition count 31
Iterating global reduction 3 with 1 rules applied. Total rules applied 288 place count 14 transition count 31
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 290 place count 14 transition count 29
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 292 place count 13 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 293 place count 12 transition count 28
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 304 place count 12 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 305 place count 12 transition count 16
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 307 place count 11 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 309 place count 10 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 310 place count 10 transition count 13
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 312 place count 10 transition count 13
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 314 place count 8 transition count 11
Iterating global reduction 9 with 2 rules applied. Total rules applied 316 place count 8 transition count 11
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 318 place count 8 transition count 9
Applied a total of 318 rules in 21 ms. Remains 8 /265 variables (removed 257) and now considering 9/794 (removed 785) transitions.
// Phase 1: matrix 9 rows 8 cols
[2021-05-16 18:05:05] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 18:05:05] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-05-16 18:05:05] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-16 18:05:05] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-16 18:05:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-05-16 18:05:05] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-16 18:05:05] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/265 places, 9/794 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-22a-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(OR p2 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={1} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s2 1)), p2:(AND (EQ s7 0) (EQ s0 1)), p1:(OR (EQ s0 0) (EQ s7 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-05 finished in 316 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 265/265 places, 794/794 transitions.
Applied a total of 0 rules in 9 ms. Remains 265 /265 variables (removed 0) and now considering 794/794 (removed 0) transitions.
// Phase 1: matrix 794 rows 265 cols
[2021-05-16 18:05:05] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-16 18:05:05] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 794 rows 265 cols
[2021-05-16 18:05:05] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-16 18:05:05] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
// Phase 1: matrix 794 rows 265 cols
[2021-05-16 18:05:05] [INFO ] Computed 22 place invariants in 7 ms
[2021-05-16 18:05:06] [INFO ] Dead Transitions using invariants and state equation in 771 ms returned []
Finished structural reductions, in 1 iterations. Remains : 265/265 places, 794/794 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s64 0) (NEQ s42 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 1 ms.
FORMULA FlexibleBarrier-PT-22a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-06 finished in 1361 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 265/265 places, 794/794 transitions.
Applied a total of 0 rules in 6 ms. Remains 265 /265 variables (removed 0) and now considering 794/794 (removed 0) transitions.
// Phase 1: matrix 794 rows 265 cols
[2021-05-16 18:05:06] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-16 18:05:06] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 794 rows 265 cols
[2021-05-16 18:05:06] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-16 18:05:07] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
// Phase 1: matrix 794 rows 265 cols
[2021-05-16 18:05:07] [INFO ] Computed 22 place invariants in 4 ms
[2021-05-16 18:05:08] [INFO ] Dead Transitions using invariants and state equation in 820 ms returned []
Finished structural reductions, in 1 iterations. Remains : 265/265 places, 794/794 transitions.
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-08 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s258 0) (EQ s193 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 966 steps with 0 reset in 17 ms.
FORMULA FlexibleBarrier-PT-22a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-08 finished in 1530 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 265/265 places, 794/794 transitions.
Graph (trivial) has 347 edges and 265 vertex of which 261 / 265 are part of one of the 23 SCC in 1 ms
Free SCC test removed 238 places
Ensure Unique test removed 532 transitions
Reduce isomorphic transitions removed 532 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 249 transitions
Reduce isomorphic transitions removed 249 transitions.
Iterating post reduction 0 with 269 rules applied. Total rules applied 270 place count 6 transition count 12
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 274 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 274 place count 6 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 276 place count 5 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 278 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 279 place count 4 transition count 5
Applied a total of 279 rules in 7 ms. Remains 4 /265 variables (removed 261) and now considering 5/794 (removed 789) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 18:05:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 18:05:08] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 18:05:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 18:05:08] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-16 18:05:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 18:05:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 18:05:08] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/265 places, 5/794 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s2 0) (NEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-10 finished in 116 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 265/265 places, 794/794 transitions.
Graph (trivial) has 346 edges and 265 vertex of which 256 / 265 are part of one of the 24 SCC in 2 ms
Free SCC test removed 232 places
Ensure Unique test removed 524 transitions
Reduce isomorphic transitions removed 524 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 249 transitions
Reduce isomorphic transitions removed 249 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 0 with 270 rules applied. Total rules applied 271 place count 12 transition count 19
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 273 place count 11 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 10 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 274 place count 10 transition count 17
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 276 place count 9 transition count 17
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 277 place count 8 transition count 15
Iterating global reduction 3 with 1 rules applied. Total rules applied 278 place count 8 transition count 15
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 280 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 281 place count 7 transition count 13
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 285 place count 7 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 286 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 287 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 287 place count 6 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 289 place count 5 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 291 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 292 place count 4 transition count 5
Applied a total of 292 rules in 19 ms. Remains 4 /265 variables (removed 261) and now considering 5/794 (removed 789) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 18:05:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 18:05:08] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 18:05:08] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-16 18:05:08] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-16 18:05:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-16 18:05:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-16 18:05:08] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/265 places, 5/794 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s0 0) (NEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-22a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-14 finished in 114 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 265 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 265/265 places, 794/794 transitions.
Graph (trivial) has 350 edges and 265 vertex of which 257 / 265 are part of one of the 23 SCC in 1 ms
Free SCC test removed 234 places
Ensure Unique test removed 508 transitions
Reduce isomorphic transitions removed 508 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 270 transitions
Reduce isomorphic transitions removed 270 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 293 rules applied. Total rules applied 294 place count 9 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 296 place count 7 transition count 13
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 297 place count 6 transition count 11
Iterating global reduction 2 with 1 rules applied. Total rules applied 298 place count 6 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 301 place count 6 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 303 place count 4 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 305 place count 3 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 306 place count 3 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 307 place count 3 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 308 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 6 with 2 rules applied. Total rules applied 310 place count 2 transition count 3
Applied a total of 310 rules in 14 ms. Remains 2 /265 variables (removed 263) and now considering 3/794 (removed 791) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-16 18:05:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-16 18:05:08] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-16 18:05:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-16 18:05:08] [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-16 18:05:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-16 18:05:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-16 18:05:08] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/265 places, 3/794 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-22a-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-22a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-22a-15 finished in 156 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621188309704

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-22a"
export BK_EXAMINATION="LTLCardinality"
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-22a, examination is LTLCardinality"
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-162075331200148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-22a.tgz
mv FlexibleBarrier-PT-22a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;