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.r508-tall-171654352000598.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 NoC3x3-PT-3B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654352000598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 07:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 07:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 12 07:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 581K 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 NoC3x3-PT-3B-ReachabilityCardinality-2024-00
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-01
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-02
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-03
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-04
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-05
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-06
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-07
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-08
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-09
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-10
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-11
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-12
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-13
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-14
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717241040105

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:24:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:24:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:24:01] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-06-01 11:24:01] [INFO ] Transformed 2117 places.
[2024-06-01 11:24:01] [INFO ] Transformed 2435 transitions.
[2024-06-01 11:24:01] [INFO ] Found NUPN structural information;
[2024-06-01 11:24:01] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (65 resets) in 1453 ms. (27 steps per ms) remains 6/12 properties
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
// Phase 1: matrix 2435 rows 2117 cols
[2024-06-01 11:24:02] [INFO ] Computed 66 invariants in 45 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem NoC3x3-PT-3B-ReachabilityCardinality-2024-05 is UNSAT
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1820/1895 variables, 52/127 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1895 variables, 1820/1947 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1895 variables, 0/1947 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 222/2117 variables, 14/1961 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2117 variables, 222/2183 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2117 variables, 0/2183 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2435/4552 variables, 2117/4300 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4552 variables, 0/4300 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/4552 variables, 0/4300 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4552/4552 variables, and 4300 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2429 ms.
Refiners :[Domain max(s): 2117/2117 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2117/2117 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1610/1652 variables, 45/87 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1652 variables, 1610/1697 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 11:24:06] [INFO ] Deduced a trap composed of 56 places in 392 ms of which 42 ms to minimize.
[2024-06-01 11:24:06] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 5 ms to minimize.
[2024-06-01 11:24:06] [INFO ] Deduced a trap composed of 71 places in 277 ms of which 12 ms to minimize.
[2024-06-01 11:24:06] [INFO ] Deduced a trap composed of 107 places in 199 ms of which 5 ms to minimize.
[2024-06-01 11:24:07] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 3 ms to minimize.
[2024-06-01 11:24:07] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 2 ms to minimize.
[2024-06-01 11:24:07] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-06-01 11:24:07] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 3 ms to minimize.
[2024-06-01 11:24:07] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:24:07] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2024-06-01 11:24:07] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-06-01 11:24:08] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-06-01 11:24:08] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 1 ms to minimize.
[2024-06-01 11:24:08] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 2 ms to minimize.
[2024-06-01 11:24:08] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-06-01 11:24:08] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 2 ms to minimize.
[2024-06-01 11:24:08] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-06-01 11:24:08] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 2 ms to minimize.
[2024-06-01 11:24:08] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1652 variables, 19/1716 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1652 variables, 0/1716 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 465/2117 variables, 21/1737 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2117 variables, 465/2202 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 11:24:09] [INFO ] Deduced a trap composed of 19 places in 356 ms of which 6 ms to minimize.
[2024-06-01 11:24:10] [INFO ] Deduced a trap composed of 35 places in 364 ms of which 7 ms to minimize.
[2024-06-01 11:24:10] [INFO ] Deduced a trap composed of 51 places in 356 ms of which 7 ms to minimize.
SMT process timed out in 7986ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 2117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1665 edges and 2117 vertex of which 56 / 2117 are part of one of the 7 SCC in 10 ms
Free SCC test removed 49 places
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 422 rules applied. Total rules applied 423 place count 2063 transition count 1962
Reduce places removed 417 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 423 rules applied. Total rules applied 846 place count 1646 transition count 1956
Reduce places removed 3 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 16 rules applied. Total rules applied 862 place count 1643 transition count 1943
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 875 place count 1630 transition count 1943
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 875 place count 1630 transition count 1919
Deduced a syphon composed of 24 places in 13 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 923 place count 1606 transition count 1919
Discarding 351 places :
Symmetric choice reduction at 4 with 351 rule applications. Total rules 1274 place count 1255 transition count 1568
Iterating global reduction 4 with 351 rules applied. Total rules applied 1625 place count 1255 transition count 1568
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 1625 place count 1255 transition count 1535
Deduced a syphon composed of 33 places in 10 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 1691 place count 1222 transition count 1535
Discarding 126 places :
Symmetric choice reduction at 4 with 126 rule applications. Total rules 1817 place count 1096 transition count 1372
Iterating global reduction 4 with 126 rules applied. Total rules applied 1943 place count 1096 transition count 1372
Discarding 119 places :
Symmetric choice reduction at 4 with 119 rule applications. Total rules 2062 place count 977 transition count 1240
Iterating global reduction 4 with 119 rules applied. Total rules applied 2181 place count 977 transition count 1240
Discarding 47 places :
Symmetric choice reduction at 4 with 47 rule applications. Total rules 2228 place count 930 transition count 1157
Iterating global reduction 4 with 47 rules applied. Total rules applied 2275 place count 930 transition count 1157
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 14 rules applied. Total rules applied 2289 place count 929 transition count 1144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2290 place count 928 transition count 1144
Discarding 35 places :
Symmetric choice reduction at 6 with 35 rule applications. Total rules 2325 place count 893 transition count 1109
Iterating global reduction 6 with 35 rules applied. Total rules applied 2360 place count 893 transition count 1109
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 8 rules applied. Total rules applied 2368 place count 889 transition count 1105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2372 place count 885 transition count 1105
Discarding 22 places :
Symmetric choice reduction at 8 with 22 rule applications. Total rules 2394 place count 863 transition count 1061
Iterating global reduction 8 with 22 rules applied. Total rules applied 2416 place count 863 transition count 1061
Discarding 22 places :
Symmetric choice reduction at 8 with 22 rule applications. Total rules 2438 place count 841 transition count 1039
Iterating global reduction 8 with 22 rules applied. Total rules applied 2460 place count 841 transition count 1039
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 27 rules applied. Total rules applied 2487 place count 838 transition count 1015
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2490 place count 835 transition count 1015
Performed 315 Post agglomeration using F-continuation condition.Transition count delta: 315
Deduced a syphon composed of 315 places in 0 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 10 with 630 rules applied. Total rules applied 3120 place count 520 transition count 700
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 3134 place count 506 transition count 684
Iterating global reduction 10 with 14 rules applied. Total rules applied 3148 place count 506 transition count 684
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 3156 place count 498 transition count 668
Iterating global reduction 10 with 8 rules applied. Total rules applied 3164 place count 498 transition count 668
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 3165 place count 497 transition count 666
Iterating global reduction 10 with 1 rules applied. Total rules applied 3166 place count 497 transition count 666
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3168 place count 496 transition count 665
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 10 with 38 rules applied. Total rules applied 3206 place count 477 transition count 718
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 3207 place count 476 transition count 716
Iterating global reduction 10 with 1 rules applied. Total rules applied 3208 place count 476 transition count 716
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3209 place count 476 transition count 715
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 3210 place count 476 transition count 714
Free-agglomeration rule applied 18 times.
Iterating global reduction 11 with 18 rules applied. Total rules applied 3228 place count 476 transition count 696
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 24 rules applied. Total rules applied 3252 place count 458 transition count 690
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 3254 place count 458 transition count 688
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 3258 place count 458 transition count 684
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 3262 place count 454 transition count 684
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 3267 place count 454 transition count 684
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 3271 place count 454 transition count 684
Applied a total of 3271 rules in 1095 ms. Remains 454 /2117 variables (removed 1663) and now considering 684/2435 (removed 1751) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1122 ms. Remains : 454/2117 places, 684/2435 transitions.
RANDOM walk for 40000 steps (386 resets) in 1098 ms. (36 steps per ms) remains 3/5 properties
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (29 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (27 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (30 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
// Phase 1: matrix 684 rows 454 cols
[2024-06-01 11:24:12] [INFO ] Computed 55 invariants in 14 ms
[2024-06-01 11:24:12] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 278/314 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 93/407 variables, 16/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 674/1081 variables, 407/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 61/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 57/1138 variables, 47/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1138 variables, 10/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1138 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1138 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1138/1138 variables, and 580 constraints, problems are : Problem set: 0 solved, 3 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 454/454 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 278/314 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 11:24:12] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:24:12] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:24:12] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:24:12] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 93/407 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 11:24:13] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:24:13] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:24:13] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:24:13] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:24:13] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 674/1081 variables, 407/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 61/532 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1081 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1081 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 57/1138 variables, 47/580 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1138 variables, 10/590 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1138 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1138 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1138 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1138/1138 variables, and 592 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1143 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 454/454 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 1675ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 265 ms.
Support contains 12 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 684/684 transitions.
Graph (trivial) has 61 edges and 454 vertex of which 4 / 454 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 452 transition count 671
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 443 transition count 671
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 19 place count 443 transition count 665
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 31 place count 437 transition count 665
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 37 place count 431 transition count 659
Iterating global reduction 2 with 6 rules applied. Total rules applied 43 place count 431 transition count 659
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 429 transition count 656
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 429 transition count 656
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 73 place count 416 transition count 643
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 83 place count 406 transition count 629
Iterating global reduction 2 with 10 rules applied. Total rules applied 93 place count 406 transition count 629
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 406 transition count 627
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 401 transition count 617
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 401 transition count 617
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 108 place count 401 transition count 614
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 399 transition count 610
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 399 transition count 610
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 114 place count 399 transition count 608
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 122 place count 395 transition count 629
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 124 place count 393 transition count 621
Iterating global reduction 5 with 2 rules applied. Total rules applied 126 place count 393 transition count 621
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 127 place count 392 transition count 616
Iterating global reduction 5 with 1 rules applied. Total rules applied 128 place count 392 transition count 616
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 129 place count 391 transition count 614
Iterating global reduction 5 with 1 rules applied. Total rules applied 130 place count 391 transition count 614
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 136 place count 391 transition count 608
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 145 place count 391 transition count 599
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 157 place count 382 transition count 596
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 158 place count 382 transition count 596
Applied a total of 158 rules in 153 ms. Remains 382 /454 variables (removed 72) and now considering 596/684 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 382/454 places, 596/684 transitions.
RANDOM walk for 40000 steps (510 resets) in 264 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (27 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 603760 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 1
Probabilistic random walk after 603760 steps, saw 142696 distinct states, run finished after 3004 ms. (steps per millisecond=200 ) properties seen :0
// Phase 1: matrix 596 rows 382 cols
[2024-06-01 11:24:17] [INFO ] Computed 55 invariants in 5 ms
[2024-06-01 11:24:17] [INFO ] State equation strengthened by 74 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/105 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 231/336 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 583/919 variables, 336/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/919 variables, 61/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/919 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/978 variables, 46/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/978 variables, 13/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/978 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/978 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 978/978 variables, and 511 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 382/382 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/105 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 231/336 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:24:17] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:24:17] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:24:17] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:24:17] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 4 ms to minimize.
[2024-06-01 11:24:18] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:24:18] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 11:24:18] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:24:18] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 583/919 variables, 336/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/919 variables, 61/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/919 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 59/978 variables, 46/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/978 variables, 13/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/978 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/978 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:24:18] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/978 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/978 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/978 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 978/978 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 865 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 382/382 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 1160ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7290 steps, including 108 resets, run visited all 1 properties in 31 ms. (steps per millisecond=235 )
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 34 ms.
All properties solved without resorting to model-checking.
Total runtime 17360 ms.
ITS solved all properties within timeout

BK_STOP 1717241058670

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-3B"
export BK_EXAMINATION="ReachabilityCardinality"
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 NoC3x3-PT-3B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654352000598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3B.tgz
mv NoC3x3-PT-3B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;