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.r516-tajo-171654446700239.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 ltsminxred
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 r516-tajo-171654446700239
=====================================================================

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

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:37:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:37:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:37:31] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-06-01 14:37:31] [INFO ] Transformed 752 places.
[2024-06-01 14:37:31] [INFO ] Transformed 1572 transitions.
[2024-06-01 14:37:31] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 14:37:31] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 14:37:31] [INFO ] Reduced 110 identical enabling conditions.
[2024-06-01 14:37:31] [INFO ] Reduced 40 identical enabling conditions.
[2024-06-01 14:37:31] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 14:37:31] [INFO ] Reduced 40 identical enabling conditions.
[2024-06-01 14:37:31] [INFO ] Reduced 110 identical enabling conditions.
[2024-06-01 14:37:31] [INFO ] Reduced 40 identical enabling conditions.
[2024-06-01 14:37:31] [INFO ] Reduced 110 identical enabling conditions.
[2024-06-01 14:37:31] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 14:37:31] [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 1999 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 40003 steps (9 resets) in 1888 ms. (21 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (13 resets) in 1246 ms. (32 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 3151 ms. (12 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 397 ms. (100 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (9 resets) in 1061 ms. (37 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (10 resets) in 439 ms. (90 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (11 resets) in 434 ms. (91 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 407 ms. (98 steps per ms) remains 8/8 properties
[2024-06-01 14:37:35] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-06-01 14:37:35] [INFO ] Computed 54 invariants in 83 ms
[2024-06-01 14:37:35] [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
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 0/54 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1392/2144 variables, 752/806 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 926 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5074 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: 8/5 constraints, Known Traps: 0/0 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
[2024-06-01 14:37:45] [INFO ] Deduced a trap composed of 65 places in 316 ms of which 37 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 66 places in 216 ms of which 4 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 3 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 3 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 1 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:37:47] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:37:47] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 9/63 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-01 14:37:47] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 1/64 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 0/64 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 816 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5015 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: 3/5 constraints, Known Traps: 10/10 constraints]
After SMT, in 13417ms 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 111 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-06-01 14:37:49] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:37:49] [INFO ] Invariant cache hit.
[2024-06-01 14:37:49] [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-06-01 14:38:07] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:38:07] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:38:07] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:38:07] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:38:08] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:38:08] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 1 ms to minimize.
[2024-06-01 14:38:08] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:38:08] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:38:09] [INFO ] Deduced a trap composed of 402 places in 399 ms of which 4 ms to minimize.
[2024-06-01 14:38:09] [INFO ] Deduced a trap composed of 65 places in 483 ms of which 4 ms to minimize.
[2024-06-01 14:38:09] [INFO ] Deduced a trap composed of 231 places in 399 ms of which 4 ms to minimize.
[2024-06-01 14:38:10] [INFO ] Deduced a trap composed of 229 places in 408 ms of which 4 ms to minimize.
[2024-06-01 14:38:11] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:38:11] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 2 ms to minimize.
SMT process timed out in 22569ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 22597ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22738 ms. Remains : 752/752 places, 1412/1412 transitions.
RANDOM walk for 40000 steps (10 resets) in 1676 ms. (23 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (10 resets) in 3205 ms. (12 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (12 resets) in 1594 ms. (25 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (10 resets) in 3798 ms. (10 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 527 ms. (75 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 194539 steps, run timeout after 9001 ms. (steps per millisecond=21 ) properties seen :0 out of 4
Probabilistic random walk after 194539 steps, saw 118348 distinct states, run finished after 9008 ms. (steps per millisecond=21 ) properties seen :0
[2024-06-01 14:38:24] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-06-01 14:38:24] [INFO ] Invariant cache hit.
[2024-06-01 14:38:24] [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
Problem PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-04 is UNSAT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 82/752 variables, 15/54 constraints. Problems are: Problem set: 1 solved, 3 unsolved
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 45013 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-06-01 14:39:11] [INFO ] Deduced a trap composed of 3 places in 49 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-06-01 14:39:11] [INFO ] Deduced a trap composed of 66 places in 114 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-06-01 14:39:21] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:39:21] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 3 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 66 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 1 ms to minimize.
[2024-06-01 14:39:27] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 3 ms to minimize.
[2024-06-01 14:39:27] [INFO ] Deduced a trap composed of 66 places in 74 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-06-01 14:39:31] [INFO ] Deduced a trap composed of 65 places in 77 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 45021 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 91793ms 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 122 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 122 ms. Remains : 732/752 places, 1392/1412 transitions.
RANDOM walk for 40001 steps (10 resets) in 1100 ms. (36 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (10 resets) in 2383 ms. (16 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3938 ms. (10 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (10 resets) in 364 ms. (109 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 149764 steps, run timeout after 6001 ms. (steps per millisecond=24 ) properties seen :0 out of 3
Probabilistic random walk after 149764 steps, saw 80764 distinct states, run finished after 6001 ms. (steps per millisecond=24 ) properties seen :0
[2024-06-01 14:40:04] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 732 cols
[2024-06-01 14:40:04] [INFO ] Computed 54 invariants in 68 ms
[2024-06-01 14:40:04] [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 74063 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-06-01 14:41:36] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 3 ms to minimize.
[2024-06-01 14:41:36] [INFO ] Deduced a trap composed of 64 places in 155 ms of which 3 ms to minimize.
[2024-06-01 14:41:36] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:41:36] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:41:36] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:41:36] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:41:36] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:41:36] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:41:44] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:41:44] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 2/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 75024 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 150692ms 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 24 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 24 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 36 ms. Remains 732 /732 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
[2024-06-01 14:42:35] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:42:35] [INFO ] Invariant cache hit.
[2024-06-01 14:42:35] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-06-01 14:42:35] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:42:35] [INFO ] Invariant cache hit.
[2024-06-01 14:42:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:42:41] [INFO ] Implicit Places using invariants and state equation in 5823 ms returned []
Implicit Place search using SMT with State Equation took 6047 ms to find 0 implicit places.
[2024-06-01 14:42:41] [INFO ] Redundant transitions in 109 ms returned []
Running 1390 sub problems to find dead transitions.
[2024-06-01 14:42:41] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-06-01 14:42:41] [INFO ] Invariant cache hit.
[2024-06-01 14:42:41] [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-06-01 14:42:55] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:42:55] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:42:55] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-06-01 14:42:55] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 2 ms to minimize.
[2024-06-01 14:42:55] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:42:56] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 0 ms to minimize.
[2024-06-01 14:42:56] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:42:56] [INFO ] Deduced a trap composed of 64 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:42:56] [INFO ] Deduced a trap composed of 63 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:42:56] [INFO ] Deduced a trap composed of 63 places in 301 ms of which 3 ms to minimize.
[2024-06-01 14:42:56] [INFO ] Deduced a trap composed of 382 places in 270 ms of which 12 ms to minimize.
[2024-06-01 14:42:57] [INFO ] Deduced a trap composed of 57 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:42:58] [INFO ] Deduced a trap composed of 491 places in 387 ms of which 5 ms to minimize.
[2024-06-01 14:42:58] [INFO ] Deduced a trap composed of 461 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:42:58] [INFO ] Deduced a trap composed of 474 places in 300 ms of which 4 ms to minimize.
[2024-06-01 14:42:58] [INFO ] Deduced a trap composed of 491 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:42:59] [INFO ] Deduced a trap composed of 212 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:42:59] [INFO ] Deduced a trap composed of 218 places in 285 ms of which 3 ms to minimize.
[2024-06-01 14:43:00] [INFO ] Deduced a trap composed of 387 places in 336 ms of which 4 ms to minimize.
[2024-06-01 14:43:00] [INFO ] Deduced a trap composed of 381 places in 279 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-06-01 14:43:02] [INFO ] Deduced a trap composed of 391 places in 222 ms of which 3 ms to minimize.
[2024-06-01 14:43:03] [INFO ] Deduced a trap composed of 442 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:43:04] [INFO ] Deduced a trap composed of 78 places in 289 ms of which 4 ms to minimize.
[2024-06-01 14:43:05] [INFO ] Deduced a trap composed of 357 places in 326 ms of which 5 ms to minimize.
[2024-06-01 14:43:05] [INFO ] Deduced a trap composed of 391 places in 294 ms of which 4 ms to minimize.
[2024-06-01 14:43:05] [INFO ] Deduced a trap composed of 503 places in 277 ms of which 4 ms to minimize.
[2024-06-01 14:43:05] [INFO ] Deduced a trap composed of 406 places in 243 ms of which 4 ms to minimize.
[2024-06-01 14:43:06] [INFO ] Deduced a trap composed of 400 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:43:06] [INFO ] Deduced a trap composed of 352 places in 247 ms of which 4 ms to minimize.
[2024-06-01 14:43:06] [INFO ] Deduced a trap composed of 398 places in 247 ms of which 4 ms to minimize.
[2024-06-01 14:43:06] [INFO ] Deduced a trap composed of 417 places in 243 ms of which 4 ms to minimize.
[2024-06-01 14:43:08] [INFO ] Deduced a trap composed of 378 places in 300 ms of which 4 ms to minimize.
[2024-06-01 14:43:08] [INFO ] Deduced a trap composed of 383 places in 294 ms of which 3 ms to minimize.
[2024-06-01 14:43:08] [INFO ] Deduced a trap composed of 353 places in 302 ms of which 4 ms to minimize.
[2024-06-01 14:43:09] [INFO ] Deduced a trap composed of 389 places in 376 ms of which 5 ms to minimize.
[2024-06-01 14:43:10] [INFO ] Deduced a trap composed of 384 places in 371 ms of which 4 ms to minimize.
[2024-06-01 14:43:10] [INFO ] Deduced a trap composed of 347 places in 302 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2104 variables, and 87 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30037 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: 37/37 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, 37/87 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-06-01 14:43:35] [INFO ] Deduced a trap composed of 380 places in 417 ms of which 5 ms to minimize.
[2024-06-01 14:43:36] [INFO ] Deduced a trap composed of 382 places in 366 ms of which 6 ms to minimize.
[2024-06-01 14:43:36] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2104 variables, and 90 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30028 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: 40/40 constraints]
After SMT, in 61719ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 61735ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67941 ms. Remains : 732/732 places, 1392/1392 transitions.
[2024-06-01 14:43:43] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 37 ms.
[2024-06-01 14:43:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 732 places, 1392 transitions and 6102 arcs took 21 ms.
[2024-06-01 14:43:43] [INFO ] Flatten gal took : 240 ms
Total runtime 372115 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 : PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-03
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-06
Could not compute solution for formula : PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-13

BK_STOP 1717253024048

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/838/inv_0_
rfs formula name PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/838/inv_1_
rfs formula name PolyORBLF-PT-S02J04T10-ReachabilityFireability-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/838/inv_2_
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="PolyORBLF-PT-S02J04T10"
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 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 r516-tajo-171654446700239"
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 ;