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.r069-tall-171620503700055.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 CANConstruction-PT-060, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503700055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 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 5.4M 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 CANConstruction-PT-060-ReachabilityFireability-2024-00
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-01
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-02
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-03
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-04
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-05
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-06
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-07
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-08
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-09
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-10
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-11
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-12
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-13
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-14
FORMULA_NAME CANConstruction-PT-060-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716373600272

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-060
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 10:26:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 10:26:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:26:42] [INFO ] Load time of PNML (sax parser for PT used): 469 ms
[2024-05-22 10:26:42] [INFO ] Transformed 7922 places.
[2024-05-22 10:26:42] [INFO ] Transformed 14880 transitions.
[2024-05-22 10:26:42] [INFO ] Parsed PT model containing 7922 places and 14880 transitions and 44400 arcs in 630 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (36 resets) in 2579 ms. (15 steps per ms) remains 6/16 properties
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 492 ms. (81 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 909 ms. (43 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
// Phase 1: matrix 14880 rows 7922 cols
[2024-05-22 10:26:43] [INFO ] Computed 121 invariants in 181 ms
[2024-05-22 10:26:44] [INFO ] State equation strengthened by 7140 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7658/7862 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7862 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 60/7922 variables, 60/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7922 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 22802/22802 variables, and 8043 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5053 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 7922/7922 constraints, ReadFeed: 0/7140 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7658/7862 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 10:26:55] [INFO ] Deduced a trap composed of 105 places in 4977 ms of which 231 ms to minimize.
SMT process timed out in 11891ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 204 out of 7922 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7922/7922 places, 14880/14880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 273 transitions
Trivial Post-agglo rules discarded 273 transitions
Performed 273 trivial Post agglomeration. Transition count delta: 273
Iterating post reduction 0 with 273 rules applied. Total rules applied 273 place count 7922 transition count 14607
Reduce places removed 273 places and 0 transitions.
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Iterating post reduction 1 with 334 rules applied. Total rules applied 607 place count 7649 transition count 14546
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 2 with 61 rules applied. Total rules applied 668 place count 7588 transition count 14546
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 668 place count 7588 transition count 14514
Deduced a syphon composed of 32 places in 6 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 732 place count 7556 transition count 14514
Discarding 3401 places :
Symmetric choice reduction at 3 with 3401 rule applications. Total rules 4133 place count 4155 transition count 7712
Iterating global reduction 3 with 3401 rules applied. Total rules applied 7534 place count 4155 transition count 7712
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 6 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 7588 place count 4128 transition count 7685
Free-agglomeration rule applied 32 times.
Iterating global reduction 3 with 32 rules applied. Total rules applied 7620 place count 4128 transition count 7653
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 7652 place count 4096 transition count 7653
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 7653 place count 4096 transition count 7652
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7654 place count 4095 transition count 7652
Partial Free-agglomeration rule applied 119 times.
Drop transitions (Partial Free agglomeration) removed 119 transitions
Iterating global reduction 5 with 119 rules applied. Total rules applied 7773 place count 4095 transition count 7652
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 7794 place count 4095 transition count 7652
Applied a total of 7794 rules in 5106 ms. Remains 4095 /7922 variables (removed 3827) and now considering 7652/14880 (removed 7228) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5120 ms. Remains : 4095/7922 places, 7652/14880 transitions.
RANDOM walk for 40000 steps (84 resets) in 1296 ms. (30 steps per ms) remains 4/6 properties
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
// Phase 1: matrix 7652 rows 4095 cols
[2024-05-22 10:27:01] [INFO ] Computed 121 invariants in 50 ms
[2024-05-22 10:27:01] [INFO ] State equation strengthened by 7235 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3910/4030 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4030 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/4035 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4035 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 60/4095 variables, 60/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4095 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7652/11747 variables, 4095/4216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/11747 variables, 7235/11451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11747 variables, 0/11451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/11747 variables, 0/11451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11747/11747 variables, and 11451 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6658 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 4095/4095 constraints, ReadFeed: 7235/7235 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3910/4030 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 10:27:12] [INFO ] Deduced a trap composed of 3 places in 3900 ms of which 21 ms to minimize.
[2024-05-22 10:27:15] [INFO ] Deduced a trap composed of 64 places in 2424 ms of which 39 ms to minimize.
[2024-05-22 10:27:17] [INFO ] Deduced a trap composed of 65 places in 2620 ms of which 23 ms to minimize.
[2024-05-22 10:27:20] [INFO ] Deduced a trap composed of 72 places in 2301 ms of which 19 ms to minimize.
[2024-05-22 10:27:22] [INFO ] Deduced a trap composed of 72 places in 2262 ms of which 18 ms to minimize.
[2024-05-22 10:27:24] [INFO ] Deduced a trap composed of 65 places in 2326 ms of which 18 ms to minimize.
[2024-05-22 10:27:27] [INFO ] Deduced a trap composed of 63 places in 2366 ms of which 24 ms to minimize.
[2024-05-22 10:27:29] [INFO ] Deduced a trap composed of 71 places in 2336 ms of which 19 ms to minimize.
[2024-05-22 10:27:31] [INFO ] Deduced a trap composed of 67 places in 2143 ms of which 26 ms to minimize.
[2024-05-22 10:27:34] [INFO ] Deduced a trap composed of 76 places in 2118 ms of which 17 ms to minimize.
[2024-05-22 10:27:36] [INFO ] Deduced a trap composed of 65 places in 2078 ms of which 18 ms to minimize.
[2024-05-22 10:27:38] [INFO ] Deduced a trap composed of 64 places in 2276 ms of which 18 ms to minimize.
[2024-05-22 10:27:40] [INFO ] Deduced a trap composed of 66 places in 2248 ms of which 17 ms to minimize.
[2024-05-22 10:27:43] [INFO ] Deduced a trap composed of 63 places in 2303 ms of which 19 ms to minimize.
[2024-05-22 10:27:45] [INFO ] Deduced a trap composed of 66 places in 2115 ms of which 17 ms to minimize.
[2024-05-22 10:27:47] [INFO ] Deduced a trap composed of 76 places in 1970 ms of which 17 ms to minimize.
[2024-05-22 10:27:49] [INFO ] Deduced a trap composed of 74 places in 2491 ms of which 19 ms to minimize.
[2024-05-22 10:27:52] [INFO ] Deduced a trap composed of 66 places in 2494 ms of which 20 ms to minimize.
[2024-05-22 10:27:54] [INFO ] Deduced a trap composed of 65 places in 2137 ms of which 18 ms to minimize.
SMT process timed out in 53347ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 120 out of 4095 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4095/4095 places, 7652/7652 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4095 transition count 7651
Reduce places removed 1 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 18 rules applied. Total rules applied 19 place count 4094 transition count 7634
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 36 place count 4077 transition count 7634
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 44 place count 4069 transition count 7618
Iterating global reduction 3 with 8 rules applied. Total rules applied 52 place count 4069 transition count 7618
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 112 place count 4039 transition count 7588
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 126 place count 4032 transition count 7589
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 4032 transition count 7589
Applied a total of 128 rules in 2696 ms. Remains 4032 /4095 variables (removed 63) and now considering 7589/7652 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2697 ms. Remains : 4032/4095 places, 7589/7652 transitions.
RANDOM walk for 40000 steps (90 resets) in 1118 ms. (35 steps per ms) remains 3/4 properties
FORMULA CANConstruction-PT-060-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
// Phase 1: matrix 7589 rows 4032 cols
[2024-05-22 10:27:58] [INFO ] Computed 121 invariants in 51 ms
[2024-05-22 10:27:58] [INFO ] State equation strengthened by 7269 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3848/3967 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3967 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/3972 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3972 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 60/4032 variables, 60/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4032 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7589/11621 variables, 4032/4153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/11621 variables, 7269/11422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11621 variables, 0/11422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/11621 variables, 0/11422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11621/11621 variables, and 11422 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6186 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 4032/4032 constraints, ReadFeed: 7269/7269 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3848/3967 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 10:28:08] [INFO ] Deduced a trap composed of 3 places in 3512 ms of which 22 ms to minimize.
[2024-05-22 10:28:12] [INFO ] Deduced a trap composed of 3 places in 3578 ms of which 23 ms to minimize.
[2024-05-22 10:28:15] [INFO ] Deduced a trap composed of 3 places in 3644 ms of which 22 ms to minimize.
[2024-05-22 10:28:17] [INFO ] Deduced a trap composed of 66 places in 1778 ms of which 16 ms to minimize.
[2024-05-22 10:28:19] [INFO ] Deduced a trap composed of 73 places in 1805 ms of which 16 ms to minimize.
[2024-05-22 10:28:21] [INFO ] Deduced a trap composed of 74 places in 2077 ms of which 17 ms to minimize.
[2024-05-22 10:28:23] [INFO ] Deduced a trap composed of 68 places in 2043 ms of which 18 ms to minimize.
[2024-05-22 10:28:25] [INFO ] Deduced a trap composed of 69 places in 1963 ms of which 17 ms to minimize.
[2024-05-22 10:28:27] [INFO ] Deduced a trap composed of 64 places in 2057 ms of which 18 ms to minimize.
[2024-05-22 10:28:29] [INFO ] Deduced a trap composed of 70 places in 1906 ms of which 16 ms to minimize.
[2024-05-22 10:28:31] [INFO ] Deduced a trap composed of 66 places in 1988 ms of which 17 ms to minimize.
[2024-05-22 10:28:33] [INFO ] Deduced a trap composed of 64 places in 2092 ms of which 19 ms to minimize.
[2024-05-22 10:28:36] [INFO ] Deduced a trap composed of 68 places in 2040 ms of which 19 ms to minimize.
[2024-05-22 10:28:38] [INFO ] Deduced a trap composed of 64 places in 1966 ms of which 19 ms to minimize.
[2024-05-22 10:28:39] [INFO ] Deduced a trap composed of 72 places in 1854 ms of which 17 ms to minimize.
[2024-05-22 10:28:41] [INFO ] Deduced a trap composed of 69 places in 1940 ms of which 16 ms to minimize.
[2024-05-22 10:28:43] [INFO ] Deduced a trap composed of 64 places in 1804 ms of which 15 ms to minimize.
[2024-05-22 10:28:45] [INFO ] Deduced a trap composed of 74 places in 1742 ms of which 16 ms to minimize.
[2024-05-22 10:28:47] [INFO ] Deduced a trap composed of 70 places in 1682 ms of which 16 ms to minimize.
[2024-05-22 10:28:49] [INFO ] Deduced a trap composed of 69 places in 1986 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3967 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 10:28:51] [INFO ] Deduced a trap composed of 70 places in 1716 ms of which 16 ms to minimize.
[2024-05-22 10:28:53] [INFO ] Deduced a trap composed of 64 places in 1856 ms of which 18 ms to minimize.
[2024-05-22 10:28:54] [INFO ] Deduced a trap composed of 66 places in 1886 ms of which 17 ms to minimize.
[2024-05-22 10:28:56] [INFO ] Deduced a trap composed of 65 places in 1914 ms of which 17 ms to minimize.
[2024-05-22 10:28:58] [INFO ] Deduced a trap composed of 63 places in 1767 ms of which 14 ms to minimize.
[2024-05-22 10:29:00] [INFO ] Deduced a trap composed of 67 places in 1591 ms of which 16 ms to minimize.
[2024-05-22 10:29:02] [INFO ] Deduced a trap composed of 69 places in 1662 ms of which 17 ms to minimize.
[2024-05-22 10:29:03] [INFO ] Deduced a trap composed of 71 places in 1704 ms of which 16 ms to minimize.
[2024-05-22 10:29:05] [INFO ] Deduced a trap composed of 72 places in 1801 ms of which 16 ms to minimize.
[2024-05-22 10:29:07] [INFO ] Deduced a trap composed of 74 places in 1830 ms of which 15 ms to minimize.
[2024-05-22 10:29:09] [INFO ] Deduced a trap composed of 66 places in 1559 ms of which 16 ms to minimize.
[2024-05-22 10:29:10] [INFO ] Deduced a trap composed of 66 places in 1661 ms of which 15 ms to minimize.
[2024-05-22 10:29:12] [INFO ] Deduced a trap composed of 63 places in 1638 ms of which 16 ms to minimize.
[2024-05-22 10:29:14] [INFO ] Deduced a trap composed of 67 places in 1857 ms of which 19 ms to minimize.
[2024-05-22 10:29:16] [INFO ] Deduced a trap composed of 63 places in 1583 ms of which 15 ms to minimize.
[2024-05-22 10:29:18] [INFO ] Deduced a trap composed of 64 places in 1805 ms of which 18 ms to minimize.
[2024-05-22 10:29:19] [INFO ] Deduced a trap composed of 73 places in 1696 ms of which 18 ms to minimize.
SMT process timed out in 81875ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 119 out of 4032 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4032/4032 places, 7589/7589 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4031 transition count 7588
Applied a total of 2 rules in 1053 ms. Remains 4031 /4032 variables (removed 1) and now considering 7588/7589 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1053 ms. Remains : 4031/4032 places, 7588/7589 transitions.
RANDOM walk for 40000 steps (89 resets) in 828 ms. (48 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 85733 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 3
Probabilistic random walk after 85733 steps, saw 67305 distinct states, run finished after 3007 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 7588 rows 4031 cols
[2024-05-22 10:29:24] [INFO ] Computed 121 invariants in 42 ms
[2024-05-22 10:29:24] [INFO ] State equation strengthened by 7270 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3847/3966 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3966 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/3971 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3971 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 60/4031 variables, 60/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4031 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7588/11619 variables, 4031/4152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/11619 variables, 7270/11422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/11619 variables, 0/11422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/11619 variables, 0/11422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11619/11619 variables, and 11422 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6098 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 4031/4031 constraints, ReadFeed: 7270/7270 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3847/3966 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 10:29:34] [INFO ] Deduced a trap composed of 24 places in 3781 ms of which 25 ms to minimize.
[2024-05-22 10:29:37] [INFO ] Deduced a trap composed of 66 places in 2426 ms of which 20 ms to minimize.
[2024-05-22 10:29:39] [INFO ] Deduced a trap composed of 65 places in 2302 ms of which 19 ms to minimize.
[2024-05-22 10:29:42] [INFO ] Deduced a trap composed of 64 places in 2171 ms of which 19 ms to minimize.
[2024-05-22 10:29:46] [INFO ] Deduced a trap composed of 3 places in 3996 ms of which 24 ms to minimize.
[2024-05-22 10:29:48] [INFO ] Deduced a trap composed of 67 places in 2235 ms of which 19 ms to minimize.
[2024-05-22 10:29:50] [INFO ] Deduced a trap composed of 67 places in 2410 ms of which 20 ms to minimize.
[2024-05-22 10:29:53] [INFO ] Deduced a trap composed of 67 places in 2187 ms of which 21 ms to minimize.
[2024-05-22 10:29:55] [INFO ] Deduced a trap composed of 66 places in 2517 ms of which 21 ms to minimize.
[2024-05-22 10:29:58] [INFO ] Deduced a trap composed of 64 places in 2293 ms of which 18 ms to minimize.
[2024-05-22 10:30:00] [INFO ] Deduced a trap composed of 74 places in 2230 ms of which 19 ms to minimize.
[2024-05-22 10:30:02] [INFO ] Deduced a trap composed of 76 places in 2454 ms of which 23 ms to minimize.
[2024-05-22 10:30:05] [INFO ] Deduced a trap composed of 78 places in 2358 ms of which 20 ms to minimize.
[2024-05-22 10:30:07] [INFO ] Deduced a trap composed of 67 places in 2222 ms of which 19 ms to minimize.
[2024-05-22 10:30:10] [INFO ] Deduced a trap composed of 68 places in 2471 ms of which 20 ms to minimize.
[2024-05-22 10:30:12] [INFO ] Deduced a trap composed of 64 places in 2239 ms of which 19 ms to minimize.
[2024-05-22 10:30:14] [INFO ] Deduced a trap composed of 66 places in 2375 ms of which 19 ms to minimize.
[2024-05-22 10:30:17] [INFO ] Deduced a trap composed of 65 places in 2203 ms of which 18 ms to minimize.
[2024-05-22 10:30:19] [INFO ] Deduced a trap composed of 67 places in 2100 ms of which 17 ms to minimize.
[2024-05-22 10:30:21] [INFO ] Deduced a trap composed of 68 places in 2577 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3966 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 10:30:24] [INFO ] Deduced a trap composed of 68 places in 2467 ms of which 20 ms to minimize.
[2024-05-22 10:30:26] [INFO ] Deduced a trap composed of 64 places in 2173 ms of which 19 ms to minimize.
[2024-05-22 10:30:29] [INFO ] Deduced a trap composed of 77 places in 2437 ms of which 19 ms to minimize.
[2024-05-22 10:30:31] [INFO ] Deduced a trap composed of 64 places in 2395 ms of which 19 ms to minimize.
[2024-05-22 10:30:33] [INFO ] Deduced a trap composed of 71 places in 2400 ms of which 19 ms to minimize.
[2024-05-22 10:30:36] [INFO ] Deduced a trap composed of 64 places in 2122 ms of which 19 ms to minimize.
[2024-05-22 10:30:38] [INFO ] Deduced a trap composed of 74 places in 2347 ms of which 19 ms to minimize.
[2024-05-22 10:30:40] [INFO ] Deduced a trap composed of 75 places in 1997 ms of which 18 ms to minimize.
[2024-05-22 10:30:42] [INFO ] Deduced a trap composed of 77 places in 2112 ms of which 18 ms to minimize.
[2024-05-22 10:30:45] [INFO ] Deduced a trap composed of 75 places in 2282 ms of which 20 ms to minimize.
[2024-05-22 10:30:47] [INFO ] Deduced a trap composed of 65 places in 2271 ms of which 21 ms to minimize.
[2024-05-22 10:30:49] [INFO ] Deduced a trap composed of 74 places in 2370 ms of which 19 ms to minimize.
[2024-05-22 10:30:52] [INFO ] Deduced a trap composed of 65 places in 2283 ms of which 20 ms to minimize.
[2024-05-22 10:30:54] [INFO ] Deduced a trap composed of 64 places in 2413 ms of which 19 ms to minimize.
[2024-05-22 10:30:57] [INFO ] Deduced a trap composed of 68 places in 2303 ms of which 18 ms to minimize.
[2024-05-22 10:30:59] [INFO ] Deduced a trap composed of 65 places in 2185 ms of which 17 ms to minimize.
[2024-05-22 10:31:01] [INFO ] Deduced a trap composed of 64 places in 2137 ms of which 18 ms to minimize.
SMT process timed out in 97220ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 119 out of 4031 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4031/4031 places, 7588/7588 transitions.
Applied a total of 0 rules in 610 ms. Remains 4031 /4031 variables (removed 0) and now considering 7588/7588 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 610 ms. Remains : 4031/4031 places, 7588/7588 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4031/4031 places, 7588/7588 transitions.
Applied a total of 0 rules in 623 ms. Remains 4031 /4031 variables (removed 0) and now considering 7588/7588 (removed 0) transitions.
[2024-05-22 10:31:02] [INFO ] Invariant cache hit.
[2024-05-22 10:31:05] [INFO ] Implicit Places using invariants in 2855 ms returned [6, 11, 17, 22, 29, 37, 43, 49, 56, 63, 71, 77, 84, 91, 98, 103, 108, 115, 120, 128, 137, 143, 149, 156, 163, 167, 174, 180, 185, 191, 197, 203, 210, 219, 224, 232, 240, 246, 251, 255, 261, 269, 275, 281, 288, 294, 300, 307, 311, 318, 326, 334, 338, 343, 350, 357, 364, 372, 376, 380]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 2869 ms to find 60 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3971/4031 places, 7588/7588 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 3971 transition count 7569
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 3952 transition count 7569
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 70 place count 3920 transition count 7537
Iterating global reduction 2 with 32 rules applied. Total rules applied 102 place count 3920 transition count 7537
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 174 place count 3884 transition count 7501
Applied a total of 174 rules in 1888 ms. Remains 3884 /3971 variables (removed 87) and now considering 7501/7588 (removed 87) transitions.
// Phase 1: matrix 7501 rows 3884 cols
[2024-05-22 10:31:07] [INFO ] Computed 61 invariants in 131 ms
[2024-05-22 10:31:09] [INFO ] Implicit Places using invariants in 2442 ms returned []
[2024-05-22 10:31:09] [INFO ] Invariant cache hit.
[2024-05-22 10:31:12] [INFO ] State equation strengthened by 7171 read => feed constraints.
[2024-05-22 10:31:43] [INFO ] Performed 803/3884 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 10:32:13] [INFO ] Performed 1480/3884 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 10:32:43] [INFO ] Performed 2122/3884 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-22 10:33:13] [INFO ] Performed 2768/3884 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-22 10:33:13] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-22 10:33:13] [INFO ] Implicit Places using invariants and state equation in 123377 ms returned []
Implicit Place search using SMT with State Equation took 125825 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 3884/4031 places, 7501/7588 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 131209 ms. Remains : 3884/4031 places, 7501/7588 transitions.
[2024-05-22 10:33:13] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2024-05-22 10:33:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3884 places, 7501 transitions and 29566 arcs took 53 ms.
[2024-05-22 10:33:14] [INFO ] Flatten gal took : 906 ms
Total runtime 393305 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANConstruction-PT-060

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 3884
TRANSITIONS: 7501
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.154s, Sys 0.015s]


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


----------------------------------------------------------------------
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: 920
MODEL NAME: /home/mcc/execution/408/model
3884 places, 7501 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.

BK_TIME_CONFINEMENT_REACHED

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

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="CANConstruction-PT-060"
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 CANConstruction-PT-060, 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 r069-tall-171620503700055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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