Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683762000855.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldRVs-PT-050A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762000855
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 320K May 18 16:43 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 ShieldRVs-PT-050A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717270892147

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:41:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 19:41:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:41:33] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2024-06-01 19:41:33] [INFO ] Transformed 703 places.
[2024-06-01 19:41:33] [INFO ] Transformed 953 transitions.
[2024-06-01 19:41:33] [INFO ] Found NUPN structural information;
[2024-06-01 19:41:33] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (59 resets) in 1594 ms. (25 steps per ms) remains 5/16 properties
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 744 ms. (53 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1252 ms. (31 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 4/5 properties
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 953 rows 703 cols
[2024-06-01 19:41:35] [INFO ] Computed 201 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 223/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 332/555 variables, 150/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/555 variables, 332/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 148/703 variables, 51/756 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 148/904 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 953/1656 variables, 703/1607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1656 variables, 0/1607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1656 variables, 0/1607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1656/1656 variables, and 1607 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1232 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 703/703 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 223/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 332/555 variables, 150/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/555 variables, 332/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:41:36] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 11 ms to minimize.
[2024-06-01 19:41:36] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:41:37] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:41:37] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:41:37] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:41:37] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:41:37] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:41:37] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 8/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 148/703 variables, 51/764 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 148/912 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:41:37] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:41:37] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:41:37] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:41:37] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:41:37] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:41:37] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-06-01 19:41:37] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:41:38] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:41:38] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 9/921 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:41:38] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 1/922 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/703 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 953/1656 variables, 703/1625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1656 variables, 4/1629 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:41:39] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:41:40] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-06-01 19:41:40] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:41:40] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:41:40] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:41:40] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 19:41:40] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:41:41] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1656 variables, 8/1637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1656/1656 variables, and 1637 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5013 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 703/703 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 26/26 constraints]
After SMT, in 6616ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 223 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 59 times.
Drop transitions (Partial Free agglomeration) removed 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 61 place count 702 transition count 952
Applied a total of 61 rules in 140 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 702/703 places, 952/953 transitions.
RANDOM walk for 40000 steps (63 resets) in 634 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 177958 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 4
Probabilistic random walk after 177958 steps, saw 41087 distinct states, run finished after 3005 ms. (steps per millisecond=59 ) properties seen :0
// Phase 1: matrix 952 rows 702 cols
[2024-06-01 19:41:45] [INFO ] Computed 201 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 223/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 332/555 variables, 150/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/555 variables, 332/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 147/702 variables, 51/756 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 147/903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 952/1654 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 1605 constraints, problems are : Problem set: 0 solved, 4 unsolved in 846 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 223/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 332/555 variables, 150/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/555 variables, 332/705 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:41:46] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:41:46] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:41:46] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:41:46] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:41:46] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:41:46] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 6/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:41:46] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:41:46] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 2/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 147/702 variables, 51/766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 147/913 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/702 variables, 11/924 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/702 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 952/1654 variables, 702/1626 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1654 variables, 4/1630 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:41:49] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:41:49] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:41:49] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2024-06-01 19:41:50] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 2 ms to minimize.
[2024-06-01 19:41:50] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:41:50] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:41:50] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:41:50] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-06-01 19:41:51] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 2 ms to minimize.
[2024-06-01 19:41:51] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:41:51] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1654 variables, 11/1641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:41:52] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1654 variables, 1/1642 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1654 variables, 0/1642 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1654 variables, 0/1642 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 1642 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8847 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 33/33 constraints]
After SMT, in 9833ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 3821 ms.
Support contains 202 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 67 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 702/702 places, 952/952 transitions.
RANDOM walk for 40000 steps (64 resets) in 405 ms. (98 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 319 ms. (125 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 199558 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 3
Probabilistic random walk after 199558 steps, saw 45862 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 952 rows 702 cols
[2024-06-01 19:42:02] [INFO ] Computed 201 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 317/519 variables, 140/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 317/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 183/702 variables, 61/720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 183/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 952/1654 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 1605 constraints, problems are : Problem set: 0 solved, 3 unsolved in 675 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 202/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 317/519 variables, 140/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 317/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:42:03] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:42:03] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 183/702 variables, 61/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 183/905 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:42:03] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:42:03] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:42:03] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:42:03] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:42:04] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:42:04] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:42:04] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2024-06-01 19:42:04] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:42:04] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 9/914 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:42:04] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:42:04] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 2/916 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 952/1654 variables, 702/1618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1654 variables, 3/1621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:42:05] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:42:06] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:42:06] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:42:06] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:42:06] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:42:06] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:42:06] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:42:07] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:42:07] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:42:07] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-06-01 19:42:07] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:42:07] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-06-01 19:42:08] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:42:08] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:42:08] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1654 variables, 15/1636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1654 variables, 0/1636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1654 variables, 0/1636 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 1636 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6943 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 28/28 constraints]
After SMT, in 7734ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 8648 ms.
Support contains 202 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 35 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 22 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2024-06-01 19:42:18] [INFO ] Invariant cache hit.
[2024-06-01 19:42:19] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-06-01 19:42:19] [INFO ] Invariant cache hit.
[2024-06-01 19:42:20] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
[2024-06-01 19:42:20] [INFO ] Redundant transitions in 179 ms returned []
Running 951 sub problems to find dead transitions.
[2024-06-01 19:42:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 701/701 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 2 (OVERLAPS) 1/702 variables, 201/902 constraints. Problems are: Problem set: 0 solved, 951 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 951 unsolved
[2024-06-01 19:42:49] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 3 ms to minimize.
[2024-06-01 19:42:49] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 3 ms to minimize.
[2024-06-01 19:42:50] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 3 ms to minimize.
[2024-06-01 19:42:50] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 3 ms to minimize.
[2024-06-01 19:42:50] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 3 ms to minimize.
[2024-06-01 19:42:50] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 3 ms to minimize.
[2024-06-01 19:42:50] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 4 ms to minimize.
SMT process timed out in 30686ms, After SMT, problems are : Problem set: 0 solved, 951 unsolved
Search for dead transitions found 0 dead transitions in 30702ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32076 ms. Remains : 702/702 places, 952/952 transitions.
[2024-06-01 19:42:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 14 ms.
[2024-06-01 19:42:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 702 places, 952 transitions and 4720 arcs took 11 ms.
[2024-06-01 19:42:51] [INFO ] Flatten gal took : 157 ms
Total runtime 78039 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldRVs-PT-050A-ReachabilityFireability-2024-02
Could not compute solution for formula : ShieldRVs-PT-050A-ReachabilityFireability-2024-04
Could not compute solution for formula : ShieldRVs-PT-050A-ReachabilityFireability-2024-10

BK_STOP 1717270971616

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldRVs-PT-050A-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/818/inv_0_
rfs formula name ShieldRVs-PT-050A-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/818/inv_1_
rfs formula name ShieldRVs-PT-050A-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/818/inv_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ShieldRVs-PT-050A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-050A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683762000855"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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