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.r265-smll-167863539800254.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 NoC3x3-PT-2B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539800254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 10:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 10:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 548K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678870862528

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=NoC3x3-PT-2B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 09:01:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 09:01:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 09:01:05] [INFO ] Load time of PNML (sax parser for PT used): 287 ms
[2023-03-15 09:01:05] [INFO ] Transformed 2003 places.
[2023-03-15 09:01:05] [INFO ] Transformed 2292 transitions.
[2023-03-15 09:01:05] [INFO ] Found NUPN structural information;
[2023-03-15 09:01:05] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 456 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 16 resets, run finished after 812 ms. (steps per millisecond=12 ) properties (out of 15) seen :6
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) 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 9) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :1
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2292 rows 2003 cols
[2023-03-15 09:01:07] [INFO ] Computed 66 place invariants in 48 ms
[2023-03-15 09:01:08] [INFO ] After 1208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-15 09:01:09] [INFO ] [Nat]Absence check using 66 positive place invariants in 72 ms returned sat
[2023-03-15 09:01:11] [INFO ] After 2164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-15 09:01:12] [INFO ] Deduced a trap composed of 64 places in 498 ms of which 9 ms to minimize.
[2023-03-15 09:01:13] [INFO ] Deduced a trap composed of 68 places in 463 ms of which 2 ms to minimize.
[2023-03-15 09:01:13] [INFO ] Deduced a trap composed of 55 places in 399 ms of which 2 ms to minimize.
[2023-03-15 09:01:13] [INFO ] Deduced a trap composed of 78 places in 230 ms of which 2 ms to minimize.
[2023-03-15 09:01:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2085 ms
[2023-03-15 09:01:14] [INFO ] Deduced a trap composed of 28 places in 379 ms of which 2 ms to minimize.
[2023-03-15 09:01:14] [INFO ] Deduced a trap composed of 53 places in 287 ms of which 2 ms to minimize.
[2023-03-15 09:01:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 962 ms
[2023-03-15 09:01:16] [INFO ] Deduced a trap composed of 37 places in 595 ms of which 2 ms to minimize.
[2023-03-15 09:01:16] [INFO ] Deduced a trap composed of 98 places in 423 ms of which 2 ms to minimize.
[2023-03-15 09:01:17] [INFO ] Deduced a trap composed of 123 places in 437 ms of which 1 ms to minimize.
[2023-03-15 09:01:17] [INFO ] Deduced a trap composed of 86 places in 401 ms of which 1 ms to minimize.
[2023-03-15 09:01:18] [INFO ] Deduced a trap composed of 108 places in 393 ms of which 1 ms to minimize.
[2023-03-15 09:01:18] [INFO ] Deduced a trap composed of 66 places in 373 ms of which 1 ms to minimize.
[2023-03-15 09:01:19] [INFO ] Deduced a trap composed of 72 places in 341 ms of which 1 ms to minimize.
[2023-03-15 09:01:19] [INFO ] Deduced a trap composed of 109 places in 291 ms of which 1 ms to minimize.
[2023-03-15 09:01:20] [INFO ] Deduced a trap composed of 86 places in 279 ms of which 2 ms to minimize.
[2023-03-15 09:01:20] [INFO ] Deduced a trap composed of 77 places in 216 ms of which 2 ms to minimize.
[2023-03-15 09:01:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4868 ms
[2023-03-15 09:01:20] [INFO ] After 11172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 950 ms.
[2023-03-15 09:01:21] [INFO ] After 13265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 381 ms.
Support contains 57 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1545 edges and 2003 vertex of which 64 / 2003 are part of one of the 8 SCC in 17 ms
Free SCC test removed 56 places
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 378 transitions
Trivial Post-agglo rules discarded 378 transitions
Performed 378 trivial Post agglomeration. Transition count delta: 378
Iterating post reduction 0 with 387 rules applied. Total rules applied 388 place count 1938 transition count 1850
Reduce places removed 378 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 388 rules applied. Total rules applied 776 place count 1560 transition count 1840
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 786 place count 1550 transition count 1840
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 786 place count 1550 transition count 1813
Deduced a syphon composed of 27 places in 8 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 840 place count 1523 transition count 1813
Discarding 345 places :
Symmetric choice reduction at 3 with 345 rule applications. Total rules 1185 place count 1178 transition count 1468
Iterating global reduction 3 with 345 rules applied. Total rules applied 1530 place count 1178 transition count 1468
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 1530 place count 1178 transition count 1430
Deduced a syphon composed of 38 places in 6 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1606 place count 1140 transition count 1430
Discarding 123 places :
Symmetric choice reduction at 3 with 123 rule applications. Total rules 1729 place count 1017 transition count 1270
Iterating global reduction 3 with 123 rules applied. Total rules applied 1852 place count 1017 transition count 1270
Discarding 107 places :
Symmetric choice reduction at 3 with 107 rule applications. Total rules 1959 place count 910 transition count 1154
Iterating global reduction 3 with 107 rules applied. Total rules applied 2066 place count 910 transition count 1154
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 2101 place count 875 transition count 1090
Iterating global reduction 3 with 35 rules applied. Total rules applied 2136 place count 875 transition count 1090
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 12 rules applied. Total rules applied 2148 place count 873 transition count 1080
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2150 place count 871 transition count 1080
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 2175 place count 846 transition count 1055
Iterating global reduction 5 with 25 rules applied. Total rules applied 2200 place count 846 transition count 1055
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 2204 place count 844 transition count 1053
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2206 place count 842 transition count 1053
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 2218 place count 830 transition count 1029
Iterating global reduction 7 with 12 rules applied. Total rules applied 2230 place count 830 transition count 1029
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 2242 place count 818 transition count 1017
Iterating global reduction 7 with 12 rules applied. Total rules applied 2254 place count 818 transition count 1017
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 2266 place count 818 transition count 1005
Performed 293 Post agglomeration using F-continuation condition.Transition count delta: 293
Deduced a syphon composed of 293 places in 1 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 8 with 586 rules applied. Total rules applied 2852 place count 525 transition count 712
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 2863 place count 514 transition count 701
Iterating global reduction 8 with 11 rules applied. Total rules applied 2874 place count 514 transition count 701
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2881 place count 507 transition count 687
Iterating global reduction 8 with 7 rules applied. Total rules applied 2888 place count 507 transition count 687
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2889 place count 506 transition count 685
Iterating global reduction 8 with 1 rules applied. Total rules applied 2890 place count 506 transition count 685
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 8 with 40 rules applied. Total rules applied 2930 place count 486 transition count 725
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2931 place count 485 transition count 723
Iterating global reduction 8 with 1 rules applied. Total rules applied 2932 place count 485 transition count 723
Free-agglomeration rule applied 31 times.
Iterating global reduction 8 with 31 rules applied. Total rules applied 2963 place count 485 transition count 692
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 37 rules applied. Total rules applied 3000 place count 454 transition count 686
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 3006 place count 454 transition count 680
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3008 place count 454 transition count 679
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3010 place count 452 transition count 679
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 3017 place count 452 transition count 679
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 3022 place count 452 transition count 679
Applied a total of 3022 rules in 1240 ms. Remains 452 /2003 variables (removed 1551) and now considering 679/2292 (removed 1613) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1241 ms. Remains : 452/2003 places, 679/2292 transitions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :2
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 09:01:23] [INFO ] Flow matrix only has 677 transitions (discarded 2 similar events)
// Phase 1: matrix 677 rows 452 cols
[2023-03-15 09:01:23] [INFO ] Computed 55 place invariants in 12 ms
[2023-03-15 09:01:24] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 09:01:24] [INFO ] [Nat]Absence check using 55 positive place invariants in 16 ms returned sat
[2023-03-15 09:01:24] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 09:01:24] [INFO ] State equation strengthened by 64 read => feed constraints.
[2023-03-15 09:01:24] [INFO ] After 133ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 09:01:24] [INFO ] After 256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-15 09:01:24] [INFO ] After 852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 40 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 679/679 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 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 678
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 451 transition count 678
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 451 transition count 676
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 449 transition count 676
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 10 place count 445 transition count 663
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 445 transition count 663
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 445 transition count 662
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 29 place count 438 transition count 655
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 436 transition count 653
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 436 transition count 653
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 436 transition count 652
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 35 place count 435 transition count 650
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 435 transition count 650
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 42 place count 432 transition count 663
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 44 place count 430 transition count 655
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 430 transition count 655
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 47 place count 429 transition count 650
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 429 transition count 650
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 49 place count 428 transition count 648
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 428 transition count 648
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 59 place count 428 transition count 639
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 428 transition count 638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 61 place count 427 transition count 638
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 62 place count 427 transition count 638
Applied a total of 62 rules in 181 ms. Remains 427 /452 variables (removed 25) and now considering 638/679 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 427/452 places, 638/679 transitions.
Incomplete random walk after 10000 steps, including 108 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 256595 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 256595 steps, saw 65904 distinct states, run finished after 3002 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 09:01:28] [INFO ] Flow matrix only has 636 transitions (discarded 2 similar events)
// Phase 1: matrix 636 rows 427 cols
[2023-03-15 09:01:28] [INFO ] Computed 55 place invariants in 5 ms
[2023-03-15 09:01:28] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 09:01:28] [INFO ] [Nat]Absence check using 55 positive place invariants in 18 ms returned sat
[2023-03-15 09:01:28] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 09:01:28] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-15 09:01:29] [INFO ] After 115ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 09:01:29] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2023-03-15 09:01:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-15 09:01:29] [INFO ] After 318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-15 09:01:29] [INFO ] After 870ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 40 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 638/638 transitions.
Applied a total of 0 rules in 16 ms. Remains 427 /427 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 427/427 places, 638/638 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 638/638 transitions.
Applied a total of 0 rules in 14 ms. Remains 427 /427 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2023-03-15 09:01:29] [INFO ] Flow matrix only has 636 transitions (discarded 2 similar events)
[2023-03-15 09:01:29] [INFO ] Invariant cache hit.
[2023-03-15 09:01:29] [INFO ] Implicit Places using invariants in 490 ms returned [11, 45, 122, 260, 320, 350, 403]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 493 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 420/427 places, 638/638 transitions.
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 0 with 32 rules applied. Total rules applied 32 place count 404 transition count 622
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 46 place count 404 transition count 608
Applied a total of 46 rules in 31 ms. Remains 404 /420 variables (removed 16) and now considering 608/638 (removed 30) transitions.
[2023-03-15 09:01:29] [INFO ] Flow matrix only has 606 transitions (discarded 2 similar events)
// Phase 1: matrix 606 rows 404 cols
[2023-03-15 09:01:29] [INFO ] Computed 48 place invariants in 4 ms
[2023-03-15 09:01:30] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-15 09:01:30] [INFO ] Flow matrix only has 606 transitions (discarded 2 similar events)
[2023-03-15 09:01:30] [INFO ] Invariant cache hit.
[2023-03-15 09:01:30] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-15 09:01:31] [INFO ] Implicit Places using invariants and state equation in 781 ms returned [6, 10, 31, 32, 35, 36, 40, 41, 75, 78, 79, 103, 104, 109, 110, 114, 144, 145, 146, 147, 150, 151, 152, 157, 158, 162, 163, 164, 236, 237, 238, 242, 244, 245, 248, 249, 250, 302, 306, 321, 322, 323, 326, 327, 332, 333, 377, 378, 381, 382]
Discarding 50 places :
Implicit Place search using SMT with State Equation took 1088 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 354/427 places, 608/638 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 354 transition count 600
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 346 transition count 600
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 88 place count 310 transition count 564
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 309 transition count 562
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 309 transition count 562
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 309 transition count 561
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 107 place count 301 transition count 563
Free-agglomeration rule (complex) applied 59 times.
Iterating global reduction 3 with 59 rules applied. Total rules applied 166 place count 301 transition count 515
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 66 rules applied. Total rules applied 232 place count 242 transition count 508
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 235 place count 242 transition count 505
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 241 place count 242 transition count 505
Applied a total of 241 rules in 76 ms. Remains 242 /354 variables (removed 112) and now considering 505/608 (removed 103) transitions.
[2023-03-15 09:01:31] [INFO ] Flow matrix only has 501 transitions (discarded 4 similar events)
// Phase 1: matrix 501 rows 242 cols
[2023-03-15 09:01:31] [INFO ] Computed 35 place invariants in 5 ms
[2023-03-15 09:01:31] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-15 09:01:31] [INFO ] Flow matrix only has 501 transitions (discarded 4 similar events)
[2023-03-15 09:01:31] [INFO ] Invariant cache hit.
[2023-03-15 09:01:31] [INFO ] State equation strengthened by 104 read => feed constraints.
[2023-03-15 09:01:31] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 242/427 places, 505/638 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2446 ms. Remains : 242/427 places, 505/638 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 370831 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 370831 steps, saw 74347 distinct states, run finished after 3002 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 09:01:35] [INFO ] Flow matrix only has 501 transitions (discarded 4 similar events)
[2023-03-15 09:01:35] [INFO ] Invariant cache hit.
[2023-03-15 09:01:35] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 09:01:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-15 09:01:35] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 09:01:35] [INFO ] State equation strengthened by 104 read => feed constraints.
[2023-03-15 09:01:35] [INFO ] After 108ms SMT Verify possible using 104 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 09:01:35] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-15 09:01:35] [INFO ] After 625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 40 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 505/505 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 242/242 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 505/505 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2023-03-15 09:01:35] [INFO ] Flow matrix only has 501 transitions (discarded 4 similar events)
[2023-03-15 09:01:35] [INFO ] Invariant cache hit.
[2023-03-15 09:01:36] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-15 09:01:36] [INFO ] Flow matrix only has 501 transitions (discarded 4 similar events)
[2023-03-15 09:01:36] [INFO ] Invariant cache hit.
[2023-03-15 09:01:36] [INFO ] State equation strengthened by 104 read => feed constraints.
[2023-03-15 09:01:36] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2023-03-15 09:01:36] [INFO ] Redundant transitions in 78 ms returned []
[2023-03-15 09:01:36] [INFO ] Flow matrix only has 501 transitions (discarded 4 similar events)
[2023-03-15 09:01:36] [INFO ] Invariant cache hit.
[2023-03-15 09:01:37] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1300 ms. Remains : 242/242 places, 505/505 transitions.
Graph (trivial) has 64 edges and 242 vertex of which 30 / 242 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions removed 44 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 46 transitions.
Graph (complete) has 760 edges and 227 vertex of which 216 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 20 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 216 transition count 426
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 212 transition count 422
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 47 place count 212 transition count 418
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 212 transition count 406
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 76 place count 212 transition count 406
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 212 transition count 405
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 212 transition count 404
Applied a total of 78 rules in 41 ms. Remains 212 /242 variables (removed 30) and now considering 404/505 (removed 101) transitions.
Running SMT prover for 2 properties.
[2023-03-15 09:01:37] [INFO ] Flow matrix only has 402 transitions (discarded 2 similar events)
// Phase 1: matrix 402 rows 212 cols
[2023-03-15 09:01:37] [INFO ] Computed 30 place invariants in 3 ms
[2023-03-15 09:01:37] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 09:01:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-15 09:01:37] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 09:01:37] [INFO ] State equation strengthened by 121 read => feed constraints.
[2023-03-15 09:01:37] [INFO ] After 77ms SMT Verify possible using 121 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 09:01:37] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-15 09:01:37] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-15 09:01:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-15 09:01:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 242 places, 505 transitions and 2320 arcs took 5 ms.
[2023-03-15 09:01:38] [INFO ] Flatten gal took : 123 ms
Total runtime 32962 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/582/inv_0_ --invariant=/tmp/582/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11256152 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099076 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//
++ 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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-2B"
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 NoC3x3-PT-2B, 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 r265-smll-167863539800254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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