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.r091-tall-171624188300703.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 DES-PT-30a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188300703
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 08:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:42 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 DES-PT-30a-ReachabilityFireability-2024-00
FORMULA_NAME DES-PT-30a-ReachabilityFireability-2024-01
FORMULA_NAME DES-PT-30a-ReachabilityFireability-2024-02
FORMULA_NAME DES-PT-30a-ReachabilityFireability-2024-03
FORMULA_NAME DES-PT-30a-ReachabilityFireability-2024-04
FORMULA_NAME DES-PT-30a-ReachabilityFireability-2024-05
FORMULA_NAME DES-PT-30a-ReachabilityFireability-2024-06
FORMULA_NAME DES-PT-30a-ReachabilityFireability-2024-07
FORMULA_NAME DES-PT-30a-ReachabilityFireability-2024-08
FORMULA_NAME DES-PT-30a-ReachabilityFireability-2024-09
FORMULA_NAME DES-PT-30a-ReachabilityFireability-2024-10
FORMULA_NAME DES-PT-30a-ReachabilityFireability-2024-11
FORMULA_NAME DES-PT-30a-ReachabilityFireability-2024-12
FORMULA_NAME DES-PT-30a-ReachabilityFireability-2024-13
FORMULA_NAME DES-PT-30a-ReachabilityFireability-2024-14
FORMULA_NAME DES-PT-30a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716320383042

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 19:39:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 19:39:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:39:44] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-21 19:39:44] [INFO ] Transformed 234 places.
[2024-05-21 19:39:44] [INFO ] Transformed 191 transitions.
[2024-05-21 19:39:44] [INFO ] Found NUPN structural information;
[2024-05-21 19:39:44] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
RANDOM walk for 40000 steps (879 resets) in 2013 ms. (19 steps per ms) remains 15/16 properties
FORMULA DES-PT-30a-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (15 resets) in 158 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (19 resets) in 105 ms. (37 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (14 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (23 resets) in 78 ms. (50 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (17 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (14 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (21 resets) in 162 ms. (24 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (19 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (18 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (19 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (19 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (22 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (18 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 575726 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 15
Probabilistic random walk after 575726 steps, saw 94322 distinct states, run finished after 3015 ms. (steps per millisecond=190 ) properties seen :0
// Phase 1: matrix 177 rows 234 cols
[2024-05-21 19:39:48] [INFO ] Computed 59 invariants in 28 ms
[2024-05-21 19:39:48] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 29/165 variables, 32/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 29/198 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 8/206 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 4/169 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 51/220 variables, 15/228 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 51/279 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 177/397 variables, 220/499 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/397 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 14/411 variables, 14/514 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/411 variables, 14/528 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/411 variables, and 528 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5067 ms.
Refiners :[Domain max(s): 234/234 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 234/234 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 29/165 variables, 32/169 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 29/198 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 8/206 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 4/169 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 51/220 variables, 15/228 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 51/279 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem DES-PT-30a-ReachabilityFireability-2024-01 is UNSAT
FORMULA DES-PT-30a-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 14 (OVERLAPS) 177/397 variables, 220/499 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/397 variables, 1/500 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 4/504 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-21 19:39:58] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 397/411 variables, and 505 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5007 ms.
Refiners :[Domain max(s): 220/234 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 220/234 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/15 constraints, Known Traps: 1/1 constraints]
After SMT, in 10315ms problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 112 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 233 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 233 transition count 176
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 233 transition count 176
Applied a total of 3 rules in 47 ms. Remains 233 /234 variables (removed 1) and now considering 176/177 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 233/234 places, 176/177 transitions.
RANDOM walk for 40000 steps (907 resets) in 664 ms. (60 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (197 resets) in 262 ms. (152 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (185 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (257 resets) in 167 ms. (238 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (209 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (181 resets) in 180 ms. (221 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (242 resets) in 354 ms. (112 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (209 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (177 resets) in 75 ms. (526 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (208 resets) in 76 ms. (519 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (209 resets) in 73 ms. (540 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (181 resets) in 74 ms. (533 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (185 resets) in 80 ms. (493 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (208 resets) in 115 ms. (344 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (183 resets) in 77 ms. (512 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 638213 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :0 out of 14
Probabilistic random walk after 638213 steps, saw 102746 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
// Phase 1: matrix 176 rows 233 cols
[2024-05-21 19:40:02] [INFO ] Computed 59 invariants in 5 ms
[2024-05-21 19:40:02] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 34/146 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/160 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 57/217 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 176/393 variables, 217/276 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 16/409 variables, 16/293 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/409 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 0/409 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 293 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1953 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 233/233 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 34/146 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/160 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 57/217 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 176/393 variables, 217/276 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 19:40:05] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:40:05] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/393 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 19:40:06] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/393 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/393 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 16/409 variables, 16/300 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/409 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/409 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 0/409 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 310 constraints, problems are : Problem set: 0 solved, 14 unsolved in 7277 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 233/233 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 3/3 constraints]
After SMT, in 9312ms problems are : Problem set: 0 solved, 14 unsolved
FORMULA DES-PT-30a-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 30216 ms.
Support contains 112 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 233/233 places, 176/176 transitions.
RANDOM walk for 40000 steps (910 resets) in 232 ms. (171 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (202 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (189 resets) in 63 ms. (625 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (263 resets) in 87 ms. (454 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (192 resets) in 112 ms. (354 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (245 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (210 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (183 resets) in 63 ms. (625 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (212 resets) in 64 ms. (615 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (210 resets) in 60 ms. (655 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (188 resets) in 61 ms. (645 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (193 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (217 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (189 resets) in 62 ms. (634 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 584051 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 13
Probabilistic random walk after 584051 steps, saw 95989 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2024-05-21 19:40:45] [INFO ] Invariant cache hit.
[2024-05-21 19:40:45] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 34/146 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 14/160 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 57/217 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 176/393 variables, 217/276 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 16/409 variables, 16/293 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/409 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/409 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 293 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1970 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 233/233 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 34/146 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 14/160 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 57/217 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 176/393 variables, 217/276 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-21 19:40:49] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/393 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/393 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 16/409 variables, 16/298 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/409 variables, 9/307 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/409 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/409 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 307 constraints, problems are : Problem set: 0 solved, 13 unsolved in 6780 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 233/233 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 8798ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 30262 ms.
Support contains 112 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 20 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 233/233 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-21 19:41:24] [INFO ] Invariant cache hit.
[2024-05-21 19:41:24] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 19:41:24] [INFO ] Invariant cache hit.
[2024-05-21 19:41:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:41:25] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-21 19:41:25] [INFO ] Redundant transitions in 7 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-21 19:41:25] [INFO ] Invariant cache hit.
[2024-05-21 19:41:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/233 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 175 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 176/409 variables, 233/292 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/409 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 293 constraints, problems are : Problem set: 0 solved, 175 unsolved in 6430 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 233/233 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/233 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:41:32] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:41:34] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 176/409 variables, 233/294 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 175/470 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:41:40] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
[2024-05-21 19:41:40] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 19:41:42] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 3/473 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 19:41:56] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/409 variables, and 474 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 233/233 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 6/6 constraints]
After SMT, in 36533ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 36536ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36870 ms. Remains : 233/233 places, 176/176 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 7 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Running SMT prover for 13 properties.
[2024-05-21 19:42:01] [INFO ] Invariant cache hit.
[2024-05-21 19:42:01] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-21 19:42:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-21 19:42:01] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 19:42:02] [INFO ] After 655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2024-05-21 19:42:03] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:42:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-21 19:42:03] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:42:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
TRAPS : Iteration 1
[2024-05-21 19:42:04] [INFO ] After 2260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
[2024-05-21 19:42:04] [INFO ] After 3024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Over-approximation ignoring read arcs solved 0 properties in 3185 ms.
[2024-05-21 19:42:04] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-21 19:42:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 233 places, 176 transitions and 860 arcs took 4 ms.
[2024-05-21 19:42:05] [INFO ] Flatten gal took : 46 ms
Total runtime 140947 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-30a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 233
TRANSITIONS: 176
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.002s]


SAVING FILE /home/mcc/execution/412/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: 629
MODEL NAME: /home/mcc/execution/412/model
233 places, 176 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 DES-PT-30a-ReachabilityFireability-2024-02 CANNOT_COMPUTE
FORMULA DES-PT-30a-ReachabilityFireability-2024-03 CANNOT_COMPUTE
FORMULA DES-PT-30a-ReachabilityFireability-2024-04 CANNOT_COMPUTE
FORMULA DES-PT-30a-ReachabilityFireability-2024-06 CANNOT_COMPUTE
FORMULA DES-PT-30a-ReachabilityFireability-2024-07 CANNOT_COMPUTE
FORMULA DES-PT-30a-ReachabilityFireability-2024-08 CANNOT_COMPUTE
FORMULA DES-PT-30a-ReachabilityFireability-2024-09 CANNOT_COMPUTE
FORMULA DES-PT-30a-ReachabilityFireability-2024-10 CANNOT_COMPUTE
FORMULA DES-PT-30a-ReachabilityFireability-2024-11 CANNOT_COMPUTE
FORMULA DES-PT-30a-ReachabilityFireability-2024-12 CANNOT_COMPUTE
FORMULA DES-PT-30a-ReachabilityFireability-2024-13 CANNOT_COMPUTE
FORMULA DES-PT-30a-ReachabilityFireability-2024-14 CANNOT_COMPUTE
FORMULA DES-PT-30a-ReachabilityFireability-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716322274969

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="DES-PT-30a"
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 DES-PT-30a, 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 r091-tall-171624188300703"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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