fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r171-tall-167838858800550
Last Updated
May 14, 2023

About the Execution of Smart+red for FlexibleBarrier-PT-16b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3714.523 3600000.00 3666019.00 10492.30 TTFTTFFFTFFFFTTT normal

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.r171-tall-167838858800550.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 smartxred
Input is FlexibleBarrier-PT-16b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858800550
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 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 945K 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 FlexibleBarrier-PT-16b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679480493979

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-16b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 10:21:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 10:21:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 10:21:35] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2023-03-22 10:21:35] [INFO ] Transformed 3472 places.
[2023-03-22 10:21:35] [INFO ] Transformed 4001 transitions.
[2023-03-22 10:21:35] [INFO ] Found NUPN structural information;
[2023-03-22 10:21:35] [INFO ] Parsed PT model containing 3472 places and 4001 transitions and 10043 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 91 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 10) seen :2
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 4001 rows 3472 cols
[2023-03-22 10:21:36] [INFO ] Computed 18 place invariants in 95 ms
[2023-03-22 10:21:37] [INFO ] After 1129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 10:21:38] [INFO ] [Nat]Absence check using 18 positive place invariants in 40 ms returned sat
[2023-03-22 10:21:42] [INFO ] After 3009ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 10:21:44] [INFO ] Deduced a trap composed of 28 places in 2045 ms of which 10 ms to minimize.
[2023-03-22 10:21:46] [INFO ] Deduced a trap composed of 371 places in 1937 ms of which 3 ms to minimize.
[2023-03-22 10:21:48] [INFO ] Deduced a trap composed of 243 places in 1939 ms of which 3 ms to minimize.
[2023-03-22 10:21:48] [INFO ] Deduced a trap composed of 384 places in 254 ms of which 2 ms to minimize.
[2023-03-22 10:21:49] [INFO ] Deduced a trap composed of 92 places in 273 ms of which 1 ms to minimize.
[2023-03-22 10:21:49] [INFO ] Deduced a trap composed of 303 places in 381 ms of which 1 ms to minimize.
[2023-03-22 10:21:50] [INFO ] Deduced a trap composed of 423 places in 187 ms of which 1 ms to minimize.
[2023-03-22 10:21:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 8048 ms
[2023-03-22 10:21:52] [INFO ] Deduced a trap composed of 295 places in 1655 ms of which 3 ms to minimize.
[2023-03-22 10:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1906 ms
[2023-03-22 10:21:54] [INFO ] Deduced a trap composed of 286 places in 1867 ms of which 2 ms to minimize.
[2023-03-22 10:21:56] [INFO ] Deduced a trap composed of 1204 places in 1637 ms of which 2 ms to minimize.
[2023-03-22 10:21:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3864 ms
[2023-03-22 10:21:59] [INFO ] Deduced a trap composed of 1265 places in 1925 ms of which 3 ms to minimize.
[2023-03-22 10:22:01] [INFO ] Deduced a trap composed of 1190 places in 1870 ms of which 3 ms to minimize.
[2023-03-22 10:22:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4183 ms
[2023-03-22 10:22:01] [INFO ] After 22410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1082 ms.
[2023-03-22 10:22:02] [INFO ] After 24744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 176 ms.
Support contains 102 out of 3472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Graph (trivial) has 3242 edges and 3472 vertex of which 84 / 3472 are part of one of the 14 SCC in 14 ms
Free SCC test removed 70 places
Drop transitions removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Drop transitions removed 804 transitions
Trivial Post-agglo rules discarded 804 transitions
Performed 804 trivial Post agglomeration. Transition count delta: 804
Iterating post reduction 0 with 804 rules applied. Total rules applied 805 place count 3402 transition count 3113
Reduce places removed 804 places and 0 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 1 with 832 rules applied. Total rules applied 1637 place count 2598 transition count 3085
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 1665 place count 2570 transition count 3085
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 206 Pre rules applied. Total rules applied 1665 place count 2570 transition count 2879
Deduced a syphon composed of 206 places in 2 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 3 with 412 rules applied. Total rules applied 2077 place count 2364 transition count 2879
Discarding 1310 places :
Symmetric choice reduction at 3 with 1310 rule applications. Total rules 3387 place count 1054 transition count 1569
Iterating global reduction 3 with 1310 rules applied. Total rules applied 4697 place count 1054 transition count 1569
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4697 place count 1054 transition count 1565
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 4705 place count 1050 transition count 1565
Discarding 179 places :
Symmetric choice reduction at 3 with 179 rule applications. Total rules 4884 place count 871 transition count 1386
Iterating global reduction 3 with 179 rules applied. Total rules applied 5063 place count 871 transition count 1386
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 3 with 160 rules applied. Total rules applied 5223 place count 871 transition count 1226
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 5419 place count 773 transition count 1128
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 5447 place count 773 transition count 1100
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 5460 place count 760 transition count 1087
Iterating global reduction 5 with 13 rules applied. Total rules applied 5473 place count 760 transition count 1087
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 5475 place count 759 transition count 1087
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 5479 place count 759 transition count 1083
Free-agglomeration rule applied 534 times.
Iterating global reduction 5 with 534 rules applied. Total rules applied 6013 place count 759 transition count 549
Reduce places removed 534 places and 0 transitions.
Drop transitions removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 5 with 678 rules applied. Total rules applied 6691 place count 225 transition count 405
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 6 with 38 rules applied. Total rules applied 6729 place count 225 transition count 367
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 6732 place count 225 transition count 367
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 6733 place count 225 transition count 366
Applied a total of 6733 rules in 825 ms. Remains 225 /3472 variables (removed 3247) and now considering 366/4001 (removed 3635) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 825 ms. Remains : 225/3472 places, 366/4001 transitions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 7) seen :5
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 10:22:03] [INFO ] Flow matrix only has 347 transitions (discarded 19 similar events)
// Phase 1: matrix 347 rows 225 cols
[2023-03-22 10:22:03] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-22 10:22:03] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 10:22:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-22 10:22:03] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 10:22:03] [INFO ] State equation strengthened by 187 read => feed constraints.
[2023-03-22 10:22:04] [INFO ] After 45ms SMT Verify possible using 187 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 10:22:04] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 10:22:04] [INFO ] After 260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 27 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 366/366 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 225 transition count 338
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 197 transition count 338
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 99 place count 154 transition count 295
Iterating global reduction 2 with 43 rules applied. Total rules applied 142 place count 154 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 144 place count 154 transition count 293
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 184 place count 134 transition count 273
Drop transitions removed 50 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 236 place count 134 transition count 221
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 238 place count 132 transition count 219
Iterating global reduction 4 with 2 rules applied. Total rules applied 240 place count 132 transition count 219
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 250 place count 132 transition count 209
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 262 place count 132 transition count 197
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 279 place count 120 transition count 192
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 283 place count 120 transition count 188
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 284 place count 120 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 285 place count 119 transition count 187
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 80 edges and 118 vertex of which 29 / 118 are part of one of the 14 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 288 place count 103 transition count 186
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 318 place count 102 transition count 157
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 16 Pre rules applied. Total rules applied 318 place count 102 transition count 141
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 350 place count 86 transition count 141
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 365 place count 86 transition count 126
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 397 place count 70 transition count 110
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 399 place count 70 transition count 108
Free-agglomeration rule applied 14 times.
Iterating global reduction 8 with 14 rules applied. Total rules applied 413 place count 70 transition count 94
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 33 rules applied. Total rules applied 446 place count 52 transition count 79
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 458 place count 52 transition count 67
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 460 place count 52 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 462 place count 50 transition count 65
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 463 place count 50 transition count 65
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 464 place count 50 transition count 65
Applied a total of 464 rules in 63 ms. Remains 50 /225 variables (removed 175) and now considering 65/366 (removed 301) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 50/225 places, 65/366 transitions.
Finished random walk after 4192 steps, including 1 resets, run visited all 2 properties in 17 ms. (steps per millisecond=246 )
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 28760 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FlexibleBarrier (PT), instance 16b
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 3472 places, 4001 transitions, 10043 arcs.
Final Score: 2151688.22
Took : 31 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-00 (reachable & potential(( ( ( ( ( 1 ) <= (tk(P1051)) ) | ( ( (tk(P3273)) <= ( 1 ) ) & ( ( ( (! ( ( (tk(P2542)) <= (tk(P284)) ) & ( ( 1 ) <= (tk(P1046)) ) )) | (! ( (tk(P342)) <= ( 1 ) )) ) & ( (tk(P3131)) <= (tk(P2460)) ) ) & ( (! ( (tk(P196)) <= (tk(P1187)) )) & (! ( ( 1 ) <= (tk(P85)) )) ) ) ) ) & ( ( ( 1 ) <= (tk(P2344)) ) | ( ( ( 1 ) <= (tk(P2221)) ) & (! ( ( ( ( 1 ) <= (tk(P705)) ) | ( ( ( 1 ) <= (tk(P2990)) ) | ( (tk(P2456)) <= (tk(P3102)) ) ) ) & ( ( ( (tk(P3024)) <= (tk(P1647)) ) & ( (tk(P1984)) <= ( 0 ) ) ) & ( (tk(P1108)) <= ( 1 ) ) ) )) ) ) ) & (! ( ( ( ( (! ( (! ( (tk(P1478)) <= (tk(P858)) )) & ( ( 1 ) <= (tk(P3232)) ) )) | ( ( ( ( (tk(P3363)) <= ( 1 ) ) | ( (tk(P101)) <= ( 0 ) ) ) | ( ( (tk(P1864)) <= (tk(P890)) ) | ( (tk(P1708)) <= ( 0 ) ) ) ) | ( ( ( 1 ) <= (tk(P1451)) ) | ( ( (tk(P611)) <= ( 0 ) ) | ( (tk(P3146)) <= (tk(P2898)) ) ) ) ) ) & (! ( (tk(P3428)) <= (tk(P2194)) )) ) & ( ( ( ( 1 ) <= (tk(P518)) ) & ( ( 1 ) <= (tk(P1146)) ) ) & ( ( 1 ) <= (tk(P2507)) ) ) ) & ( ( (tk(P2562)) <= (tk(P1227)) ) | (! ( (! ( (tk(P2479)) <= (tk(P818)) )) & ( (! ( (tk(P837)) <= ( 1 ) )) & ( ( ( ( 1 ) <= (tk(P1114)) ) & ( (tk(P653)) <= (tk(P265)) ) ) & (! ( (tk(P1650)) <= (tk(P2978)) )) ) ) )) ) )) )))
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-01 (reachable &!potential( ( (tk(P771)) <= ( 1 ) )))
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-02 (reachable &!potential( ( (! ( ( ( ( ( ( ( 1 ) <= (tk(P31)) ) & ( (tk(P2279)) <= ( 1 ) ) ) | ( ( ( 1 ) <= (tk(P1733)) ) & (! ( ( 1 ) <= (tk(P688)) )) ) ) | ( (tk(P2008)) <= (tk(P2837)) ) ) | (! ( ( 1 ) <= (tk(P307)) )) ) | ( ( (tk(P194)) <= (tk(P2059)) ) & ( ( (tk(P2687)) <= ( 1 ) ) | ( ( (tk(P2230)) <= ( 0 ) ) & ( ( ( (tk(P2417)) <= ( 0 ) ) & ( (tk(P3231)) <= ( 1 ) ) ) | ( (tk(P2022)) <= (tk(P934)) ) ) ) ) ) )) | (! ( ( ( ( ( ( (tk(P990)) <= ( 1 ) ) | ( ( ( ( 1 ) <= (tk(P3345)) ) | ( ( 1 ) <= (tk(P3367)) ) ) | ( (tk(P1907)) <= (tk(P1037)) ) ) ) | (! ( ( (tk(P230)) <= ( 1 ) ) & ( ( (tk(P73)) <= (tk(P3153)) ) & ( (tk(P2179)) <= (tk(P19)) ) ) )) ) & ( ( 1 ) <= (tk(P3401)) ) ) | (! ( (! ( (! ( (tk(P3)) <= ( 1 ) )) | ( ( (tk(P1858)) <= ( 1 ) ) & ( (tk(P2094)) <= ( 1 ) ) ) )) & ( (! ( (tk(P1869)) <= (tk(P2884)) )) & ( (tk(P1753)) <= ( 0 ) ) ) )) ) & (! ( ( ( (tk(P2867)) <= ( 0 ) ) | ( ( ( 1 ) <= (tk(P2338)) ) & (! ( ( 1 ) <= (tk(P1461)) )) ) ) | ( ( 1 ) <= (tk(P2328)) ) )) )) )))
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-03 (reachable & potential(( (! ( ( (tk(P1109)) <= (tk(P3041)) ) | ( ( ( (! ( ( 1 ) <= (tk(P1168)) )) & ( ( ( ( (tk(P2902)) <= (tk(P67)) ) & ( (tk(P2802)) <= (tk(P2591)) ) ) & ( ( (tk(P543)) <= ( 1 ) ) & ( (tk(P1831)) <= (tk(P3186)) ) ) ) & ( ( (tk(P2118)) <= (tk(P2325)) ) | ( ( ( 1 ) <= (tk(P154)) ) & ( ( 1 ) <= (tk(P795)) ) ) ) ) ) & (! ( ( 1 ) <= (tk(P601)) )) ) & ( ( ( ( ( ( (tk(P1587)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P76)) ) ) | (! ( ( 1 ) <= (tk(P2565)) )) ) & (! ( ( ( 1 ) <= (tk(P241)) ) | ( ( 1 ) <= (tk(P981)) ) )) ) | ( ( (tk(P2298)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P1600)) ) ) ) | (! ( (tk(P856)) <= (tk(P1225)) )) ) ) )) | ( ( 1 ) <= (tk(P1901)) ) )))
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-04 (reachable & potential(( (! ( (! ( ( (! ( (! ( (tk(P203)) <= (tk(P2638)) )) | ( (tk(P2014)) <= (tk(P472)) ) )) & ( ( (tk(P148)) <= (tk(P3270)) ) | ( (tk(P35)) <= (tk(P157)) ) ) ) & (! ( (tk(P2642)) <= ( 0 ) )) )) & ( (tk(P2549)) <= ( 1 ) ) )) & ( (tk(P63)) <= (tk(P738)) ) )))
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-05 (reachable &!potential( ( (tk(P1556)) <= ( 0 ) )))
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-06 (reachable & potential((! ( (tk(P700)) <= ( 1 ) ))))
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-07 (reachable & potential((! ( (tk(P2828)) <= ( 1 ) ))))
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-08 (reachable & potential(( ( (tk(P2981)) <= ( 1 ) ) & ( (! ( ( ( 1 ) <= (tk(P1400)) ) | ( ( 1 ) <= (tk(P29)) ) )) & ( ( ( ( ( ( (! ( (tk(P1437)) <= (tk(P2184)) )) & (! ( (tk(P1177)) <= ( 0 ) )) ) & ( ( 1 ) <= (tk(P873)) ) ) & ( (tk(P3221)) <= (tk(P1370)) ) ) & ( (tk(P1698)) <= ( 1 ) ) ) & ( ( ( (tk(P731)) <= (tk(P2355)) ) & ( ( (tk(P306)) <= ( 1 ) ) & ( (tk(P2134)) <= (tk(P2324)) ) ) ) & (! ( (! ( ( 1 ) <= (tk(P1725)) )) | (! ( ( (tk(P2895)) <= ( 0 ) ) | ( (tk(P352)) <= (tk(P2855)) ) )) )) ) ) & ( ( (tk(P1928)) <= (tk(P1900)) ) | (! ( ( (tk(P1204)) <= (tk(P638)) ) & ( ( ( ( (tk(P1819)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P2485)) ) ) & (! ( (tk(P1770)) <= ( 1 ) )) ) | ( (! ( (tk(P2759)) <= (tk(P482)) )) & (! ( (tk(P914)) <= ( 1 ) )) ) ) )) ) ) ) )))
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-09 (reachable & potential((! ( ( ( ( 1 ) <= (tk(P3049)) ) & (! ( ( (tk(P1425)) <= (tk(P1438)) ) | ( ( 1 ) <= (tk(P626)) ) )) ) | (! ( (! ( (tk(P2080)) <= ( 1 ) )) & ( ( ( ( ( 1 ) <= (tk(P2688)) ) & ( ( ( (tk(P1815)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P2803)) ) ) | ( ( 1 ) <= (tk(P2555)) ) ) ) & ( (tk(P1748)) <= ( 1 ) ) ) & (! ( (tk(P1741)) <= (tk(P1432)) )) ) )) ))))
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P1382)) <= (tk(P1115)) )))
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-11 (reachable & potential((! ( (tk(P1086)) <= ( 1 ) ))))
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-12 (reachable &!potential( (! ( ( (tk(P1591)) <= ( 0 ) ) & (! ( ( (tk(P3000)) <= (tk(P3277)) ) | (! ( ( 1 ) <= (tk(P250)) )) )) ))))
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-13 (reachable & potential(( ( ( (! ( (! ( ( 1 ) <= (tk(P1723)) )) | ( (! ( (tk(P1474)) <= ( 0 ) )) & ( ( 1 ) <= (tk(P1968)) ) ) )) & ( (! ( (tk(P2677)) <= (tk(P2824)) )) | ( (! ( ( ( ( ( 1 ) <= (tk(P403)) ) | ( ( 1 ) <= (tk(P206)) ) ) | (! ( (tk(P3435)) <= ( 0 ) )) ) & (! ( ( (tk(P1082)) <= (tk(P1415)) ) & ( ( 1 ) <= (tk(P129)) ) )) )) | ( (tk(P3083)) <= ( 0 ) ) ) ) ) & ( ( (tk(P448)) <= ( 0 ) ) & ( (tk(P686)) <= (tk(P626)) ) ) ) | ( ( ( ( (! ( ( ( ( (tk(P3448)) <= ( 1 ) ) & ( (tk(P2526)) <= ( 0 ) ) ) & ( ( (tk(P2171)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P2553)) ) ) ) & (! ( ( 1 ) <= (tk(P850)) )) )) | ( (tk(P2585)) <= (tk(P383)) ) ) | (! ( ( ( (! ( (tk(P1529)) <= ( 1 ) )) & (! ( (tk(P934)) <= ( 0 ) )) ) | ( ( ( ( 1 ) <= (tk(P2562)) ) | ( (tk(P803)) <= ( 0 ) ) ) | ( ( ( 1 ) <= (tk(P1017)) ) | ( (tk(P3465)) <= ( 0 ) ) ) ) ) | ( ( 1 ) <= (tk(P883)) ) )) ) & ( ( ( ( (tk(P782)) <= ( 1 ) ) | ( ( (! ( ( 1 ) <= (tk(P2942)) )) & ( ( 1 ) <= (tk(P632)) ) ) | ( (tk(P289)) <= (tk(P3103)) ) ) ) & ( (tk(P976)) <= (tk(P3108)) ) ) & (! ( (! ( ( (tk(P363)) <= ( 0 ) ) | ( ( (tk(P1986)) <= (tk(P1405)) ) & ( ( 1 ) <= (tk(P1129)) ) ) )) | (! ( (! ( ( 1 ) <= (tk(P3150)) )) & ( ( 1 ) <= (tk(P1847)) ) )) )) ) ) | (! ( (tk(P2076)) <= (tk(P3172)) )) ) )))
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-14 (reachable & potential(( ( (! ( (tk(P236)) <= ( 0 ) )) | ( (! ( (tk(P194)) <= ( 0 ) )) & (! ( (tk(P3219)) <= ( 0 ) )) ) ) | (! ( ( ( ( ( ( ( (tk(P1471)) <= (tk(P3009)) ) & ( ( ( 1 ) <= (tk(P1240)) ) & ( ( 1 ) <= (tk(P1639)) ) ) ) & ( (! ( (tk(P1975)) <= (tk(P2330)) )) & (! ( ( 1 ) <= (tk(P1659)) )) ) ) & ( (tk(P2261)) <= ( 1 ) ) ) & ( ( (tk(P1575)) <= (tk(P1242)) ) & ( ( 1 ) <= (tk(P1270)) ) ) ) | ( ( ( (tk(P2114)) <= ( 0 ) ) & ( ( ( (tk(P1261)) <= (tk(P3202)) ) & ( ( (tk(P3414)) <= ( 1 ) ) & ( (tk(P838)) <= (tk(P2809)) ) ) ) | ( (tk(P3146)) <= ( 0 ) ) ) ) | ( ( ( ( ( ( 1 ) <= (tk(P3290)) ) | ( (tk(P686)) <= ( 1 ) ) ) | ( ( (tk(P1166)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P416)) ) ) ) | ( (! ( ( 1 ) <= (tk(P2995)) )) | (! ( (tk(P2158)) <= ( 0 ) )) ) ) & ( (! ( ( ( 1 ) <= (tk(P235)) ) | ( (tk(P3433)) <= (tk(P1669)) ) )) & ( ( ( 1 ) <= (tk(P39)) ) & ( (tk(P1289)) <= ( 1 ) ) ) ) ) ) ) | ( (! ( ( ( (tk(P763)) <= ( 1 ) ) | ( (tk(P1367)) <= (tk(P3152)) ) ) & ( ( (! ( ( 1 ) <= (tk(P1561)) )) | (! ( (tk(P2826)) <= ( 1 ) )) ) & ( (! ( (tk(P1075)) <= ( 0 ) )) | ( (tk(P2979)) <= (tk(P1789)) ) ) ) )) & ( ( 1 ) <= (tk(P1563)) ) ) )) )))
PROPERTY: FlexibleBarrier-PT-16b-ReachabilityCardinality-15 (reachable &!potential( ( ( ( (tk(P47)) <= (tk(P201)) ) | ( ( 1 ) <= (tk(P117)) ) ) | ( (tk(P2456)) <= ( 1 ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 12436480 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16103348 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
Caught signal 15, terminating.

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="FlexibleBarrier-PT-16b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is FlexibleBarrier-PT-16b, 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 r171-tall-167838858800550"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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