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

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

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:28:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:28:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:28:55] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-31 22:28:55] [INFO ] Transformed 234 places.
[2024-05-31 22:28:55] [INFO ] Transformed 191 transitions.
[2024-05-31 22:28:55] [INFO ] Found NUPN structural information;
[2024-05-31 22:28:55] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 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 (904 resets) in 1768 ms. (22 steps per ms) remains 14/16 properties
FORMULA DES-PT-30a-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (166 resets) in 556 ms. (71 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (210 resets) in 979 ms. (40 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (190 resets) in 153 ms. (259 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (259 resets) in 249 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (193 resets) in 189 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (242 resets) in 308 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (206 resets) in 217 ms. (183 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (174 resets) in 120 ms. (330 steps per ms) remains 13/14 properties
FORMULA DES-PT-30a-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (203 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (171 resets) in 115 ms. (344 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (192 resets) in 116 ms. (341 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (203 resets) in 122 ms. (325 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (184 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
// Phase 1: matrix 177 rows 234 cols
[2024-05-31 22:28:57] [INFO ] Computed 59 invariants in 20 ms
[2024-05-31 22:28:57] [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, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 29/165 variables, 32/169 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 29/198 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 8/206 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 4/169 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 51/220 variables, 15/228 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 51/279 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 177/397 variables, 220/499 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/397 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 14/411 variables, 14/514 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SMT process timed out in 5248ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 136 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 177/177 transitions.
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 1 place count 234 transition count 177
Applied a total of 1 rules in 51 ms. Remains 234 /234 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 234/234 places, 177/177 transitions.
RANDOM walk for 40000 steps (909 resets) in 892 ms. (44 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (173 resets) in 282 ms. (141 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (207 resets) in 288 ms. (138 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (189 resets) in 161 ms. (246 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (267 resets) in 151 ms. (263 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (189 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (242 resets) in 237 ms. (168 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (215 resets) in 138 ms. (287 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (197 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (208 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (180 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (188 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (211 resets) in 154 ms. (258 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (179 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 569265 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 13
Probabilistic random walk after 569265 steps, saw 95806 distinct states, run finished after 3005 ms. (steps per millisecond=189 ) properties seen :0
// Phase 1: matrix 177 rows 234 cols
[2024-05-31 22:29:06] [INFO ] Computed 59 invariants in 12 ms
[2024-05-31 22:29:06] [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, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 29/165 variables, 32/169 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 29/198 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 8/206 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 4/169 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 51/220 variables, 15/228 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 51/279 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 177/397 variables, 220/499 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/397 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 14/411 variables, 14/514 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/411 variables, 14/528 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/411 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 0/411 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 528 constraints, problems are : Problem set: 0 solved, 13 unsolved in 7844 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: 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/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 29/165 variables, 32/169 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 29/198 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 8/206 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 4/169 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 51/220 variables, 15/228 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 51/279 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 22:29:14] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 15 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/220 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem DES-PT-30a-ReachabilityFireability-2024-01 is UNSAT
FORMULA DES-PT-30a-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (OVERLAPS) 177/397 variables, 220/500 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 1/501 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/397 variables, 4/505 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/397 variables, 0/505 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 14/411 variables, 14/519 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/411 variables, 14/533 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/411 variables, 8/541 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-31 22:29:27] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:29:27] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:29:27] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/411 variables, 3/544 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/411 variables, 0/544 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 0/411 variables, 0/544 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 544 constraints, problems are : Problem set: 1 solved, 12 unsolved in 20722 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: 12/13 constraints, Known Traps: 4/4 constraints]
After SMT, in 28676ms problems are : Problem set: 1 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 22878 ms.
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
Applied a total of 2 rules in 22 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 22 ms. Remains : 233/234 places, 176/177 transitions.
RANDOM walk for 40000 steps (916 resets) in 271 ms. (147 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (197 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (191 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (257 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (196 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (245 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (214 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (180 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (210 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (179 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (186 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (209 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (186 resets) in 73 ms. (540 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 610629 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 12
Probabilistic random walk after 610629 steps, saw 99136 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
// Phase 1: matrix 176 rows 233 cols
[2024-05-31 22:30:01] [INFO ] Computed 59 invariants in 3 ms
[2024-05-31 22:30:01] [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, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 34/146 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 14/160 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 57/217 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 176/393 variables, 217/276 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 16/409 variables, 16/293 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/409 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/409 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 293 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1937 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: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 34/146 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 14/160 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 57/217 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 176/393 variables, 217/276 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/393 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 16/409 variables, 16/297 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 22:30:06] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:30:06] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/409 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 22:30:06] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
[2024-05-31 22:30:07] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/409 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 22:30:08] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/409 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/409 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 0/409 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 310 constraints, problems are : Problem set: 0 solved, 12 unsolved in 9356 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: 12/12 constraints, Known Traps: 5/5 constraints]
After SMT, in 11345ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 25709 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 8 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 8 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 8 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-31 22:30:38] [INFO ] Invariant cache hit.
[2024-05-31 22:30:38] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-31 22:30:38] [INFO ] Invariant cache hit.
[2024-05-31 22:30:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:30:38] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-31 22:30:38] [INFO ] Redundant transitions in 6 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-31 22:30:38] [INFO ] Invariant cache hit.
[2024-05-31 22:30:38] [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 6151 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-31 22:30:46] [INFO ] Deduced a trap composed of 13 places in 36 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-31 22:30:47] [INFO ] Deduced a trap composed of 9 places in 37 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-31 22:30:54] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:30:54] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 7 ms to minimize.
[2024-05-31 22:30:55] [INFO ] Deduced a trap composed of 17 places in 48 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-31 22:31:10] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 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 30015 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 36258ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 36260ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36602 ms. Remains : 233/233 places, 176/176 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 9 ms. Remains 233 /233 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Running SMT prover for 12 properties.
[2024-05-31 22:31:15] [INFO ] Invariant cache hit.
[2024-05-31 22:31:15] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-31 22:31:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2024-05-31 22:31:15] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-31 22:31:16] [INFO ] After 785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
TRAPS : Iteration 0
[2024-05-31 22:31:16] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:31:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
TRAPS : Iteration 1
[2024-05-31 22:31:17] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:31:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2024-05-31 22:31:17] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:31:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
TRAPS : Iteration 2
[2024-05-31 22:31:18] [INFO ] After 3160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
[2024-05-31 22:31:19] [INFO ] After 3954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Over-approximation ignoring read arcs solved 0 properties in 4146 ms.
[2024-05-31 22:31:19] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-31 22:31:19] [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-31 22:31:19] [INFO ] Flatten gal took : 52 ms
Total runtime 144422 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 : DES-PT-30a-ReachabilityFireability-2024-02
Could not compute solution for formula : DES-PT-30a-ReachabilityFireability-2024-03
Could not compute solution for formula : DES-PT-30a-ReachabilityFireability-2024-04
Could not compute solution for formula : DES-PT-30a-ReachabilityFireability-2024-06
Could not compute solution for formula : DES-PT-30a-ReachabilityFireability-2024-07
Could not compute solution for formula : DES-PT-30a-ReachabilityFireability-2024-08
Could not compute solution for formula : DES-PT-30a-ReachabilityFireability-2024-09
Could not compute solution for formula : DES-PT-30a-ReachabilityFireability-2024-11
Could not compute solution for formula : DES-PT-30a-ReachabilityFireability-2024-12
Could not compute solution for formula : DES-PT-30a-ReachabilityFireability-2024-13
Could not compute solution for formula : DES-PT-30a-ReachabilityFireability-2024-14
Could not compute solution for formula : DES-PT-30a-ReachabilityFireability-2024-15

BK_STOP 1717194679988

--------------------
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 DES-PT-30a-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/604/inv_0_
rfs formula name DES-PT-30a-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/604/inv_1_
rfs formula name DES-PT-30a-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/604/inv_2_
rfs formula name DES-PT-30a-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/604/inv_3_
rfs formula name DES-PT-30a-ReachabilityFireability-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/604/inv_4_
rfs formula name DES-PT-30a-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/604/inv_5_
rfs formula name DES-PT-30a-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/604/inv_6_
rfs formula name DES-PT-30a-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/604/inv_7_
rfs formula name DES-PT-30a-ReachabilityFireability-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/604/inv_8_
rfs formula name DES-PT-30a-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/604/inv_9_
rfs formula name DES-PT-30a-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/604/inv_10_
rfs formula name DES-PT-30a-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/604/inv_11_
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="DES-PT-30a"
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 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 r480-tall-171624189800703"
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 ;