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.r492-smll-171636266400199.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is EisenbergMcGuire-PT-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266400199
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.3M 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 EisenbergMcGuire-PT-09-ReachabilityFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-2023-08
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-2023-10
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-2023-11
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-2024-12
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-2023-13
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-2024-14
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717234163836

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:29:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 09:29:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:29:27] [INFO ] Load time of PNML (sax parser for PT used): 617 ms
[2024-06-01 09:29:27] [INFO ] Transformed 891 places.
[2024-06-01 09:29:27] [INFO ] Transformed 3888 transitions.
[2024-06-01 09:29:27] [INFO ] Found NUPN structural information;
[2024-06-01 09:29:27] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 1038 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2232 ms. (17 steps per ms) remains 15/16 properties
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 225 ms. (17 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 92980 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :3 out of 15
Probabilistic random walk after 92980 steps, saw 76284 distinct states, run finished after 3009 ms. (steps per millisecond=30 ) properties seen :3
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-2023-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 09:29:31] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
// Phase 1: matrix 1809 rows 891 cols
[2024-06-01 09:29:31] [INFO ] Computed 28 invariants in 41 ms
[2024-06-01 09:29:31] [INFO ] State equation strengthened by 932 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem EisenbergMcGuire-PT-09-ReachabilityFireability-2024-12 is UNSAT
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 791/890 variables, 18/118 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/890 variables, 791/909 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem EisenbergMcGuire-PT-09-ReachabilityFireability-2024-04 is UNSAT
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (INCLUDED_ONLY) 0/890 variables, 8/917 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 0/917 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/891 variables, 1/918 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/891 variables, 1/919 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/891 variables, 0/919 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1809/2700 variables, 891/1810 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2700 variables, 932/2742 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2700 variables, 0/2742 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/2700 variables, 0/2742 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2700/2700 variables, and 2742 constraints, problems are : Problem set: 2 solved, 10 unsolved in 4824 ms.
Refiners :[Domain max(s): 891/891 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 891/891 constraints, ReadFeed: 932/932 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem EisenbergMcGuire-PT-09-ReachabilityFireability-2024-05 is UNSAT
FORMULA EisenbergMcGuire-PT-09-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/90 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/90 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 800/889 variables, 18/108 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/889 variables, 800/908 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/889 variables, 7/915 constraints. Problems are: Problem set: 3 solved, 9 unsolved
[2024-06-01 09:29:38] [INFO ] Deduced a trap composed of 214 places in 1160 ms of which 116 ms to minimize.
[2024-06-01 09:29:39] [INFO ] Deduced a trap composed of 91 places in 879 ms of which 9 ms to minimize.
[2024-06-01 09:29:41] [INFO ] Deduced a trap composed of 3 places in 1307 ms of which 16 ms to minimize.
[2024-06-01 09:29:42] [INFO ] Deduced a trap composed of 26 places in 1262 ms of which 14 ms to minimize.
SMT process timed out in 10675ms, After SMT, problems are : Problem set: 3 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 891 transition count 3881
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 884 transition count 3881
Performed 242 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 242 Pre rules applied. Total rules applied 14 place count 884 transition count 3639
Deduced a syphon composed of 242 places in 9 ms
Reduce places removed 242 places and 0 transitions.
Iterating global reduction 2 with 484 rules applied. Total rules applied 498 place count 642 transition count 3639
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 564 place count 576 transition count 3045
Iterating global reduction 2 with 66 rules applied. Total rules applied 630 place count 576 transition count 3045
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 14 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 768 place count 507 transition count 2976
Applied a total of 768 rules in 698 ms. Remains 507 /891 variables (removed 384) and now considering 2976/3888 (removed 912) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 716 ms. Remains : 507/891 places, 2976/3888 transitions.
RANDOM walk for 40000 steps (8 resets) in 792 ms. (50 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 156310 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 9
Probabilistic random walk after 156310 steps, saw 107119 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2024-06-01 09:29:46] [INFO ] Flow matrix only has 897 transitions (discarded 2079 similar events)
// Phase 1: matrix 897 rows 507 cols
[2024-06-01 09:29:46] [INFO ] Computed 28 invariants in 5 ms
[2024-06-01 09:29:46] [INFO ] State equation strengthened by 404 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 427/493 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/503 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 4/507 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 897/1404 variables, 507/535 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1404 variables, 404/939 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1404 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/1404 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1404/1404 variables, and 939 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2192 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 507/507 constraints, ReadFeed: 404/404 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 427/493 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 09:29:49] [INFO ] Deduced a trap composed of 3 places in 361 ms of which 5 ms to minimize.
[2024-06-01 09:29:50] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 3 ms to minimize.
[2024-06-01 09:29:50] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 1 ms to minimize.
[2024-06-01 09:29:50] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 3 ms to minimize.
[2024-06-01 09:29:50] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:29:51] [INFO ] Deduced a trap composed of 105 places in 673 ms of which 7 ms to minimize.
[2024-06-01 09:29:52] [INFO ] Deduced a trap composed of 98 places in 772 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/493 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/503 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 09:29:52] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 4/507 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 09:29:53] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:29:53] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
[2024-06-01 09:29:53] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 3 ms to minimize.
[2024-06-01 09:29:54] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 2 ms to minimize.
[2024-06-01 09:29:54] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 2 ms to minimize.
[2024-06-01 09:29:54] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 2 ms to minimize.
[2024-06-01 09:29:54] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-06-01 09:29:54] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/507 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 09:29:55] [INFO ] Deduced a trap composed of 36 places in 681 ms of which 7 ms to minimize.
[2024-06-01 09:29:55] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 09:29:56] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 2 ms to minimize.
[2024-06-01 09:29:56] [INFO ] Deduced a trap composed of 26 places in 258 ms of which 3 ms to minimize.
[2024-06-01 09:29:57] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 09:29:57] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 897/1404 variables, 507/557 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1404 variables, 404/961 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1404 variables, 9/970 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 09:30:00] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-06-01 09:30:00] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 2 ms to minimize.
[2024-06-01 09:30:01] [INFO ] Deduced a trap composed of 75 places in 746 ms of which 7 ms to minimize.
[2024-06-01 09:30:02] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 3 ms to minimize.
[2024-06-01 09:30:02] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 3 ms to minimize.
[2024-06-01 09:30:03] [INFO ] Deduced a trap composed of 94 places in 873 ms of which 8 ms to minimize.
[2024-06-01 09:30:03] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1404 variables, 7/977 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 09:30:05] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 2 ms to minimize.
[2024-06-01 09:30:05] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2024-06-01 09:30:05] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 3 ms to minimize.
[2024-06-01 09:30:06] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1404 variables, 4/981 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 09:30:07] [INFO ] Deduced a trap composed of 27 places in 250 ms of which 3 ms to minimize.
[2024-06-01 09:30:07] [INFO ] Deduced a trap composed of 26 places in 285 ms of which 3 ms to minimize.
[2024-06-01 09:30:08] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1404 variables, 3/984 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1404 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 09:30:12] [INFO ] Deduced a trap composed of 59 places in 768 ms of which 7 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/1404 variables, 1/985 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1404 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 0/1404 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1404/1404 variables, and 985 constraints, problems are : Problem set: 0 solved, 9 unsolved in 26819 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 507/507 constraints, ReadFeed: 404/404 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 37/37 constraints]
After SMT, in 29169ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 18152 ms.
Support contains 66 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2976/2976 transitions.
Applied a total of 0 rules in 196 ms. Remains 507 /507 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 507/507 places, 2976/2976 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2976/2976 transitions.
Applied a total of 0 rules in 185 ms. Remains 507 /507 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
[2024-06-01 09:30:34] [INFO ] Flow matrix only has 897 transitions (discarded 2079 similar events)
[2024-06-01 09:30:34] [INFO ] Invariant cache hit.
[2024-06-01 09:30:35] [INFO ] Implicit Places using invariants in 693 ms returned []
[2024-06-01 09:30:35] [INFO ] Flow matrix only has 897 transitions (discarded 2079 similar events)
[2024-06-01 09:30:35] [INFO ] Invariant cache hit.
[2024-06-01 09:30:35] [INFO ] State equation strengthened by 404 read => feed constraints.
[2024-06-01 09:30:39] [INFO ] Implicit Places using invariants and state equation in 4336 ms returned []
Implicit Place search using SMT with State Equation took 5042 ms to find 0 implicit places.
[2024-06-01 09:30:39] [INFO ] Redundant transitions in 339 ms returned []
Running 2967 sub problems to find dead transitions.
[2024-06-01 09:30:40] [INFO ] Flow matrix only has 897 transitions (discarded 2079 similar events)
[2024-06-01 09:30:40] [INFO ] Invariant cache hit.
[2024-06-01 09:30:40] [INFO ] State equation strengthened by 404 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2967 unsolved
SMT process timed out in 33285ms, After SMT, problems are : Problem set: 0 solved, 2967 unsolved
Search for dead transitions found 0 dead transitions in 33371ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38975 ms. Remains : 507/507 places, 2976/2976 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2033 edges and 507 vertex of which 80 / 507 are part of one of the 9 SCC in 9 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 265 transitions
Ensure Unique test removed 2061 transitions
Reduce isomorphic transitions removed 2326 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 436 transition count 579
Reduce places removed 71 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 75 rules applied. Total rules applied 147 place count 365 transition count 575
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 152 place count 361 transition count 574
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 152 place count 361 transition count 561
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 181 place count 345 transition count 561
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 188 place count 338 transition count 554
Iterating global reduction 3 with 7 rules applied. Total rules applied 195 place count 338 transition count 554
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 431 place count 220 transition count 436
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 476 place count 220 transition count 391
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 478 place count 219 transition count 398
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 499 place count 219 transition count 377
Free-agglomeration rule applied 83 times.
Iterating global reduction 4 with 83 rules applied. Total rules applied 582 place count 219 transition count 294
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 4 with 83 rules applied. Total rules applied 665 place count 136 transition count 294
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 673 place count 136 transition count 294
Applied a total of 673 rules in 156 ms. Remains 136 /507 variables (removed 371) and now considering 294/2976 (removed 2682) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 294 rows 136 cols
[2024-06-01 09:31:13] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 09:31:13] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-01 09:31:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-06-01 09:31:13] [INFO ] [Nat]Absence check using 19 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-01 09:31:14] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-06-01 09:31:14] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
[2024-06-01 09:31:14] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
[2024-06-01 09:31:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:31:14] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:31:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 193 ms
[2024-06-01 09:31:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:31:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-06-01 09:31:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:31:14] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:31:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
TRAPS : Iteration 1
[2024-06-01 09:31:14] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:31:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-06-01 09:31:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:31:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
TRAPS : Iteration 2
[2024-06-01 09:31:15] [INFO ] After 1865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-06-01 09:31:16] [INFO ] After 2369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Over-approximation ignoring read arcs solved 0 properties in 2722 ms.
[2024-06-01 09:31:16] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-06-01 09:31:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 507 places, 2976 transitions and 15780 arcs took 47 ms.
[2024-06-01 09:31:17] [INFO ] Flatten gal took : 481 ms
Total runtime 110773 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 : EisenbergMcGuire-PT-09-ReachabilityFireability-2024-00
Could not compute solution for formula : EisenbergMcGuire-PT-09-ReachabilityFireability-2024-01
Could not compute solution for formula : EisenbergMcGuire-PT-09-ReachabilityFireability-2024-06
Could not compute solution for formula : EisenbergMcGuire-PT-09-ReachabilityFireability-2023-08
Could not compute solution for formula : EisenbergMcGuire-PT-09-ReachabilityFireability-2024-09
Could not compute solution for formula : EisenbergMcGuire-PT-09-ReachabilityFireability-2023-10
Could not compute solution for formula : EisenbergMcGuire-PT-09-ReachabilityFireability-2023-13
Could not compute solution for formula : EisenbergMcGuire-PT-09-ReachabilityFireability-2024-14
Could not compute solution for formula : EisenbergMcGuire-PT-09-ReachabilityFireability-2024-15

BK_STOP 1717234277466

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name EisenbergMcGuire-PT-09-ReachabilityFireability-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/698/inv_0_
rfs formula name EisenbergMcGuire-PT-09-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/698/inv_1_
rfs formula name EisenbergMcGuire-PT-09-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/698/inv_2_
rfs formula name EisenbergMcGuire-PT-09-ReachabilityFireability-2023-08
rfs formula type AG
rfs formula formula --invariant=/tmp/698/inv_3_
rfs formula name EisenbergMcGuire-PT-09-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/698/inv_4_
rfs formula name EisenbergMcGuire-PT-09-ReachabilityFireability-2023-10
rfs formula type EF
rfs formula formula --invariant=/tmp/698/inv_5_
rfs formula name EisenbergMcGuire-PT-09-ReachabilityFireability-2023-13
rfs formula type EF
rfs formula formula --invariant=/tmp/698/inv_6_
rfs formula name EisenbergMcGuire-PT-09-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/698/inv_7_
rfs formula name EisenbergMcGuire-PT-09-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/698/inv_8_
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="EisenbergMcGuire-PT-09"
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 EisenbergMcGuire-PT-09, 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 r492-smll-171636266400199"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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