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.r355-tall-171683757900047.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 greatspnxred
Input is ShieldIIPs-PT-003B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683757900047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.3K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 14:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 14:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 14:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 14:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 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 49K 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 ShieldIIPs-PT-003B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716878049104

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-003B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:34:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 06:34:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:34:10] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-28 06:34:10] [INFO ] Transformed 183 places.
[2024-05-28 06:34:10] [INFO ] Transformed 180 transitions.
[2024-05-28 06:34:10] [INFO ] Found NUPN structural information;
[2024-05-28 06:34:10] [INFO ] Parsed PT model containing 183 places and 180 transitions and 540 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (88 resets) in 1177 ms. (33 steps per ms) remains 6/16 properties
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 644 ms. (62 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 592 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (12 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 145 ms. (274 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 156 ms. (254 steps per ms) remains 5/6 properties
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 180 rows 183 cols
[2024-05-28 06:34:11] [INFO ] Computed 28 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem ShieldIIPs-PT-003B-ReachabilityFireability-2024-05 is UNSAT
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem ShieldIIPs-PT-003B-ReachabilityFireability-2024-10 is UNSAT
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 79/183 variables, 28/132 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 79/211 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/211 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 180/363 variables, 183/394 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/394 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/394 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 394 constraints, problems are : Problem set: 2 solved, 3 unsolved in 429 ms.
Refiners :[Domain max(s): 183/183 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 116/183 variables, 28/95 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 116/211 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-28 06:34:12] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 16 ms to minimize.
[2024-05-28 06:34:12] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-28 06:34:12] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2024-05-28 06:34:12] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-28 06:34:12] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
Problem ShieldIIPs-PT-003B-ReachabilityFireability-2024-02 is UNSAT
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-28 06:34:12] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 06:34:12] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-28 06:34:12] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:34:12] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:34:12] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-28 06:34:12] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 2 ms to minimize.
[2024-05-28 06:34:12] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 18/229 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/229 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 180/363 variables, 183/412 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 2/414 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 06:34:13] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 3/417 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/417 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/363 variables, 0/417 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 417 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1860 ms.
Refiners :[Domain max(s): 183/183 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 21/21 constraints]
After SMT, in 2398ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 537 ms.
Support contains 43 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 183 transition count 172
Reduce places removed 8 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 13 rules applied. Total rules applied 21 place count 175 transition count 167
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 26 place count 170 transition count 167
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 26 place count 170 transition count 153
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 54 place count 156 transition count 153
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 69 place count 141 transition count 138
Iterating global reduction 3 with 15 rules applied. Total rules applied 84 place count 141 transition count 138
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 144 place count 111 transition count 108
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 152 place count 111 transition count 108
Applied a total of 152 rules in 53 ms. Remains 111 /183 variables (removed 72) and now considering 108/180 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 111/183 places, 108/180 transitions.
RANDOM walk for 40000 steps (139 resets) in 885 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (28 resets) in 322 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (22 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1169976 steps, run timeout after 3001 ms. (steps per millisecond=389 ) properties seen :0 out of 2
Probabilistic random walk after 1169976 steps, saw 229099 distinct states, run finished after 3005 ms. (steps per millisecond=389 ) properties seen :0
// Phase 1: matrix 108 rows 111 cols
[2024-05-28 06:34:17] [INFO ] Computed 28 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/111 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/219 variables, 111/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/219 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 139 constraints, problems are : Problem set: 0 solved, 2 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/111 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 108/219 variables, 111/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-28 06:34:18] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 707ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 260 ms.
Support contains 43 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 108/108 transitions.
Applied a total of 0 rules in 18 ms. Remains 111 /111 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 111/111 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 108/108 transitions.
Applied a total of 0 rules in 6 ms. Remains 111 /111 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-28 06:34:18] [INFO ] Invariant cache hit.
[2024-05-28 06:34:19] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 06:34:19] [INFO ] Invariant cache hit.
[2024-05-28 06:34:19] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-28 06:34:19] [INFO ] Redundant transitions in 14 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-28 06:34:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:19] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:34:19] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:34:19] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:34:19] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:34:19] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:34:19] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:34:19] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 4 ms to minimize.
[2024-05-28 06:34:19] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:34:19] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:34:20] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/219 variables, 111/161 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:21] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:34:21] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:34:21] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:34:21] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:34:21] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 5/166 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:22] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:34:22] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:34:22] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:22] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:23] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:34:23] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:34:23] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:34:23] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:34:23] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:24] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:34:24] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:24] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:34:24] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 06:34:24] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:34:24] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:34:24] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:34:24] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:34:24] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:34:24] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-28 06:34:25] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:34:25] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 10/187 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:25] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:34:25] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:34:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:34:25] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:26] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:34:26] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:34:26] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:26] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:34:26] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:34:26] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:34:26] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:34:26] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 5/199 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:27] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:34:27] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:34:27] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:28] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:28] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:28] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:34:28] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 06:34:28] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:34:29] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/219 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:29] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:34:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/219 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:30] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 06:34:30] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/219 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:30] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/219 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:31] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/219 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/219 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:32] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/219 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:32] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/219 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:33] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:34:33] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:34:33] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:34:33] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:34:33] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:34:33] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:34:33] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/219 variables, 7/223 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:33] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:34:34] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:34:34] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/219 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/219 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:35] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/219 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:35] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:34:35] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/219 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/219 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:36] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:34:36] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 32 (OVERLAPS) 0/219 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/219 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:38] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-28 06:34:38] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 34 (OVERLAPS) 0/219 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/219 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 36 (OVERLAPS) 0/219 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 233 constraints, problems are : Problem set: 0 solved, 107 unsolved in 20419 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 94/94 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 94/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:40] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/219 variables, 111/234 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 107/341 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:34:41] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-28 06:34:41] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 343 constraints, problems are : Problem set: 0 solved, 107 unsolved in 7739 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 97/97 constraints]
After SMT, in 28184ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 28187ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28371 ms. Remains : 111/111 places, 108/108 transitions.
[2024-05-28 06:34:47] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-28 06:34:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 111 places, 108 transitions and 409 arcs took 4 ms.
[2024-05-28 06:34:47] [INFO ] Flatten gal took : 33 ms
Total runtime 37252 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPs-PT-003B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 111
TRANSITIONS: 108
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 938
MODEL NAME: /home/mcc/execution/410/model
111 places, 108 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716878094240

--------------------
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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-003B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldIIPs-PT-003B, 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 r355-tall-171683757900047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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