Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r105-tall-167814481500678.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DLCround-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481500678
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.5K Feb 25 18:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 18:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 25 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 813K Mar 5 18:22 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 DLCround-PT-06b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678358868469

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-06b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 10:47:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 10:47:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 10:47:50] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2023-03-09 10:47:50] [INFO ] Transformed 2340 places.
[2023-03-09 10:47:50] [INFO ] Transformed 3456 transitions.
[2023-03-09 10:47:50] [INFO ] Found NUPN structural information;
[2023-03-09 10:47:50] [INFO ] Parsed PT model containing 2340 places and 3456 transitions and 9288 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-06b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 14) seen :11
FORMULA DLCround-PT-06b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3456 rows 2340 cols
[2023-03-09 10:47:51] [INFO ] Computed 109 place invariants in 43 ms
[2023-03-09 10:47:51] [INFO ] After 695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 10:47:52] [INFO ] [Nat]Absence check using 109 positive place invariants in 128 ms returned sat
[2023-03-09 10:47:54] [INFO ] After 1519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 10:47:54] [INFO ] Deduced a trap composed of 159 places in 494 ms of which 33 ms to minimize.
[2023-03-09 10:47:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 754 ms
[2023-03-09 10:47:55] [INFO ] After 2820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 329 ms.
[2023-03-09 10:47:55] [INFO ] After 3832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 47 ms.
Support contains 25 out of 2340 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2340/2340 places, 3456/3456 transitions.
Graph (trivial) has 2176 edges and 2340 vertex of which 388 / 2340 are part of one of the 33 SCC in 10 ms
Free SCC test removed 355 places
Drop transitions removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 897 place count 1985 transition count 2160
Reduce places removed 896 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 954 rules applied. Total rules applied 1851 place count 1089 transition count 2102
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 34 rules applied. Total rules applied 1885 place count 1063 transition count 2094
Reduce places removed 4 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 3 with 15 rules applied. Total rules applied 1900 place count 1059 transition count 2083
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1911 place count 1048 transition count 2083
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 1911 place count 1048 transition count 2073
Deduced a syphon composed of 10 places in 7 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 1931 place count 1038 transition count 2073
Discarding 273 places :
Symmetric choice reduction at 5 with 273 rule applications. Total rules 2204 place count 765 transition count 1800
Iterating global reduction 5 with 273 rules applied. Total rules applied 2477 place count 765 transition count 1800
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 113 Pre rules applied. Total rules applied 2477 place count 765 transition count 1687
Deduced a syphon composed of 113 places in 9 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 5 with 226 rules applied. Total rules applied 2703 place count 652 transition count 1687
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 2749 place count 606 transition count 1245
Iterating global reduction 5 with 46 rules applied. Total rules applied 2795 place count 606 transition count 1245
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2808 place count 606 transition count 1232
Performed 158 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 6 with 316 rules applied. Total rules applied 3124 place count 448 transition count 1067
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 3129 place count 448 transition count 1062
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 3132 place count 445 transition count 1032
Iterating global reduction 7 with 3 rules applied. Total rules applied 3135 place count 445 transition count 1032
Performed 59 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 7 with 118 rules applied. Total rules applied 3253 place count 386 transition count 1548
Drop transitions removed 79 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 7 with 80 rules applied. Total rules applied 3333 place count 386 transition count 1468
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 3351 place count 368 transition count 1100
Iterating global reduction 8 with 18 rules applied. Total rules applied 3369 place count 368 transition count 1100
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 8 with 35 rules applied. Total rules applied 3404 place count 368 transition count 1065
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 3408 place count 366 transition count 1090
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 3412 place count 366 transition count 1086
Drop transitions removed 124 transitions
Redundant transition composition rules discarded 124 transitions
Iterating global reduction 10 with 124 rules applied. Total rules applied 3536 place count 366 transition count 962
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 3542 place count 360 transition count 890
Iterating global reduction 10 with 6 rules applied. Total rules applied 3548 place count 360 transition count 890
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3554 place count 360 transition count 884
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3556 place count 359 transition count 897
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 3557 place count 359 transition count 896
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 12 with 13 rules applied. Total rules applied 3570 place count 359 transition count 883
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3572 place count 358 transition count 896
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 3573 place count 358 transition count 895
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 13 with 13 rules applied. Total rules applied 3586 place count 358 transition count 882
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3588 place count 357 transition count 895
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3589 place count 357 transition count 894
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 3590 place count 357 transition count 893
Free-agglomeration rule applied 169 times with reduction of 85 identical transitions.
Iterating global reduction 14 with 169 rules applied. Total rules applied 3759 place count 357 transition count 639
Reduce places removed 169 places and 0 transitions.
Drop transitions removed 215 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 220 transitions.
Graph (complete) has 504 edges and 188 vertex of which 168 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 14 with 390 rules applied. Total rules applied 4149 place count 168 transition count 418
Drop transitions removed 8 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 15 with 21 rules applied. Total rules applied 4170 place count 168 transition count 397
Discarding 28 places :
Symmetric choice reduction at 16 with 28 rule applications. Total rules 4198 place count 140 transition count 343
Iterating global reduction 16 with 28 rules applied. Total rules applied 4226 place count 140 transition count 343
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 4232 place count 140 transition count 337
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 17 with 39 rules applied. Total rules applied 4271 place count 140 transition count 298
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 378 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 3 rules applied. Total rules applied 4274 place count 136 transition count 298
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 4277 place count 136 transition count 295
Discarding 7 places :
Symmetric choice reduction at 19 with 7 rule applications. Total rules 4284 place count 129 transition count 283
Iterating global reduction 19 with 7 rules applied. Total rules applied 4291 place count 129 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 4293 place count 128 transition count 298
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 4299 place count 128 transition count 292
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 20 with 6 rules applied. Total rules applied 4305 place count 128 transition count 286
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 4306 place count 128 transition count 286
Applied a total of 4306 rules in 598 ms. Remains 128 /2340 variables (removed 2212) and now considering 286/3456 (removed 3170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 598 ms. Remains : 128/2340 places, 286/3456 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :2
FORMULA DLCround-PT-06b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 10:47:56] [INFO ] Flow matrix only has 209 transitions (discarded 77 similar events)
// Phase 1: matrix 209 rows 128 cols
[2023-03-09 10:47:56] [INFO ] Computed 56 place invariants in 4 ms
[2023-03-09 10:47:56] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 10:47:56] [INFO ] [Nat]Absence check using 56 positive place invariants in 7 ms returned sat
[2023-03-09 10:47:56] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 10:47:56] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-09 10:47:56] [INFO ] After 28ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 10:47:56] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 10:47:56] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 18 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 286/286 transitions.
Graph (trivial) has 17 edges and 128 vertex of which 2 / 128 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 354 edges and 127 vertex of which 122 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 122 transition count 276
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 6 place count 122 transition count 275
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 121 transition count 275
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 118 transition count 272
Drop transitions removed 6 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 330 edges and 118 vertex of which 115 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 9 rules applied. Total rules applied 23 place count 115 transition count 264
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 115 transition count 262
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 28 place count 112 transition count 257
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 112 transition count 257
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 35 place count 112 transition count 253
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 112 transition count 252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 111 transition count 252
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 43 place count 111 transition count 246
Applied a total of 43 rules in 22 ms. Remains 111 /128 variables (removed 17) and now considering 246/286 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 111/128 places, 246/286 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1425140 steps, run timeout after 3001 ms. (steps per millisecond=474 ) properties seen :{}
Probabilistic random walk after 1425140 steps, saw 914782 distinct states, run finished after 3002 ms. (steps per millisecond=474 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 10:47:59] [INFO ] Flow matrix only has 183 transitions (discarded 63 similar events)
// Phase 1: matrix 183 rows 111 cols
[2023-03-09 10:47:59] [INFO ] Computed 50 place invariants in 8 ms
[2023-03-09 10:47:59] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 10:47:59] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2023-03-09 10:48:00] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 10:48:00] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-09 10:48:00] [INFO ] After 30ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 10:48:00] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-09 10:48:00] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 246/246 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 111/111 places, 246/246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 246/246 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2023-03-09 10:48:00] [INFO ] Flow matrix only has 183 transitions (discarded 63 similar events)
[2023-03-09 10:48:00] [INFO ] Invariant cache hit.
[2023-03-09 10:48:00] [INFO ] Implicit Places using invariants in 215 ms returned [28, 31, 106, 109, 110]
Discarding 5 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 217 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/111 places, 244/246 transitions.
Graph (trivial) has 7 edges and 106 vertex of which 2 / 106 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 101 transition count 231
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 101 transition count 231
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 0 with 2 rules applied. Total rules applied 11 place count 100 transition count 230
Drop transitions removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 21 place count 100 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 99 transition count 219
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 99 transition count 219
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 32 place count 99 transition count 210
Graph (complete) has 265 edges and 99 vertex of which 82 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 82 transition count 191
Drop transitions removed 9 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 67 place count 82 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 81 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 81 transition count 156
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 81 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 80 transition count 155
Applied a total of 71 rules in 16 ms. Remains 80 /106 variables (removed 26) and now considering 155/244 (removed 89) transitions.
[2023-03-09 10:48:00] [INFO ] Flow matrix only has 123 transitions (discarded 32 similar events)
// Phase 1: matrix 123 rows 80 cols
[2023-03-09 10:48:00] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-09 10:48:00] [INFO ] Implicit Places using invariants in 44 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 79/111 places, 155/246 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 79 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 78 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 78 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 77 transition count 153
Applied a total of 4 rules in 4 ms. Remains 77 /79 variables (removed 2) and now considering 153/155 (removed 2) transitions.
[2023-03-09 10:48:00] [INFO ] Flow matrix only has 121 transitions (discarded 32 similar events)
// Phase 1: matrix 121 rows 77 cols
[2023-03-09 10:48:00] [INFO ] Computed 29 place invariants in 2 ms
[2023-03-09 10:48:00] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-09 10:48:00] [INFO ] Flow matrix only has 121 transitions (discarded 32 similar events)
[2023-03-09 10:48:00] [INFO ] Invariant cache hit.
[2023-03-09 10:48:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-09 10:48:00] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 77/111 places, 153/246 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 558 ms. Remains : 77/111 places, 153/246 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1980504 steps, run timeout after 3011 ms. (steps per millisecond=657 ) properties seen :{}
Probabilistic random walk after 1980504 steps, saw 1155702 distinct states, run finished after 3011 ms. (steps per millisecond=657 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 10:48:03] [INFO ] Flow matrix only has 121 transitions (discarded 32 similar events)
[2023-03-09 10:48:03] [INFO ] Invariant cache hit.
[2023-03-09 10:48:03] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 10:48:03] [INFO ] [Nat]Absence check using 29 positive place invariants in 4 ms returned sat
[2023-03-09 10:48:03] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 10:48:03] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-09 10:48:03] [INFO ] After 15ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 10:48:03] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 10:48:03] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 153/153 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 77/77 places, 153/153 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 153/153 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 153/153 (removed 0) transitions.
[2023-03-09 10:48:03] [INFO ] Flow matrix only has 121 transitions (discarded 32 similar events)
[2023-03-09 10:48:03] [INFO ] Invariant cache hit.
[2023-03-09 10:48:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-09 10:48:03] [INFO ] Flow matrix only has 121 transitions (discarded 32 similar events)
[2023-03-09 10:48:03] [INFO ] Invariant cache hit.
[2023-03-09 10:48:03] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-09 10:48:04] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-09 10:48:04] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 10:48:04] [INFO ] Flow matrix only has 121 transitions (discarded 32 similar events)
[2023-03-09 10:48:04] [INFO ] Invariant cache hit.
[2023-03-09 10:48:04] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 77/77 places, 153/153 transitions.
Graph (trivial) has 62 edges and 77 vertex of which 24 / 77 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions removed 38 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 79 transitions.
Graph (complete) has 108 edges and 65 vertex of which 54 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 54 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 53 transition count 73
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 49 transition count 66
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 49 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 49 transition count 65
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 46 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 23 place count 46 transition count 58
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 36 place count 46 transition count 45
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 41 place count 42 transition count 44
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 43 place count 41 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 44 place count 40 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 44 place count 40 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 46 place count 39 transition count 42
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 47 place count 39 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 48 place count 38 transition count 41
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 50 place count 38 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 51 place count 37 transition count 40
Applied a total of 51 rules in 11 ms. Remains 37 /77 variables (removed 40) and now considering 40/153 (removed 113) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 40 rows 37 cols
[2023-03-09 10:48:04] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-09 10:48:04] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 10:48:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-09 10:48:04] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 10:48:04] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 10:48:04] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-09 10:48:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-09 10:48:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 77 places, 153 transitions and 625 arcs took 2 ms.
[2023-03-09 10:48:04] [INFO ] Flatten gal took : 40 ms
Total runtime 14233 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/523/inv_0_ --inv-par
FORMULA DLCround-PT-06b-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678358886176

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name DLCround-PT-06b-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/523/inv_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 77 places, 153 transitions and 625 arcs
pnml2lts-sym: Petri net DLCround_PT_06b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 153->117 groups
pnml2lts-sym: Regrouping took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 77; there are 117 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/523/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 0.060 real 0.210 user 0.020 sys
pnml2lts-sym: max token count: 6

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="DLCround-PT-06b"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is DLCround-PT-06b, 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 r105-tall-167814481500678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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