Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445500239.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S02J04T10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445500239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 906K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716860211884

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 01:36:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 01:36:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:36:53] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-28 01:36:53] [INFO ] Transformed 752 places.
[2024-05-28 01:36:53] [INFO ] Transformed 1572 transitions.
[2024-05-28 01:36:53] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 01:36:53] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 01:36:53] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-28 01:36:53] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-28 01:36:53] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 01:36:53] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-28 01:36:53] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-28 01:36:53] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-28 01:36:53] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-28 01:36:53] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 01:36:53] [INFO ] Reduced 110 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
RANDOM walk for 40000 steps (10 resets) in 1935 ms. (20 steps per ms) remains 8/16 properties
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (9 resets) in 1710 ms. (23 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 1107 ms. (36 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 2815 ms. (14 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 386 ms. (103 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1040 ms. (38 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (11 resets) in 485 ms. (82 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (11 resets) in 342 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 295 ms. (135 steps per ms) remains 8/8 properties
[2024-05-28 01:36:56] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-05-28 01:36:56] [INFO ] Computed 54 invariants in 78 ms
[2024-05-28 01:36:56] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/663 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/663 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 19/682 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/682 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/682 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-11 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-12 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-14 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-15 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 70/752 variables, 14/54 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-28 01:37:03] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 1/55 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 0/55 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2144/2144 variables, and 807 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5058 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 8/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/645 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/645 variables, 23/30 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/645 variables, 0/30 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/670 variables, 8/38 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/670 variables, 1/39 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/670 variables, 0/39 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 82/752 variables, 15/54 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 1/55 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-28 01:37:06] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 1/56 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 0/56 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1392/2144 variables, 752/808 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2144/2144 variables, and 928 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 13404ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 645 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Applied a total of 0 rules in 104 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-28 01:37:10] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 01:37:10] [INFO ] Invariant cache hit.
[2024-05-28 01:37:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-28 01:37:27] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-28 01:37:27] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-28 01:37:27] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-28 01:37:27] [INFO ] Deduced a trap composed of 66 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:37:27] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 0 ms to minimize.
[2024-05-28 01:37:27] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 2 ms to minimize.
[2024-05-28 01:37:28] [INFO ] Deduced a trap composed of 66 places in 39 ms of which 1 ms to minimize.
[2024-05-28 01:37:28] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:37:28] [INFO ] Deduced a trap composed of 402 places in 293 ms of which 4 ms to minimize.
[2024-05-28 01:37:28] [INFO ] Deduced a trap composed of 65 places in 283 ms of which 4 ms to minimize.
[2024-05-28 01:37:29] [INFO ] Deduced a trap composed of 231 places in 265 ms of which 4 ms to minimize.
[2024-05-28 01:37:29] [INFO ] Deduced a trap composed of 229 places in 259 ms of which 4 ms to minimize.
[2024-05-28 01:37:29] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-28 01:37:30] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 3 ms to minimize.
[2024-05-28 01:37:32] [INFO ] Deduced a trap composed of 414 places in 387 ms of which 5 ms to minimize.
[2024-05-28 01:37:32] [INFO ] Deduced a trap composed of 412 places in 353 ms of which 4 ms to minimize.
SMT process timed out in 22381ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 22402ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22532 ms. Remains : 752/752 places, 1412/1412 transitions.
RANDOM walk for 40001 steps (10 resets) in 1249 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (10 resets) in 1912 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (11 resets) in 995 ms. (40 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 2491 ms. (16 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 318 ms. (125 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 67122 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 4
Probabilistic random walk after 67122 steps, saw 42886 distinct states, run finished after 3005 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-28 01:37:37] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-28 01:37:37] [INFO ] Invariant cache hit.
[2024-05-28 01:37:37] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/645 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/645 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/645 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/670 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/670 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/670 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 82/752 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-04 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1392/2144 variables, 752/806 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2144 variables, 120/926 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2144 variables, 0/926 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2144/2144 variables, and 926 constraints, problems are : Problem set: 1 solved, 3 unsolved in 45011 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 23/30 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 01:38:24] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/594 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 36/630 variables, 8/39 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 01:38:25] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/630 variables, 1/40 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 122/752 variables, 16/56 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 01:38:34] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 1 ms to minimize.
[2024-05-28 01:38:34] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 01:38:40] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 4 ms to minimize.
[2024-05-28 01:38:40] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 3 ms to minimize.
[2024-05-28 01:38:40] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 3 ms to minimize.
[2024-05-28 01:38:40] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 2 ms to minimize.
[2024-05-28 01:38:40] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-28 01:38:40] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-05-28 01:38:40] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 7/65 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-28 01:38:45] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 1/66 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/752 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1392/2144 variables, 752/818 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2144/2144 variables, and 938 constraints, problems are : Problem set: 1 solved, 3 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 92168ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 594 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 752 transition count 1392
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 732 transition count 1392
Applied a total of 40 rules in 75 ms. Remains 732 /752 variables (removed 20) and now considering 1392/1412 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 732/752 places, 1392/1412 transitions.
RANDOM walk for 40000 steps (10 resets) in 1186 ms. (33 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (9 resets) in 2235 ms. (17 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3065 ms. (13 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 460 ms. (86 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 133494 steps, run timeout after 6001 ms. (steps per millisecond=22 ) properties seen :0 out of 3
Probabilistic random walk after 133494 steps, saw 72142 distinct states, run finished after 6001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-28 01:39:17] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 732 cols
[2024-05-28 01:39:18] [INFO ] Computed 54 invariants in 81 ms
[2024-05-28 01:39:18] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/627 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 105/732 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1372/2104 variables, 732/786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2104 variables, 120/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2104 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/2104 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2104/2104 variables, and 906 constraints, problems are : Problem set: 0 solved, 3 unsolved in 75009 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 732/732 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/627 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 105/732 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 01:40:50] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 3 ms to minimize.
[2024-05-28 01:40:50] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 1 ms to minimize.
[2024-05-28 01:40:50] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2024-05-28 01:40:50] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-28 01:40:50] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 1 ms to minimize.
[2024-05-28 01:40:51] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 01:40:59] [INFO ] Deduced a trap composed of 63 places in 175 ms of which 3 ms to minimize.
[2024-05-28 01:40:59] [INFO ] Deduced a trap composed of 63 places in 143 ms of which 2 ms to minimize.
[2024-05-28 01:40:59] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 4 ms to minimize.
[2024-05-28 01:40:59] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/732 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1372/2104 variables, 732/796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2104 variables, 120/916 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2104 variables, 1/917 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2104/2104 variables, and 917 constraints, problems are : Problem set: 0 solved, 3 unsolved in 75020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 732/732 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 151571ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 594 out of 732 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 732/732 places, 1392/1392 transitions.
Applied a total of 0 rules in 73 ms. Remains 732 /732 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 732/732 places, 1392/1392 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 732/732 places, 1392/1392 transitions.
Applied a total of 0 rules in 44 ms. Remains 732 /732 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
[2024-05-28 01:41:49] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 01:41:49] [INFO ] Invariant cache hit.
[2024-05-28 01:41:49] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-28 01:41:49] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 01:41:49] [INFO ] Invariant cache hit.
[2024-05-28 01:41:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 01:41:55] [INFO ] Implicit Places using invariants and state equation in 6122 ms returned []
Implicit Place search using SMT with State Equation took 6364 ms to find 0 implicit places.
[2024-05-28 01:41:56] [INFO ] Redundant transitions in 129 ms returned []
Running 1390 sub problems to find dead transitions.
[2024-05-28 01:41:56] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-28 01:41:56] [INFO ] Invariant cache hit.
[2024-05-28 01:41:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:42:11] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 2 ms to minimize.
[2024-05-28 01:42:11] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 2 ms to minimize.
[2024-05-28 01:42:11] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
[2024-05-28 01:42:11] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-05-28 01:42:11] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-28 01:42:11] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:42:11] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:42:11] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:42:12] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-28 01:42:12] [INFO ] Deduced a trap composed of 63 places in 372 ms of which 5 ms to minimize.
[2024-05-28 01:42:12] [INFO ] Deduced a trap composed of 382 places in 333 ms of which 4 ms to minimize.
[2024-05-28 01:42:13] [INFO ] Deduced a trap composed of 57 places in 213 ms of which 3 ms to minimize.
[2024-05-28 01:42:14] [INFO ] Deduced a trap composed of 491 places in 420 ms of which 6 ms to minimize.
[2024-05-28 01:42:14] [INFO ] Deduced a trap composed of 461 places in 356 ms of which 4 ms to minimize.
[2024-05-28 01:42:15] [INFO ] Deduced a trap composed of 474 places in 369 ms of which 4 ms to minimize.
[2024-05-28 01:42:15] [INFO ] Deduced a trap composed of 491 places in 310 ms of which 4 ms to minimize.
[2024-05-28 01:42:15] [INFO ] Deduced a trap composed of 212 places in 370 ms of which 6 ms to minimize.
[2024-05-28 01:42:16] [INFO ] Deduced a trap composed of 218 places in 325 ms of which 4 ms to minimize.
[2024-05-28 01:42:17] [INFO ] Deduced a trap composed of 387 places in 266 ms of which 4 ms to minimize.
[2024-05-28 01:42:17] [INFO ] Deduced a trap composed of 381 places in 330 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:42:19] [INFO ] Deduced a trap composed of 391 places in 337 ms of which 5 ms to minimize.
[2024-05-28 01:42:20] [INFO ] Deduced a trap composed of 442 places in 324 ms of which 4 ms to minimize.
[2024-05-28 01:42:22] [INFO ] Deduced a trap composed of 78 places in 400 ms of which 5 ms to minimize.
[2024-05-28 01:42:22] [INFO ] Deduced a trap composed of 357 places in 372 ms of which 5 ms to minimize.
[2024-05-28 01:42:22] [INFO ] Deduced a trap composed of 391 places in 315 ms of which 4 ms to minimize.
[2024-05-28 01:42:23] [INFO ] Deduced a trap composed of 503 places in 309 ms of which 3 ms to minimize.
[2024-05-28 01:42:23] [INFO ] Deduced a trap composed of 406 places in 393 ms of which 6 ms to minimize.
[2024-05-28 01:42:24] [INFO ] Deduced a trap composed of 400 places in 399 ms of which 4 ms to minimize.
[2024-05-28 01:42:24] [INFO ] Deduced a trap composed of 352 places in 394 ms of which 5 ms to minimize.
[2024-05-28 01:42:24] [INFO ] Deduced a trap composed of 398 places in 395 ms of which 5 ms to minimize.
[2024-05-28 01:42:25] [INFO ] Deduced a trap composed of 417 places in 373 ms of which 6 ms to minimize.
[2024-05-28 01:42:26] [INFO ] Deduced a trap composed of 378 places in 423 ms of which 6 ms to minimize.
[2024-05-28 01:42:27] [INFO ] Deduced a trap composed of 383 places in 414 ms of which 5 ms to minimize.
[2024-05-28 01:42:27] [INFO ] Deduced a trap composed of 353 places in 404 ms of which 5 ms to minimize.
[2024-05-28 01:42:27] [INFO ] Deduced a trap composed of 389 places in 367 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2104 variables, and 85 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/732 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 35/85 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-28 01:42:51] [INFO ] Deduced a trap composed of 397 places in 444 ms of which 6 ms to minimize.
[2024-05-28 01:42:51] [INFO ] Deduced a trap composed of 399 places in 430 ms of which 5 ms to minimize.
[2024-05-28 01:42:52] [INFO ] Deduced a trap composed of 400 places in 460 ms of which 5 ms to minimize.
[2024-05-28 01:42:52] [INFO ] Deduced a trap composed of 392 places in 401 ms of which 5 ms to minimize.
[2024-05-28 01:42:53] [INFO ] Deduced a trap composed of 393 places in 368 ms of which 5 ms to minimize.
[2024-05-28 01:42:53] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2104 variables, and 91 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/732 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 41/41 constraints]
After SMT, in 61785ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 61802ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68354 ms. Remains : 732/732 places, 1392/1392 transitions.
[2024-05-28 01:42:57] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 22 ms.
[2024-05-28 01:42:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 732 places, 1392 transitions and 6102 arcs took 13 ms.
[2024-05-28 01:42:58] [INFO ] Flatten gal took : 231 ms
Total runtime 365416 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S02J04T10

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: 732
TRANSITIONS: 1392
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.053s, Sys 0.003s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.007s, 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: 855
MODEL NAME: /home/mcc/execution/412/model
732 places, 1392 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J04T10"
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 PolyORBLF-PT-S02J04T10, 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 r289-tajo-171654445500239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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